A fast planar partition algorithm. I (Q2638830): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Algorithms for Reporting and Counting Geometric Intersections / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Reporting and counting segment intersections / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Constructing Arrangements of Lines and Hyperplanes with Applications / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4775467 / rank | |||
Normal rank | |||
Latest revision as of 12:46, 21 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast planar partition algorithm. I |
scientific article |
Statements
A fast planar partition algorithm. I (English)
0 references
1990
0 references
randomized algorithm
0 references
planar partition problem
0 references
computer graphics
0 references
