It hasbeenshown that onetriangulation of a setof points canbeconvertedto any othertriangulationof thesamesetof pointsby asequenc eof edgeflip operations.In thispaperwe considera tesselationof a setof pointsconsistingof convex cells,aconvex subdivision, andexplorethenotionof flipping edgesfrom oneconvex subdi vision of thepoints to another, wherebothsubdi visions usethesamenumber of edges.It is easyto construct examplesof aconvex subdi visionwhereno singleedgecanbe flipped so that the convexity of all cells of thesubdi vision is maintained. At theCCCG in 2003 FerranHurtadoaskedwhetherthereexistsaconvex subdivision for which the sizeof the minimal simultaneous edgeflip is linearwith respectto thenumberof edges.In thepaperwe construct sucha subdivision.
[1]
Henk Meijer,et al.
Minimum convex partition of a constrained point set
,
2001,
Discret. Appl. Math..
[2]
Marc Noy,et al.
Simultaneous Edge Flipping in Triangulations
,
2003,
Int. J. Comput. Geom. Appl..
[3]
Charles L. Lawson,et al.
Transforming triangulations
,
1972,
Discret. Math..
[4]
Marc Noy,et al.
Flipping Edges in Triangulations
,
1996,
SCG '96.
[5]
Atsuyuki Okabe,et al.
Spatial Tessellations: Concepts and Applications of Voronoi Diagrams
,
1992,
Wiley Series in Probability and Mathematical Statistics.