Summary
We present algorithms for the efficient insertion and removal of constraints in Delaunay Triangulations. Constraints are considered to be points or any kind of polygonal lines. Degenerations such as edge overlapping, self-intersections or duplicated points are allowed and are automatically detected and fixed on line. As a result, a fully Dynamic Constrained Delaunay Triangulation is achieved, able to efficiently maintain a consistent triangulated representation of dynamic polygonal domains. Several applications in the fields of data visualization, reconstruction, geographic information systems and collision-free path planning are discussed.
Work done while at VRlab-EPFL
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Anglada, M.V. (1997): An Improved Incremental Algorithm for Constructing Restricted Delaunay Triangulations. Computer & Graphics, 21 (2), 215–223
Bernal, J. (1995): Inserting Line Segments into Triangulations and Tetrahedralizations. Actas de los V I Encuentros de Geometria Computacional, Universitat Politecnica de Catalunya, Barcelona, Spain
Boissonnat, J.-D. (1988): Shape Reconstruction from Planar Cross Sections. Computer Vision, Graphics, and Image Processing, 44, 1–29
Boissonat, J.-D., Teillaud, M. (1993): On the Randomized Construction of the Delaunay Tree. Theoretical Computer Science, 112, 339–354
Chew, L.P. (1987): Constrained Delaunay Triangulations. Proceedings of the Annual Symposium on Computational Geometry ACM, 215–222
Devillers, O. (1998): Improved incremental randomized Delaunay triangulation. Proc. of the 14th ACM Symposium on Computational Geometry, 106–115
Devillers, O. (1999): On Deletion in Delaunay Triangulations. Proceedings of the 15th Annual ACM Symposium on Computational Geometry, June
Devillers, O., Pion, S., Teillaud, M. (2001): Walking in a Triangulation. ACM Symposium on Computational Geometry
Fortune, S. (1987): A Sweepline Algorithm for Voronoi Diagrams. Algorithmica, 2, 153–174
De Floriani, L., Puppo, A. (1992): An On-Line Algorithm for Constrained Delaunay Triangulation. Computer Vision, Graphics and Image Processing, 54, 290–300
Guibas, L.J., Knuth, D.E., Sharir, M. (1992): Randomized Incremental Construction of Delaunay and Voronoi Diagrams. Algorithmica, 7, 381–413
Guibas, L., Stolfi, J. (1985): Primitives for the Manipulation of General Subdivisions and the Computation of Voronoi Diagrams. ACM Transactions on Graphics, 4 (2), 75–123
Held, M. (2001): VRONI: An Engineering Approach to the Reliable and Efficient Computation of Voronoi Diagrams of Points and Line Segments. Computational Geometry Theory and Applications, 18, 95–123
Mücke, E.P., Saias, I., Zhu, B. (1996): Fast Randomized Point Location Without Preprocessing in Two and Three-dimensional Delaunay Triangulations. Proc. of the Twelfth ACM Symposium on Computational Geometry, May.
Preparata, F.P., Shamos, M.I. (1985): Computational Geometry. Springer-Verlag, New York
Su, P., Drysdale, R.L.S. (1995): A Comparison of Sequential Delaunay Triangulation Algorithms. Proceedings of the ACM Eleventh Annual Symposium on Computational Geometry, June, 61–70
Shewchuk, J.R. (1996): Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator. First ACM Workshop on Applied Computational Geometry, Philadelphia, Pennsylvania, May, 124–133
Sugihara, K., Iri, M., Inagaki, H., Imai, T. (2000): Topology-Oriented Implementation–An Approach to Robust Geometric Algorithms. Algorithmica 27 (1), 5–20
Schirra, S., Veltkamp, R., Yvinec, M. (1999): The CGAL Reference Manual. Release 2.0 (www.cgal.org)
Legrand, S., Legat, V., Dellersnijder, E. (2000): Delaunay Mesh Generation for an Unstructured-Grid Ocean General Circulation Model. Ocean Modelling 2, 17–28
Treinish, L. A. (1995): Visualization of Scattered Meteorological Data. IEEE Computer Graphics and Applications, 15(4), July, 20–26
Weller, F. (1998): On the Total Correctness of Lawson’s Oriented Walk Algorithm. The 10th International Canadian Conference on Computational Geometry, Montréal, Québec, Canada, August, 10–12
De Floriani, L., Puppo, E., Magillo, P. (1999): Applications of Computational Geometry to Geographic Information Systems, Chapter 7 in Handbook of Computational Geometry, J.R. Sack, J. Urrutia ( Eds ), Elsevier Science, 333–388
Lawson, C. L. (1977): Software for Cl Surface Interpolation. In J. R. Rice (ed), Mathematical Software III, Academic Press, New York, 161–194
Mitchell, J.S.B. (1997): Shortest Paths and Networks. Handbook of Discrete and Computational Geometry, Discrete Mathematics & its Applications, Jacob E. Goodman and Joseph O’Rourke, ed., CRC Press, 445–466
Kallmann, M., Thalmann, D. (2001): Star Vertices: A Compact Representation for Planar Meshes with Adjacency Information. Journal of Graphics Tools, 6 (1), 7–18
Mäntylä, M. (1988): An Introduction to Solid Modeling, Computer Science Press, Maryland
Bennett, K.P., Mangasarian, O.L. (1994): Multicategory discrimination via linear programming. Optimization Methods and Software, 3, 29–39
Nielson, G.M. (1997): Tools for Triangulations and Tetrahedrizations and Constructing Functions Defined over Them. In G.M. Nielson, H. Hagen, H. Mueller (Eds.): Scientific Visualization. IEEE Computer Society Press, 429–525
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kallmann, M., Bieri, H., Thalmann, D. (2004). Fully Dynamic Constrained Delaunay Triangulations. In: Brunnett, G., Hamann, B., Müller, H., Linsen, L. (eds) Geometric Modeling for Scientific Visualization. Mathematics and Visualization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-07443-5_15
Download citation
DOI: https://doi.org/10.1007/978-3-662-07443-5_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07263-5
Online ISBN: 978-3-662-07443-5
eBook Packages: Springer Book Archive