Visibility-preserving convexifications using single-vertex moves
From MaRDI portal
Publication:413272
DOI10.1016/J.IPL.2011.11.012zbMATH Open1237.68234arXiv1105.3435OpenAlexW2964087397MaRDI QIDQ413272FDOQ413272
J. Leaños, Gelasio Salazar, M. Cetina, B. M. Ábrego
Publication date: 4 May 2012
Published in: Information Processing Letters (Search for Journal in Brave)
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).
Full work available at URL: https://arxiv.org/abs/1105.3435
Recommendations
computational geometryvisibilityconvexificationpolygonsingle-vertex movesvisibility-maintainingvisibility-preserving
Cites Work
Cited In (6)
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)