Skip to main content
SpringerLink
Log in

Algorithm for constrained delaunay triangulation

  • Published:
The Visual Computer Aims and scope Submit manuscript

Abstract

A direct algorithm for computing constrained Delaunay triangulation in 2-D is presented. The algorithm inserts points along the constrained edges (break lines) to maintain the Delaunay criterion. Since many different insertions are possible, the algorithm computes only those that are on the Delaunay circles of each intersected triangle. A shelling procedure is applied to put triangles together in such a way that completeness and correctness are guaranteed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Boissonnat JD (1988) Shape reconstruction from planar cross sections. Comput Vis Graph Image Process 44:1–29

    Google Scholar 

  • Chew LP (1987) Constrained Delaunay triangulations. Proc 3rd symp comput geom 215–222

  • Cline AK, Renka RJ (1990) A constrained two-dimensional triangulation and the solution of closest node problems in the presence of barriers. SIAM J Num Anal 27:1305–1321

    Article  Google Scholar 

  • Delaunay B (1932) Neue Darstellung der geometrischen Krystallographie. Z Krystallogr 84:109–149

    Google Scholar 

  • Edelsbrunner H (1987) Algorithms in combinatorial geometry. Springer, New York

    Google Scholar 

  • Fang T-P, Piegl LA (1993) Delaunay triangulation using a uniform grid. IEEE Comput Graph Applic 13(3):36–47

    Article  Google Scholar 

  • De Floriani L, Falcidieno B, Pienovi C (1985) Delaunay based representation of surfaces defined over arbitrarily shaped domains. Comput Vis Graph Image Process 32:127–140

    Google Scholar 

  • Lee DT (1978) Proximity and reachability in the plane, PhD Thesis, University of Illinois

  • Lee DT, Lin AK (1986) Generalized Delaunay triangulation for planar graphs. Discr Comput Geom 1:201–217

    Google Scholar 

  • Preparata FP, Shamos MI (1985) Computational geometry —an introduction. Springer, New York Berlin Heidelberg

    Google Scholar 

  • Voronoi G (1907) Nouvelles applications des paramètres continus à la théorie des formes quadratiques. Premier Mémoire: Sur quelques proprieteés des formes quadratiques positives parfaites. J Reine Angew Mathemat 133:97–178

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science & Engineering, University of South Florida, 4202 Fowler Avenue, ENG 118, 33620, Tampa, FL, USA

    Tsung-Pao Fang & Les A. Piegl

Authors
  1. Tsung-Pao Fang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Les A. Piegl
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Les A. Piegl.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fang, TP., Piegl, L.A. Algorithm for constrained delaunay triangulation. The Visual Computer 10, 255–265 (1994). https://doi.org/10.1007/BF01901582

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01901582

Key words

Search

Navigation