Convexifying monotone polygons while maintaining internal visibility

DOI10.1007/978-3-642-34191-5_9MaRDI QIDQ4899268zbMATH OpenOpenAlexFDO

Authors Oswin Aichholzer, M. Cetina, J. Urrutia, R. Fabila-Monroy, J. Leaños, Gelasio Salazar

Publication date 7 January 2013

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

Full work available at URL https://doi.org/10.1007/978-3-642-34191-5_9

zbMATH Keywords

convexificationvisibility graphmonotone polygons

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)

Recommendations

• Visibility-preserving convexifications using single-vertex moves
• scientific article; zbMATH DE number 1522946
• Recognizing weakly convex visible polygons
• Reconfiguring convex polygons
• scientific article; zbMATH DE number 2077120

Cites work

• scientific article; zbMATH DE number 1522946 (Why is no real title available?)
• scientific article; zbMATH DE number 866052 (Why is no real title available?)
• Flipturning Polygons
• Visibility graphs and deformations of associahedra
• Visibility-preserving convexifications using single-vertex moves

Cited in

(3)

• On local transformation of polygons with visibility properties.
• Visibility-preserving convexifications using single-vertex moves
• scientific article; zbMATH DE number 1522946 (Why is no real title available?)

This page was built for publication: Convexifying monotone polygons while maintaining internal visibility

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4899268)