Circumscribing Polygons and Polygonizations for Disjoint Line Segments
-
Published:2022-01-31
Issue:1
Volume:68
Page:218-254
-
ISSN:0179-5376
-
Container-title:Discrete & Computational Geometry
-
language:en
-
Short-container-title:Discrete Comput Geom
Author:
Akitaya Hugo A.ORCID, Korman Matias, Korten Oliver, Rudoy Mikhail, Souvaine Diane L., Tóth Csaba D.
Funder
National Science Foundation Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada Ministry of Education, Culture, Sports, Science and Technology
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference23 articles.
1. Agarwal, P.K., Hurtado, F., Toussaint, G.T., Trias, J.: On polyhedra induced by point sets in space. Discrete Appl. Math. 156(1), 42–54 (2008) 2. Akitaya, H.A., Korman, M., Rudoy, M., Souvaine, D.L., Tóth, C.D.: Circumscribing polygons and polygonizations for disjoint line segments. In: 35th International Symposium on Computational Geometry (Portland 2019). Leibniz Int. Proc. Inform., vol. 129, # 9. Leibniz-Zent. Inform., Wadern (2019) 3. Barequet, G., Benbernou, N., Charlton, D., Demaine, E.D., Demaine, M.L., Ishaque, M., Lubiw, A., Schulz, A., Souvaine, D.L., Toussaint, G.T., Winslow, A.: Bounded-degree polyhedronization of point sets. Comput. Geom. 46(2), 148–153 (2013) 4. Cardinal, J., Hoffmann, M., Kusters, V., Tóth, C.D., Wettstein, M.: Arc diagrams, flip distances, and Hamiltonian triangulations. Comput. Geom. 68, 206–225 (2018) 5. Chambers, E.W., Eppstein, D., Goodrich, M.T., Löffler, M.: Drawing graphs in the plane with a prescribed outer face and polynomial area. J. Graph Algorithms Appl. 16(2), 243–259 (2012)
|
|