A Fast Las Vegas Algorithm for Triangulating a Simple Polygon

Download PDF
Open Webpage

Kenneth L. Clarkson, Robert Endre Tarjan, Christopher J. Van Wyk

Published: 01 Jan 1989, Last Modified: 12 May 2025Discret. Comput. Geom. 1989EveryoneRevisionsBibTeXCC BY-SA 4.0
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.