A fast Las Vegas algorithm for triangulating a simple polygon (Q1823686)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A fast Las Vegas algorithm for triangulating a simple polygon |
scientific article; zbMATH DE number 4115966
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast Las Vegas algorithm for triangulating a simple polygon |
scientific article; zbMATH DE number 4115966 |
Statements
A fast Las Vegas algorithm for triangulating a simple polygon (English)
0 references
1989
0 references
The authors present in this revised and expanded version of a conference paper their randomized algorithm that triangulates a simple polygon of n vertices in 0(nlog*n) expected time.
0 references
computational geometry triangulation
0 references
divide and conquer
0 references
Las Vegas
0 references
algorithm
0 references
