Advertisement

Fast algorithms for greedy triangulation

  • Christos Levcopoulos
  • Andrzej Lingas
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 447)

Abstract

We present the first quadratic-time algorithm for the greedy triangulation of a finite planar point set, and the first linear-time algorithm for the greedy triangulation of a convex polygon.

Keywords

Voronoi Diagram Delaunay Triangulation Convex Polygon Information Processing Letter Current Vertex 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [A]
    A. Aggarwal, Research topics in computational geometry, Bulletin of EATCS 39 (October 1989), pp. 388–408.Google Scholar
  2. [AGSS]
    A. Aggarwal, L. Guibas, J. Saxe, P. Shor, A Linear Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon, in Proc. of the 19th ACM Symposium on Theory of Computing, New York, pp. 39–45,1987.Google Scholar
  3. [C]
    L.P. Chew, Constrained Delaunay triangulations, in: Proc. of the 3rd ACM Symposium on Computational Geometry, Waterloo, pp. 215–222, 1987.Google Scholar
  4. [Gi]
    P.D. Gilbert, New Results in Planar Triangulations, M.S. Thesis, Coordinated Science Laboratory, University of Illinois, Urbana, Illinois, 1979.Google Scholar
  5. [E]
    H. Edelsbrunner, Algorithms in Combinatorial Geometry, Texts and Monographs in Computer Science, Springer Verlag, Berlin, 1987.Google Scholar
  6. [Go]
    S.A. Goldman, A Space Efficient Greedy Triangulation Algorithm, Information Processing Letters 31 (1989) pp. 191–196.CrossRefGoogle Scholar
  7. [Le]
    C. Levcopoulos, An Ω(√n) lower bound for non-optimality of the greedy triangulation, Information Processing Letters 25 (1987), pp. 247–251.MathSciNetGoogle Scholar
  8. [LL86]
    D.T. Lee and A. Lin, Generalized Delaunay Triangulation for Planar Graphs, Discrete and Computational Geometry 1(1986), Springer Verlag, pp. 201–217.Google Scholar
  9. [LL87]
    C. Levcopoulos, A. Lingas, On Approximation Behavior of the Greedy Triangulation for Convex Polygons, Algorithmica (1987) 2, pp. 175–193.CrossRefGoogle Scholar
  10. [LLS]
    C. Levcopoulos, A. Lingas and J. Sack, Heuristics for Optimum Binary Search Trees and Minimum Weight Triangulation Problems, Theoretical Computer Science 66 (1989), pp. 181–203.CrossRefGoogle Scholar
  11. [Li87]
    A. Lingas, A space efficient algorithm for the greedy triangulation, in: M. Thoma and A. Wyner, eds., Proc. 13th IFIP Conf. on System Modelling and Optimization, Tokyo (August 1987), Lecture Notes in Control and Information Sciences, Vol. 113 (Springer, Berlin, 1987), pp. 359–364.Google Scholar
  12. [Li88]
    A. Lingas, Greedy Triangulation Can be Efficiently Implemented in the Average Case, in: J. van Leeuwen, ed., Proc. International Workshop WG'88, Amsterdam (June 1988), Lecture Notes in Computer Science, Vol. 344 (Springer, Berlin, 1988), pp. 253–261.Google Scholar
  13. [Li89]
    A. Lingas, Voronoi Diagrams with Barriers and their Applications, Information Processing Letters 32(1989), pp. 191–198.Google Scholar
  14. [Ll]
    E.L. Lloyd, On Triangulations of a Set of Points in the Plane, Proc. of the 18th Annual IEEE Conference on the Foundations of Computer Science, Providence, 1977.Google Scholar
  15. [MZ]
    G. Manacher and A. Zorbrist, Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation, Information Processing Letters 9 (1979).Google Scholar
  16. [PS]
    F.P. Preparata and M.I. Shamos, Computational Geometry, An Introduction, Texts and Monographs in Computer Science, Springer Verlag, New York, 1985.Google Scholar
  17. [WS]
    C. Wang and L. Schubert, An optimal algorithm for constructing the Delaunay triangulation of a set of line segments, in: Proc of the 3rd ACM Symposium on Computational Geometry, Waterloo, pp. 223–232, 1987.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Christos Levcopoulos
    • 1
  • Andrzej Lingas
    • 1
  1. 1.Department of Computer ScienceLund UniversityLundSweden

Personalised recommendations