COMPUTING CONSTRAINED SHORTEST SEGMENTS: BUTTERFLY WINGSPANS IN LOGARITHMIC TIME (Q4513231): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Computing shortest transversals / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fast detection of polyhedral intersection / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computing the extreme distances between two convex polygons / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: COMPACT INTERVAL TREES: A DATA STRUCTURE FOR CONVEX HULLS / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maintenance of configurations in the plane / rank | |||
Normal rank | |||
Revision as of 17:17, 30 May 2024
scientific article; zbMATH DE number 1526825
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | COMPUTING CONSTRAINED SHORTEST SEGMENTS: BUTTERFLY WINGSPANS IN LOGARITHMIC TIME |
scientific article; zbMATH DE number 1526825 |
Statements
COMPUTING CONSTRAINED SHORTEST SEGMENTS: BUTTERFLY WINGSPANS IN LOGARITHMIC TIME (English)
0 references
7 November 2000
0 references
binary search on convex polygons
0 references
shortest transversal
0 references
