Visibility-preserving convexifications using single-vertex moves

DOI10.1016/J.IPL.2011.11.012MaRDI QIDQ413272zbMATH OpenOpenAlexFDO

Authors M. Cetina, B. M. Ábrego, J. Leaños, Gelasio Salazar

Publication date 4 May 2012

Published in Information Processing Letters (Search for Journal in Brave)

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

zbMATH Keywords

computational geometryvisibilityconvexificationpolygonsingle-vertex movesvisibility-maintainingvisibility-preserving

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Abstract: Devadoss asked: (1) can every polygon be convexified so that no internal visibility (between vertices) is lost in the process? Moreover, (2) does such a convexification exist, in which exactly one vertex is moved at a time (that is, using {em single-vertex moves})? We prove the redundancy of the "single-vertex moves" condition: an affirmative answer to (1) implies an affirmative answer to (2). Since Aichholzer et al. recently proved (1), this settles (2).

Recommendations

• Convexifying monotone polygons while maintaining internal visibility
• Reconfiguring convex polygons
• scientific article; zbMATH DE number 1522946
• Convexification of polygons by flips and by flipturns
• Convexifying polygons with simple projections

Cites work

• Acute triangulations of polygons
• Convexifying monotone polygons while maintaining internal visibility
• Straightening polygonal arcs and convexifying polygonal cycles
• Visibility graphs and deformations of associahedra

Cited in

(9)

• Convexification of polygons by length preserving transformations
• On local transformation of polygons with visibility properties.
• Visibility-monotonic polygon deflation
• Strongly-Delaunay starshaped polygons
• scientific article; zbMATH DE number 1696622 (Why is no real title available?)
• Convexifying monotone polygons while maintaining internal visibility
• Reconfiguring convex polygons
• scientific article; zbMATH DE number 1522946 (Why is no real title available?)
• Convexifying polygons with simple projections

This page was built for publication: Visibility-preserving convexifications using single-vertex moves

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