Discrete & Computational Geometry

, Volume 10, Issue 1, pp 47–65

Edge insertion for optimal triangulations

  • M. Bern
  • H. Edelsbrunner
  • D. Eppstein
  • S. Mitchell
  • T. S. Tan
Article

Abstract

Edge insertion iteratively improves a triangulation of a finite point set in ℜ2 by adding a new edge, deleting old edges crossing the new edge, and retriangulating the polygonal regions on either side of the new edge. This paper presents an abstract view of the edge insertion paradigm, and then shows that it gives polynomial-time algorithms for several types of optimal triangulations, including minimizing the maximum slope of a piecewise-linear interpolating surface.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    R. E. Barnhill. Representation and approximation of surfaces. InMath. Software III, J. R. Rice, ed., Academic Press, New York, 1977, pp. 69–120.Google Scholar
  2. 2.
    M. W. Bern and D. Eppstein. Mesh generation and optimal triangulation. InComputing in Euclidean Geometry, D. Z. Du and F. K. Hwang, eds., World Scientific, Singapore, 1992, pp. 23–90.CrossRefGoogle Scholar
  3. 3.
    K. Q. Brown. Voronoi diagrams from convex hulls.Inform. Process. Lett. 9 (1979), 223–228.CrossRefGoogle Scholar
  4. 4.
    T. H. Cormen, C. E. Leiserson, and R. L. Rivest.Introduction to Algorithms. MIT Press, Cambridge, MA, 1990.Google Scholar
  5. 5.
    E. F. D'Azevedo and R. B. Simpson. On optimal interpolation triangle incidences.SIAM J. Sci. Statist. Comput. 10 (1989), 1063–1075.MathSciNetCrossRefGoogle Scholar
  6. 6.
    B. Delaunay. Sur la sphère vide.Izv. Akad. Nauk SSSR, Otdel. Mat. Estestv. Nauk 7 (1934), 793–800.Google Scholar
  7. 7.
    N. Dyn, D. Levin, and S. Rippa. Data dependent triangulations for piecewise linear interpolation.IMA J. Numer. Anal. 10 (1990), 137–154.MathSciNetCrossRefGoogle Scholar
  8. 8.
    H. Edelsbrunner.Algorithms in Combinatorial Geometry. Springer-Verlag, Heidelberg, 1987.CrossRefGoogle Scholar
  9. 9.
    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.CrossRefGoogle Scholar
  10. 10.
    H. Edelsbrunner, T. S. Tan, and R. Waupotitsch. AnO(n 2 logn) time algorithm for the minmax angle triangulation.SIAM J. Statist. Sci. Comput. 13 (1992), 994–1008.MathSciNetCrossRefGoogle Scholar
  11. 11.
    H. Edelsbrunner and R. Waupotitsch. Optimal two-dimensional triangulations. InAnimation of Geometric Algorithms: A Video Review, M. Brown and J. Hershberger, eds. (Technical Report 87a), Systems Research Center, DEC, Palo Alto, CA, 1992, pp. 7–8.Google Scholar
  12. 12.
    S. Fortune. A sweepline algorithm for Voronoi diagrams.Algorithmica 2 (1987), 153–174.MathSciNetCrossRefGoogle Scholar
  13. 13.
    J. A. George. Computer implementation of the finite element method. Ph.D. Thesis, Technical Report STAN-CS-71-208, Computer Science Dept., Stanford University, 1971.Google Scholar
  14. 14.
    L. J. Guibas, D. E. Knuth, and M. Sharir. Randomized incremental construction of Delaunay and Voronoi diagrams.Algorithmica 7 (1992), 381–413.MathSciNetCrossRefGoogle Scholar
  15. 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.CrossRefGoogle Scholar
  16. 16.
    G. T. Klincsek. Minimal triangulations of polygonal domains.Ann. Discrete Math. 9 (1980), 121–123.MathSciNetCrossRefGoogle Scholar
  17. 17.
    C. L. Lawson. Generation of a triangular grid with applications to contour plotting. Technical Memo 299, Jet Propulsion Laboratory, California Institute of Technology, Pasadana, CA, 1972.Google Scholar
  18. 18.
    C. L. Lawson. Software forC 1 surface interpolation. InMath. Software III, J. R. Rice, ed., Academic Press, New York, 1977, pp. 161–194.Google Scholar
  19. 19.
    D. A. Lindholm. Automatic triangular mesh generation on surfaces of polyhedra.IEEE Trans. Magnetics 19 (1983), 2539–2542.CrossRefGoogle Scholar
  20. 20.
    E. L. Lloyd. On triangulations of a set of points in the plane. InProc. 18th Annual IEEE Symposium on the Foundations of Computer Science, 1977, pp. 228–240.Google Scholar
  21. 21.
    F. P. Preparata and M. I. Shamos.Computational Geometry—an Introduction. Springer-Verlag, New York, 1985.Google Scholar
  22. 22.
    V. T. Rajan. Optimality of the Delaunay triangulation in ℜd. InProc. 7th Annual Symposium on Computational Geometry, 1991, pp. 357–363.Google Scholar
  23. 23.
    S. Rippa. Minimal roughness property of the Delaunay triangulation.Comput. Aided Geom. Design 7 (1990), 489–497.MathSciNetCrossRefGoogle Scholar
  24. 24.
    L. L. Schumaker. Triangulation methods. InTopics in Multivariate Approximation, C. K. Chui, L. L. Schumaker, and F. L. Utreras, eds., Academic Press, New York, 1987, pp. 219–232.Google Scholar
  25. 25.
    M. I. Shamos and D. Hoey. Closest point problems. InProc. 16th Annual IEEE Symposium on the Foundations of Computer Science, 1975, pp. 151–162.Google Scholar
  26. 26.
    R. Sibson. Locally equiangular triangulations.Comput. J. 21 (1978), 243–245.MathSciNetCrossRefGoogle Scholar
  27. 27.
    G. Strang and G. Fix.An Analysis of the Finite Element Method. Prentice-Hall, Englewood Cliffs, NJ, 1973.Google Scholar
  28. 28.
    D. F. Watson and G. M. Philip. Systematic triangulations.Comput. Vision Graphics Image Process.26 (1984), 217–223.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag New York Inc. 1993

Authors and Affiliations

  • M. Bern
    • 1
  • H. Edelsbrunner
    • 2
  • D. Eppstein
    • 3
  • S. Mitchell
    • 4
  • T. S. Tan
    • 5
  1. 1.Xerox Palo Alto Research CenterPalo AltoUSA
  2. 2.Department of Computer ScienceUniversity of IllinoisUrbanaUSA
  3. 3.Department of Information and Computer ScienceUniversity of CaliforniaIrvineUSA
  4. 4.Center for Applied MathematicsCornell UniversityIthacaUSA
  5. 5.Department of Information Systems and Computer ScienceNational University of SingaporeRepublic of Singapore

Personalised recommendations