Abstract
A plane geometric graphC in ℝ2 conforms to another such graphG if each edge ofG is the union of some edges ofC. It is proved that, for everyG withn vertices andm edges, there is a completion of a Delaunay triangulation ofO(m>2 n) points that conforms toG. The algorithm that constructs the points is also described.
Article PDF
Similar content being viewed by others
References
[BDE] M. Bern, D. Dobkin, and D. Eppstein. Triangulating polygons without large angles. InProc. 8th Ann. Symp. on Computational Geometry, 1992, pp. 222–231.
[BE] M. Bern and D. Eppstein. Polynomial-size nonobtuse triangulation of polygons. InProc. 7th Ann. Symp. on Computational Geometry, 1991, pp. 342–350.
[BEG] M. Bern, D. Eppstein, and J. Gilbert. Provably good mesh generation. InProc. 31st Ann. IEEE Symp. on Foundations of Computer Science, 1990, pp. 231–241.
[BFL] J. D. Boissonnat, O. D. Faugeras, and E. Le Bras-Mehlman. Representing stereo data with the Delaunay triangulation. InProc. Internat. Conf. on Robotics and Automation, 1988, pp. 24–29.
[Bo] J. D. Boissonnat. Shape reconstruction from planar cross sections.Comput. Vision Graphics Image Process.44 (1988), 1–29.
[C] J. Cavendish. Automatic triangulation of arbitrary planar domains for the finite element method.Internat. J. Numer. Methods Engrg. 8 (1974), 679–696.
[CLR] T. H. Cormen, C. E. Leiserson, and R. L. Rivest,Introduction to Algorithms. MIT Press, Cambridge, MA, 1990.
[D'AS] E. F. D'Azevedo and R. B. Simpson. On optimal interpolation triangle incidences.SIAM J. Sci. Statist. Comput. 10 (1989), 1063–1075.
[De] B. Delaunay. Sur la sphère vide.Izv. Akad. Nauk SSSR, Otdel. Mat. Est. Nauk 7 (1934), 793–800.
[Ed] H. Edelsbrunner,Algorithms in Combinatorial Geometry. Springer-Verlag, Heidelberg, 1987.
[ElA] H. ElGindy and D. Avis. A linear algorithm for computing the visibility polygon from a point.J. Algorithms 2 (1981), 186–197.
[F] S. Fortune. A sweepline algorithm for Voronoi diagrams.Algorithmica 2 (1987), 153–174.
[GKS] L. J. Guibas, D. E. Knuth, and M. Sharir. Randomized incremental construction of Delaunay and Voronoi diagrams.Algorithmica 7 (1992), 381–413.
[GS] L. J. Guibas and J. Stolfi. Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams.ACM Trans. Graphics 4 (1985), 74–123.
[JS] B. Joe and R. B. Simpson. Corrections to Lee's visibility polygon algorithm.BIT 27 (1987), 458–473.
[La] C. L. Lawson. Software forC>1 surface interpolation. InMathematical Software III, J. R. Rice, ed. Academic Press, New York, 1977, pp. 161–194.
[Le] D. T. Lee, Visibility of a simple polygon.Comput. Vision Graphics Image Process.22 (1983), 207–221.
[LL] D. T. Lee and A. K. Lin. Generalized Delaunay triangulation for planar graphs.Discrete Comput. Geom. 1 (1986), 201–217.
[MS] E. A. Melissaratos and D. L. Souvaine. Coping with inconsistencies: a new approach to produce quality triangulations of polygonal domains with holes. InProc. 8th Ann. Symp. on Computational Geometry, 1992, pp. 202–211.
[NS] L. R. Nackman and V. Srinivasan. Point placement for Delaunay triangulation of polygonal domains. InProc. 3rd Canadian Conf. on Computational Geometry, 1991, pp. 37–40.
[O] A. A. Oloufa. Triangulation applications in volume calculation.J. Comput. Civil Engrg. 5 (1991), 103–119.
[PS] F. P. Preparata and M. I. Shamos,Computational Geometry—an Introduction. Springer-Verlag, New York, 1985.
[Ra] V. T. Rajan. Optimality of the Delaunay triangulation in ℝ2. InProc. 7th Ann. Symp. on Computational Geometry, 1991, pp. 357–363.
[Ri] S. Rippa. Minimal roughness property of the Delaunay triangulation.Comput. Aided Geom. Design 7 (1990), 489–497.
[Sa] A. Saalfeld. Delaunay edge refinements. InProc. 3rd Canadian Conf. on Computational Geometry, 1991, 33–36.
[SaP] N. Sapidis and R. Perucchio. Delaunay triangulation of arbitrarily shaped planar domains.Comput. Aided Geom. Design 8 (1991), 421–437.
[Se] R. Seidel. Constrained Delaunay triangulations and Voronoi diagrams with obstacles. In1978–1988, 10-Years IIG. Inst. Inform. Process., Techn. Univ. Graz, 1988, pp. 178–191.
[Si] R. Sibson. Locally equiangular triangulations.Comput. J. 21 (1978), 243–245.
[StF] G. Strang and G. Fix.An Analysis of the Finite Element Method. Prentice-Hall, Englewood Cliffs, NJ, 1973.
[V] G. Voronoi. Nouvelles applications des paramètres continus à la thèorie des dormes quadratiques. Deuxième Mémoire: Recherches sur les parallélloèdres primitifs.J. Reine Angew. Math. 134 (1908), 198–287.
Author information
Authors and Affiliations
Additional information
Research of the first author is supported by the National Science Foundation under Grant CCR-8921421 and under the Alan T. Waterman award, Grant CCR-9118874. Any opinions, findings, and conclusions or recommendations expressed in this publication are those of the authors and do not necessarily reflect the view of the National Science Foundation. Work of the second author was conducted while he was on study leave at the University of Illinois.
Rights and permissions
About this article
Cite this article
Edelsbrunner, H., Tan, T.S. An upper bound for conforming Delaunay triangulations. Discrete Comput Geom 10, 197–213 (1993). https://doi.org/10.1007/BF02573974
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02573974