Discrete & Computational Geometry

, Volume 4, Issue 5, pp 423–432

A fast las vegas algorithm for triangulating a simple polygon

  • Kenneth L. Clarkson
  • Robert E. Tarjan
  • Christopher J. Van Wyk
Article

DOI: 10.1007/BF02187741

Cite this article as:
Clarkson, K.L., Tarjan, R.E. & Van Wyk, C.J. Discrete Comput Geom (1989) 4: 423. doi:10.1007/BF02187741

Abstract

We present a randomized algorithm that triangulates a simple polygon onn vertices inO(n log*n) expected time. The averaging in the analysis of running time is over the possible choices made by the algorithm; the bound holds for any input polygon.

Copyright information

© Springer-Verlag New York Inc. 1989

Authors and Affiliations

  • Kenneth L. Clarkson
    • 1
  • Robert E. Tarjan
    • 1
    • 2
  • Christopher J. Van Wyk
    • 1
  1. 1.AT&T Bell LaboratoriesMurray HillUSA
  2. 2.Department of Computer SciencePrinceton UniversityPrincetonUSA

Personalised recommendations