Pseudotriangulations from surfaces and a novel type of edge flip

SIAM Journal on Computing

Volumn 32, Issue 6, 2003, Pages 1621-1653

  Aichholzer, Oswin ^a   Aurenhammer, Franz ^b   Krasser, Hannes ^b   Brass, Peter ^c  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^c City College of New York   (United States)

Author keywords

Constrained regular complex; Flip distance; Locally convex function; Polytope representation; Pseudotriangulation; Surface realization

Indexed keywords

CONSTRAINED REGULAR COMPLEX; FLIP DISTANCE; LOCALLY CONVEX FUNCTION; POLYTOPE REPRESENTATION; PSEUDOTRIANGULATIONS; SURFACE REALIZATION;

ALGORITHMS; COMBINATORIAL MATHEMATICS; DATA STRUCTURES; OPTIMIZATION; PROBLEM SOLVING; SURFACE PROPERTIES; THEOREM PROVING;

DATA PROCESSING;

EID: 0942266548     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539702411368     Document Type: Review

References (51)

1. P. K. AGARWAL, J. BASCH, L. J. GUIBAS, J. HERSHBERGER, AND L. ZHANG, Deformable free apace tilings for kinetic collision detection, in Algorithmic and Computational Robotics: New Directions (Proceedings of the 5th Workshop on the Algorithmic Foundations of Robotics), B. R. Donald, K. Lynch, and D. Rus, eds., 2001, pp. 83-96.
2. H. AHN, S.-W. CHENG, O. CHEONG, AND J. SNOEYINK, The reflex-free hull, in Proceedings of the 13th Canadian Conference on Computational Geometry, Waterloo, Canada, 2001, pp. 9-12.
3. O. AICHHOLZER AND F. AURENHAMMER, Straight skeletons for general polygonal figures in the plane, in Voronoi's Impact on Modern Sciences II, A. M. Samoilenko, ed., Proc. Inst. Math. Nat. Acad. Sci, Ukraine 21, Kiev, Ukraine, 1998, pp. 7-21.
4. O. AICHHOLZER, F. AURENHAMMER, AND F. HURTADO, Sequences of spanning trees and a fixed tree theorem, Comput. Geom., 21 (2002). pp. 3-20.
5. O. AICHHOLZER, F. AURENHAMMER, H. KRASSER, AND B. SPECKMANN, Convexity minimizes pseudo-triangulations, in Proceedings of the 14th Canadian Conference on Computational Geometry, Lathbridge, Alberta, Canada, 2002. pp. 158-161.
6. O. AICHHOLZER, M. HOFFMANN, B. SPECKMANN, AND C. D. TÓTH, Degree Bounds for Constrained Pseudo-Triangulations, in Proceedings of the 15th Canadian Conference on Computational Geometry, Halifax, Canada, 2003, pp. 155-158.
7. M. AJTAI, V. CHVÁTAL, M. M. NEWBORN, AND E. SZEMERÉDI. Crossing-free subgraphs, Ann. Discrete Math., 12 (1982), pp. 9-12.
8. F. AURENHAMMER, Power diagrams: Properties, algorithms, and applications, SIAM J. Comput., 16 (1987), pp. 78-96.
9. d+1, Discrete Comput. Geom., 2 (1987), pp. 49-64.
10. F. AURENHAMMER, A relationship between Gale transforms and Voronoi diagrams, Discrete Appl. Math., 28 (1990), pp. 83-91.
11. F. AURENHAMMER AND Y.-F. Xu, Optimal triangulations, in Encyclopedia of Optimization, Vol. 4, C. A. Floudas and P. M. Pardalos, eds., Kluwer Academic Publishing, Dordrecht, The Netherlands, 2000, pp. 160-166.
12. S. BESPAMYATNIKH, Transforming Pseudo-Triangulations, manuscript, Department of Computer Science, University of Texas at Dallas, Dallas, TX, 2003.
13. S. BALAVEN, C. BENNIS, J.-D. BOISSONNAT, AND M. YVINEC, Conforming orthogonal meshes, in Proceedings of the 11th International Meshing Roundtable, Ithaca, NY, 2002, pp. 219-230.
14. M. BERN AND D. EPPSTEIN, Mesh generation and optimal triangulation, in Computing in Euclidean Geometry, D.-Z. Du and F. Hwang, eds., Lecture Notes Ser. Comput. 4, World Scientific, River Edge, NJ, 1995, pp. 47-123.
15. L. J. BILLERA, P. FILLIMAN, AND B. STURMFELS, Constructions and complexity of secondary polytopes, Adv. Math., 83 (1990), pp. 155-179.
16. H. BRÖNNIMANN, L. KETTNER, M. POCCHIOLA, AND J. SNOEYINK, Counting and Enumerating Pseudo-Triangulations with the Greedy Flip Algorithm, manuscript, Polytechnic University, Brooklyn, NY, 2001.
17. B. CHAZELLE, A theorem on polygon cutting with applications, in Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science (FOCS), Chicago, IL, 1982, pp. 339-349.
18. B. CHAZELLE, H. EDELSBRUNNER, M. GRIGNI, L. J. GUIBAS, J. HERSHBERGER, M. SHARIR, AND J. SNOEYINK, Ray shooting in polygons using geodesic triangulations, Algorithmica, 12 (1994), pp. 54-68.
19. L. P. CHEW, Constrained Delaunay triangulations, Algorithmica, 4 (1989), pp. 97-108.
20. H. CRAPO AND W. WHITELEY, Spaces of stresses, projections, and parallel drawings of spherical polyhedra, Beiträge Algebra Geom., 35 (1994), pp. 259-281.
21. L. DE FLORIANI, B. FALCIDIENO, C. PIENOVI, AND G. NAGY, On Sorting Triangles in a Delaunay Tesselation, Technical report, Inst. Mat. Appl., Consiglio Nazionale della Richerche, Genova, Italy, 1988.
22. H. EDELSBRUNNER, An acyclicity theorem for cell complexes in d dimensions, Combinatorica, 10 (1990), pp. 251-260.
23. H. EDELSBRUNNER, The union of balls and its dual shape, Discrete Comput. Geom., 13 (1995), pp. 415-440.
24. H. EDELSBRUNNER AND E. P. MÜCKE, Three-dimensional alpha shapes, ACM Trans. Graph., 13 (1994), pp. 43-72.
25. H. EDELSBRUNNER AND N. R. SHAH, Incremental topological flipping works for regular triangulations, Algorithmica, 15 (1996), pp. 223-241.
26. S. FORTUNE, Voronoi diagrams and Delaunay triangulations, in Computing in Euclidean Geometry, D.-Z. Du and F. Hwang, eds., Lecture Notes Ser. Comput. 4, World Scientific, River Edge, NJ, 1995, pp. 225-265.
27. J. FRIEDMAN, J. HERSHBERGER, AND J. SKOEYINK, Efficiently planning compliant motion in the plane, SIAM J. Comput., 25 (1996), pp. 562-599.
28. I. M. GEL'FAND, M. M. KAPRANOV, AND A. V. ZELEVINSKY, Newton polyhedra of principal A-determinants, Soviet Math. Dokl., 308 (1989), pp. 20-23.
29. M. T. GOODRICH AND R. TAMASSIA, Dynamic ray shooting and shortest paths in planar subdivisions via balanced geodesic triangulations, J. Algorithms, 23 (1997), pp. 51-73.
30. R. HAAS, D. ORDEN, G. ROTE, F. SANTOS, B. SERVATIUS, H. SERVATIUS, D. SOUVAINE, I. STREINU, AND W. WHITELEY, Planar minimally rigid graphs and pseudo-triangulations, Comput. Geom., (2003), pp. 154-163.
31. S. HANKE, T. OTTMANN, AND S. SCHUIERER, The edge-flipping distance of triangulations, J. Univ. Comput. Sci., 2 (1996), pp. 570-579.
32. J. HERSHBERGER, An optimal visibility graph algorithm for triangulated simple polygons, Algorithmica, 4 (1989), pp. 141-155.
33. C. HUEMER, Flip Operations for Combinatorial and Geometric Objects, Masters thesis, Institute for Theoretical Computer Science, Graz University of Technology, Graz, Austria, 2003.
34. F. HURTADO, M. NOY, AND J. URRUTIA, Flipping edges in triangulations, Discrete Comput. Geom., 22 (1999), pp. 333-346.
35. L. KETTNER, D. KIRKPATRICK, A. MANTLER, J. SNOEYINK, B. SPECKMANN, AND F. TAKEUCHI, Tight degree bounds for pseudo-triangulations of points, Comput. Geom., 25 (2003), pp. 3-12.
36. D. KIRKPATRICK, J. SNOEYINK, AND B. SPECKMANN, Kinetic collision detection for simple polygons, Internat. J. Comput. Geom. Appl., 12 (2002), pp. 3-27.
37. D. KIRKPATRICK AND B. SPECKMANN, Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons, in Proceedings of the 18th Annual ACM Symposium on Computational Geometry, Barcelona, Spain, 2002, pp. 179-188.
38. C. L. LAWSON, Properties of n-dimensional triangulations, Comput. Aided Geom. Design, 3 (1986), pp. 231-246.
39. C. W. LEE, The associahedron and triangulations of the n-gon, European J. Combin., 10 (1989), pp. 173-181.
40. D. T. LEE AND A. K. LIN, Generalized Delaunay triangulation for planar graphs, Discrete Comput. Geom., 1 (1986), pp. 201-217.
41. D. ORDEN AND F. SANTOS, The Polyhedron of Non-crossing Graphs on a Planar Point Set, manuscript, Universidad de Cantabria, Santander, Spain, 2002.
42. M. POCCHIOLA AND G. VEGTER, Minimal tangent visibility graphs, Comput. Geom., 6 (1996), pp. 303-314.
43. M. POCCHIOLA AND G. VEGTER, Topologically sweeping visibility complexes via pseudotriangulations, Discrete Comput. Geom., 16 (1996), pp. 419-453.
44. M. POCCHIOLA AND G. VEGTER, On polygon covers, in Advances in Discrete and Computational Geometry, B. Chezeck, D. E. Goodman, and R. Pollack, eds., Contemp. Math. 223, AMS, Providence, RI, 1999, pp. 257-258.
45. D. RANDALL, G. ROTE, F. SANTOS, AND J. SNOEYINK, Counting triangulations and pseudotriangulations of wheels, in Proceedings of the 13th Canadian Conference on Computational Geometry, Waterloo, Canada, 2001, pp. 117-120.
46. V. T. RAJAN, Optimality of the Delaunay triangulation in Rd, Discrete Comput. Geom., 12 (1994), pp. 189-202.
47. G. ROTE, F. SANTOS, AND I. STREINU, Expansive motions and the polytope of pointed pseudo-triangulations, in Discrete and Computational Geometry - The Goodman - Pollack Festschrift, B. Aronov, S. Basu, J. Pach, and M. Sharir, eds., Algorithms and Combinatorics, Springer, Berlin, 2003, pp. 699-736.
48. G. ROTE, C. A. WANG, L. WANG, AND Y. Xu, On Constrained Minimum Pseudo-Triangulations, manuscript, Institut für Informatik, FU-Berlin, 2002.
49. B. SPECKMANN AND C. D. TÓTH, Allocating vertex Tr-guards in simple polygons via pseudotriangulations, in Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, 2003, SIAM, Philadelphia, 2003, pp. 109-118.
50. J. R. SHEWCHUK, Updating and constructing constrained Delaunay and constrained regular triangulations by flips, in Proceedings of the 19th Annual ACM Symposium on Computational Geometry, 2003, pp. 181-190.
51. I. STREINU, A combinatorial approach to planar non-colliding robot arm motion planning, in Proceedings of the 41st IEEE Symposium on Foundations of Computer Science (FOCS), Redondo Beach, CA, 2000, pp. 443-453.