Visibility-preserving convexifications using single-vertex moves

Details Visibility-preserving convexifications using single-vertex moves Visibility-preserving convexifications using single-vertex moves

2011-05-17

arxiv.org/abs/1105.3435v1

Computer Science

Computational Geometry

Scientific paper

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).

Affiliated with

Also associated with

No associations

Rating

Visibility-preserving convexifications using single-vertex moves does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Visibility-preserving convexifications using single-vertex moves, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Visibility-preserving convexifications using single-vertex moves will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-727955