The greedy and Delauney triangulations are not bad in the average case and minimum weight geometric triangulation of multi-connected polygons is NP-complete

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


Convex Hull Voronoi Diagram Minimum Weight Boundary Edge Voronoi Polygon 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AV78]
    Angluin, D., and L.G. Valiant, Fast probabilistic algorithms for Hamiltonian circuits and matchings, Proc. 9th Ann. ACM Symp. on Theory of Computing, New York, 1978.Google Scholar
  2. [DG70]
    Duppe, R.D. and Gottschalk, H.H., Automatische Interpolation von Isolinen bei willkurlich stutzpunkten, Allgemeine Vermessungsnachrichten, 77, 1970.Google Scholar
  3. [GJ78]
    Garey, M.R., and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, H. Freeman, San Francisco.Google Scholar
  4. [Ki80]
    Kirkpatrick,D.G., A Note on Delauney and Optimal Triangulations, Information Processing Letters, Vol. 10, No.3, 1980.Google Scholar
  5. [Lic82]
    Lichtenstein, D., Planar Formulae and their Uses, SIAM Journal on Computing, Vol. 11, No. 2, 1982.Google Scholar
  6. [Lin82]
    Lingas,A., The Power of Non-rectilinear Holes, Proceedings of 9th ICALP, Aarhus, July 1982.Google Scholar
  7. [Lin83]
    Lingas, A., Advances in Minimum Weight Triangulation, Ph.D. dissertation, Linköping University, 1983.Google Scholar
  8. [Ll77]
    Lloyd, E.L., On Triangulations of a Set of Points in the Plane, Proc. 18th Annual IEEE Conference on the Foundations of Computer Science, Providence, 1977.Google Scholar
  9. [MZ79]
    Manacher,G.K. and A.L. Zorbrist, Neither the Greedy nor the Delauney triangulation of a planar point set approximates the optimal triangulation, Information Processing Letters, Vol.9, No.1, 1979.Google Scholar
  10. [OS82]
    O'Rourke J. and K. Supowit, Some NP-hard polygon decomposition problems, to appear.Google Scholar
  11. [SH75]
    Shamos,M.I. and Hoey, D., Closest Point Problems, Proceedings of the 16th Annual Symposium on the Foundations of Computer Science, IEEE, 1975.Google Scholar
  12. [Sha75]
    Shamos, M.I., Geometric Complexity, Proceedings of 7th ACM Symposium on the theory of Computing, 1975.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • Andrzej Lingas
    • 1
  1. 1.Software Systems Research CenterLinköping UniversityLinköpingSweden

Personalised recommendations