Visibility-preserving convexifications using single-vertex moves Article

•  
• Overview
•  
• Research
•  
• Identity
•  
• Additional Document Info
•  
• View All
•  

Overview

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 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). © 2011 Elsevier B.V. All rights reserved.

authors

• Cetina M.
• Leaños J.
• Salazar Anaya Gelasio
• Ábrego B.M.

publication date

• 2012-01-01

funding provided via

• Consejo Nacional de Ciencia y Tecnología, CONACYT: 106432  Grant

published in

• Information Processing Letters  Journal

Research

keywords

• Computational geometry; Convexification; Polygon; Single-vertex moves; Visibility; Visibility-maintaining; Visibility-preserving Convexification; Polygon; Single-vertex moves; Visibility-maintaining; Visibility-preserving; Computational geometry; Visibility

Identity

Digital Object Identifier (DOI)

• 10.1016/j.ipl.2011.11.012

Additional Document Info

start page

• 161

end page

• 163

volume

• 112

issue

• 5