Enumerating Empty and Surrounding Polygons-Reference-Cited by-同舟云学术

Enumerating Empty and Surrounding Polygons

Published:2023-09-01 Issue:9 Volume:E106.A Page:1082-1091
ISSN:0916-8508
Container-title:IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
language:en
Short-container-title:IEICE Trans. Fundamentals

Author:

TERUI Shunta¹,YAMANAKA Katsuhisa¹,HIRAYAMA Takashi¹,HORIYAMA Takashi²,KURITA Kazuhiro³,UNO Takeaki⁴

Affiliation:

1. Iwate University

2. Hokkaido University

3. Nagoya University

4. National Institute of Informatics

Publisher

Institute of Electronics, Information and Communications Engineers (IEICE)

Subject

Applied Mathematics,Electrical and Electronic Engineering,Computer Graphics and Computer-Aided Design,Signal Processing

Link

https://www.jstage.jst.go.jp/article/transfun/E106.A/9/E106.A_2022DMP0007/_pdf

Reference26 articles.

1. [1] K. Wasa, “Enumeration of enumeration algorithms,” CoRR, vol.abs/1605.05102, 2016. 10.48550/arXiv.1605.05102

2. [2] D. Avis and K. Fukuda, “Reverse search for enumeration,” Discrete Applied Mathematics, vol.65, no.1-3, pp.21-46, 1996. 10.1016/0166-218x(95)00026-n

3. [3] S. Bespamyatnikh, “An efficient algorithm for enumeration of triangulations,” Computational Geometry, vol.23, no.3, pp.271-279, 2002. 10.1016/s0925-7721(02)00111-6

4. [4] N. Katoh and S. Tanigawa, “Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees,” Discrete Applied Mathematics, vol.157, no.17, pp.3569-3585, 2009. 10.1016/j.dam.2009.04.019

5. [5] M. Wettstein, “Counting and enumerating crossing-free geometric graphs,” Journal of Computational Geometry, vol.8, no.1, pp.47-77, 2017. 10.20382/jocg.v8i1a4