Reprint of: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons (Q982944): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Triangulation and shape-complexity / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: ERRATUM: "RANDOMIZED PARALLEL ALGORITHMS FOR TRAPEZOIDAL DIAGRAMS" / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A fast Las Vegas algorithm for triangulating a simple polygon / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Triangulating Simple Polygons and Equivalent Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Triangulating a simple polygon / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3670558 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sorting jordan sequences in linear time using level-linked search trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon / rank | |||
Normal rank | |||
Latest revision as of 01:54, 3 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reprint of: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons |
scientific article |
Statements
Reprint of: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons (English)
0 references
28 July 2010
0 references
