Skip to main content
SpringerLink
Log in

Edge insertion for optimal triangulations

  • Conference paper
  • First Online:
LATIN '92 (LATIN 1992)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 583))

Included in the following conference series:

Abstract

The edge-insertion paradigm improves a triangulation of a finite point set in ℜ2 iteratively by adding a new edge, deleting intersecting old edges, and retriangulating the resulting two polygonal regions. After presenting an abstract view of the paradigm, this paper shows that it can be used to obtain polynomial time algorithms for several types of optimal triangulations.

Research of the second author is supported by the National Science Foundation under grant no. CCR-8921421 and under the Alan T. Waterman award, grant no. CCR-9118874. Any opinions, finding 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. Part of the work was done while the second, third, and fourth authors visited the Xerox Palo Alto Research Center. The fifth author is on study leave from the National University of Singapore, Republic of Singapore.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. E. Barnhill. Representation and approximation of surfaces. Math. Software III, J. R. Rice, ed., Academic Press, 1977, 69–120.

    Google Scholar 

  2. K. Q. Brown. Voronoi diagrams from convex hulls. Inform. Process. Lett. 9 (1979); 223–228.

    Google Scholar 

  3. T. H. Cormen, C. E. Leiserson and R. L. Rivest. Introduction to Algorithms. The MIT Press, Cambridge, Mass., 1990.

    Google Scholar 

  4. E. F. D'Azevedo and R. B. Simpson. On optimal interpolation triangle incidences. SIAM J. Sci. Stat. Comput. 10 (1989), 1063–1075.

    Google Scholar 

  5. B. Delaunay. Sur la sphère vide. Izv. Akad. Nauk SSSR, Otdelenie Matematicheskii i Estestvennyka Nauk 7 (1934), 793–800.

    Google Scholar 

  6. N. Dyn, D. Levin and S. Rippa. Data dependent triangulations for piecewise linear interpolation. IMA J. Numer. Anal. 10 (1990), 137–154.

    Google Scholar 

  7. H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, Heidelberg, Germany, 1987.

    Google Scholar 

  8. H. Edelsbrunner and E. P. Mücke. Simulation of Simplicity: a technique to cope with degenerate cases in geometric algorithms. ACM Trans. Graphics 9 (1990), 66–104.

    Google Scholar 

  9. H. Edelsbrunner and T. S. Tan. A quadratic time algorithm for the minmax length triangulation. In “Proc. 32nd IEEE Sympos. Found. Comput. Sci. 1991”, 414–423.

    Google Scholar 

  10. H. Edelsbrunner, T. S. Tan and R. Waupotitsch. An O(n 2 log n) time algorithm for the minmax angle triangulation. To appear in SIAM J. Stat. Sci. Comput. (1990).

    Google Scholar 

  11. S. Fortune. A sweepline algorithm for Voronoi diagrams. Algorithmica 2 (1987), 153–174.

    Google Scholar 

  12. J. A. George. Computer implementation of the finite element method. Techn. Rep. STAN-GS-71-208, Ph.D. Thesis, Comput. Sci. Dept., Stanford Univ., 1971.

    Google Scholar 

  13. C. M. Gold, T. D. Charters and J. Ramsden. Automated contour mapping using triangular element data structures and an interpolant over each irregular triangular domain. In “Proc. SIGGRAPH, 1977” 11 (1977), 170–175.

    Google Scholar 

  14. L. J. Guibas, D. E. Knuth and M. Sharir. Randomized incremental construction of Delaunay and Voronoi diagrams. In “Proc. Internat. Colloq. Automata, Lang., Progr. 1990”, 414–431.

    Google Scholar 

  15. 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.

    Google Scholar 

  16. G. T. Klincsek. Minimal triangulations of polygonal domains. Annals Discrete Math. 9 (1980), 121–123.

    Google Scholar 

  17. C. L. Lawson. Generation of a triangular grid with applications to contour plotting. Jet Propul. Lab. Techn. Memo. 299, 1972.

    Google Scholar 

  18. C. L. Lawson. Software for C 1 surface interpolation. In Math. Software III, J. R. Rice, ed., Academic Press, 1977, 161–194.

    Google Scholar 

  19. D. A. Lindholm. Automatic triangular mesh generation on surfaces of polyhedra. IEEE Trans. Magnetics MAG-19 (1983), 2539–2542.

    Google Scholar 

  20. E. L. Lloyd. On triangulations of a set of points in the plane. In “Proc. 18th Ann. IEEE Sympos. Found. Comput. Sci., 1977”, 228–240.

    Google Scholar 

  21. F. P. Preparata and M. I. Shamos. Computational Geometry—an Introduction. Springer-Verlag, New York, 1985.

    Google Scholar 

  22. V. T. Rajan. Optimality of the Delaunay triangulation in ℜd. In “Proc. 7th Ann. Sympos. Comput. Geom., 1991”, 357–363.

    Google Scholar 

  23. S. Rippa. Minimal roughness property of the Delaunay triangulation. Computer Aided Geometric Design 7 (1990), 489–497.

    Google Scholar 

  24. L. L. Schumaker. Triangulation methods. Topics in Multivariate Approximation, C. K. Chui, L. L. Schumaker and F. I. Utreras, eds., Academic Press, 1987, 219–232.

    Google Scholar 

  25. M. I. Shamos and D. Hoey. Closest point problems. In “Proc. 16th Ann. IEEE Sympos. Found. Comput. Sci., 1975”, 151–162.

    Google Scholar 

  26. R. Sibson. Locally equiangular triangulations. Comput. J. 21 (1978), 243–245.

    Google Scholar 

  27. G. Strang and G. Fix. An Analysis of the Finite Element Method. Prentice-Hall, Englewood Cliffs, NJ, 1973.

    Google Scholar 

  28. D. F. Watson and G. M. Philip. Systematic triangulations. Comput. Vision, Graphics, Image Process. 26 (1984), 217–223.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Xerox Palo Alto Research Center, 3333 Coyote Hill Road, 94304, Palo Alto, CA, USA

    M. Bern

  2. Department of Computer Science, University of Illinois, 61801, Urbana, Illinois, USA

    H. Edelsbrunner & T. S. Tan

  3. Department of Information and Computer Science, University of California, 92717, Irvine, CA, USA

    D. Eppstein

  4. Center for Applied Mathematics, Cornell University, 14853, Ithaca, NY, USA

    S. Mitchell

Authors
  1. M. Bern
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. H. Edelsbrunner
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. D. Eppstein
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. S. Mitchell
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. T. S. Tan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Imre Simon

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bern, M., Edelsbrunner, H., Eppstein, D., Mitchell, S., Tan, T.S. (1992). Edge insertion for optimal triangulations. In: Simon, I. (eds) LATIN '92. LATIN 1992. Lecture Notes in Computer Science, vol 583. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023816

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55284-0

  • Online ISBN: 978-3-540-47012-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation