Minimum Rectilinear Polygons for Given Angle Sequences

DOI10.1007/978-3-319-48532-4_10zbMath1482.68250arXiv1606.06940OpenAlexW2466150543MaRDI QIDQ2958091

Krzysztof Fleszar, Philipp Kindermann, Chan-Su Shin, Alexander Wolff, Noushin Saeedi, William S. Evans

Publication date: 1 February 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1606.06940

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

Minimum rectilinear polygons for given angle sequences ⋮ Minimum Rectilinear Polygons for Given Angle Sequences ⋮ Area bounds of rectilinear polygons realized by angle sequences ⋮ On Turn-Regular Orthogonal Representations

Cites Work

• Unnamed Item
• An improved algorithm for reconstructing a simple polygon from its visibility angles
• Reconstructing polygons from scanner data
• A polygon is determined by its angles
• Drawing polygons given angle sequences
• Minimum Rectilinear Polygons for Given Angle Sequences
• Rectilinear Graphs and Their Embeddings
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• Area Bounds of Rectilinear Polygons Realized by Angle Sequences
• On the complexity of orthogonal compaction

This page was built for publication: Minimum Rectilinear Polygons for Given Angle Sequences