Spatial embedding of pseudo-triangulations

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2003, Pages 144-153

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

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^c FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Constrained regular complexes; Polytope representation; Pseudo triangulations; Three dimensional embedding

Indexed keywords

ALGORITHMS; FUNCTIONS; THEOREM PROVING;

PSEUDO-TRIANGULATIONS;

DATA PROCESSING;

EID: 0037700507     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (39)

1. P.K.Agarwal, J.Basch, L.J.Guibas, J.Hershberger, L.Zhang. Deformable free space tilings for kinetic collision detection. In B.R.Donald, K.Lynch, D.Rus (eds.), Algorithmic and Computational Robotics: New Directions (Proc. 5th Workshop Algorithmic Found. Robotics), 2001, 83-96.
2. H.Ahn, S.-W.Cheng, O.Cheong, J.Snoeyink. The reflex-free hull. 13th Canadian Conf. Computational Geometry 2001, 9-12.
3. O.Aichholzer, F.Aurenhammer. Straight skeletons for general polygonal figures in the plane. In: Voronoi's Impact on Modern Sciences II, A.M.Samoilenko (ed.), Proc. Institute of Mathematics of the National Academy of Sciences of Ukraine 21, 1998, 7-21.
4. O.Aichholzer, F.Aurenhammer, F.Hurtado. Sequences of spanning trees and a fixed tree theorem. Computational Geometry: Theory and Applications 21 (2002), 3-20.
5. O.Aichholzer, F.Aurenhammer, H.Krasser. Adapting pseudo-triangulations with a near-linear number of edge flips. Manuscript, 2002.
6. O.Aichholzer, F.Aurenhammer, H.Krasser, B.Speckmann. Convexity minimizes pseudo-triangulations. Proc. 14th Canadian Conf. Computational Geometry 2002, 158-161.
7. F.Aurenhammer. Power diagrams: properties, algorithms, and applications. SIAM J. Computing 16 (1987), 78-95.
8. d+1. Discrete & Computational Geometry, 2 (1987), 49-64.
9. F.Aurenhammer. A relationship between Gale transforms and Voronoi diagrams. Discrete Applied Mathematics, 28 (1990), 83-91.
10. F.Aurenhammer, Y.-F.Xu. Optimal triangulations. In: P.M.Pardalos, C.A.Floudas (eds), Encyclopedia of Optimization 4, Kluwer Academic Publishing, 2000, 160-166.
11. M.Bern, D.Eppstein. Mesh generation and optimal triangulation. In: D.-Z.Du, F Hwang (eds), Computing in Euclidean Geometry, Lecture Notes Series on Computing 4, World Scientific, 1995, 47-123.
12. L.J.Billera, P.Filliman, B.Sturmfels. Constructions and complexity of secondary polytopes. Advances in Mathematics 83 (1990), 155-179.
13. H.Brönnimann, L.Kettner, M.Pocchiola, J.Snoeyink. Counting and enumerating pseudo-triangulations with the greedy flip algorithm. Manuscript, 2001.
14. B.Chazelle, H.Edelsbrunner, M.Grigni, L.J.Guibas, J.Hershberger, M.Sharir, J.Snoeyink. Ray shooting in polygons using geodesic triangulations. Algorithmica 12 (1994), 54-68.
15. L.P.Chew. Constrained Delaunay triangulations. Algorithmica 4 (1989), 97-108.
16. H.Crapo, W.Whiteley. Spaces of stresses, projections, and parallel drawings of spherical polyhedra. Beiträge Algebra Geom. 35 (1994), 259-281.
17. H.Edelsbrunner. The union of balls and its dual shape. Discrete & Computational Geometry 13 (1995), 415-440.
18. H.Edelsbrunner, E.P.Mücke. Three-dimensional alpha shapes. ACM Transactions Graph. 13 (1994), 43-72.
19. H.Edelsbrunner, N.R.Shah. Incremental topological flipping works for regular triangulations. Algorithmica 15 (1996), 223-241.
20. S.Fortune. Voronoi diagrams and Delaunay triangulations. In: D.-Z.Du, F.Hwang (eds), Computing in Euclidean Geometry, Lecture Notes Series on Computing 4, World Scientific, 1995, 225-265.
21. I.M.Gel'fand, M.M.Kapranov, A.V.Zelevinsky. Newton polyhedra of principal A-determinants. Soviet Math. Dokl. 308 (1989), 20-23.
22. M.T.Goodrich, R.Tamassia. Dynamic ray shooting and shortest paths in planar subdivisions via balanced geodesic triangulations. J. Algorithms 23 (1997), 51-73.
23. R.Haas, F.Santos, B.Servatius, D.Souvaine, I.Streinu, W.Whiteley. Planar minimally rigid graphs have pseudo-triangular embeddings. Manuscript, 2002.
24. L.Kettner, D.Kirkpatrick, A.Mantler, J.Snoeyink, B.Speckmann, F.Takeuchi. Tight degree bounds for pseudo-triangulations of points. Computational Geometry: Theory and Applications, 2002. To appear.
25. D.Kirkpatrick, J.Snoeyink, B.Speckmann. Kinetic collision detection for simple polygons. Intern. J. Computational Geometry & Applications 12 (2002), 3-27.
26. D.Kirkpatrick, B.Speckmann. Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons. Proc. 18th Ann. ACM Sympos. Computational Geometry 2002, 179-188.
27. C.L.Lawson. Properties of n-dimensional triangulations. Computer Aided Geometric Design 3 (1986), 231-246.
28. C.W.Lee. The associahedron and triangulations of the n-gon. European J. Combinatorics 10 (1989), 173-181.
29. D.T.Lee, A.K.Lin. Generalized Delaunay triangulation for planar graphs. Discrete & Computational Geometry 1 (1986), 201-217.
30. D.Orden, F.Santos. The polyhedron of non-crossing graphs on a planar point set. Manuscript, 2002.
31. M.Pocchiola, G.Vegter. Minimal tangent visibility graphs. Computational Geometry: Theory and Applications 6 (1996), 303-314.
32. M.Pocchiola, G.Vegter. Topologically sweeping visibility complexes via pseudo-triangulations. Discrete & Computational Geometry 16 (1996), 419-453.
33. M.Pocchiola, G.Vegter. On polygon covers. Contemporary Mathematics 223 (1999), 257-258.
34. D.Randall, G.Rote, F.Santos, J.Snoeyink. Counting triangulations and pseudo-triangulations of wheels. Proc. 13th Canadian Conf. Computational Geometry 2001, 117-120.
35. d. Discrete U Computational Geometry 12 (1994), 189-202.
36. G.Rote, F.Santos, I.Streinu. Expansive motions and the polytope of pointed pseudo-triangulations. Manuscript, FU-Berlin, 2001.
37. G.Rote, C.A.Wang, L.Wang, Y.Xu. On constrained minimum pseudo-triangulations. Manuscript, FU-Berlin, 2002.
38. B.Speckmann, C.D.Toth. Allocating vertex π-guards in simple polygons via pseudo-triangulations. Abstr. 18th Europ. Workshop Computational Geometry, 2002, 12-15.
39. st IEEE Symp. FOCS, 2000, 443-453.