A fast Las Vegas algorithm for triangulating a simple polygon
From MaRDI portal
Publication:1823686
DOI10.1007/BF02187741zbMath0681.68061MaRDI QIDQ1823686
Kenneth L. Clarkson, Robert Endre Tarjan, Christopher J. Van Wyk
Publication date: 1989
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131090
68Q25: Analysis of algorithms and problem complexity
Related Items
Triangulating a simple polygon in linear time, An introduction to randomized algorithms, Polygon triangulation in \(O(n\log{}\log{}n)\) time with simple data structures