Minimum rectilinear polygons for given angle sequences

DOI10.1016/j.comgeo.2021.101820OpenAlexW3190428801MaRDI QIDQ824339

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

Publication date: 15 December 2021

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2021.101820

zbMATH Keywords

NP-hardnessexact algorithmsorthogonal representationangle sequenceminimum rectilinear polygon

Mathematics Subject Classification ID

Theory of computing (68Qxx) Graph theory (05Cxx) Computing methodologies and applications (68Uxx)

Related Items (1)

Parameterized approaches to orthogonal compaction

Cites Work

• Unnamed Item
• 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
• Area bounds of rectilinear polygons realized by angle sequences
• Minimum Rectilinear Polygons for Given Angle Sequences
• Inapproximability of Orthogonal Compaction
• Rectilinear Graphs and Their Embeddings
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• On the complexity of orthogonal compaction

This page was built for publication: Minimum rectilinear polygons for given angle sequences