An O(n log n) Manhattan path algorithm (Q795510): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the complexity of computing the measure of ∪[a <sub>i</sub> ,b <sub>i</sub> ] / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3885184 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding a manhattan path and related problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Rectilinear line segment intersection, layered segment trees, and dynamization / rank | |||
Normal rank | |||
Latest revision as of 12:16, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An O(n log n) Manhattan path algorithm |
scientific article |
Statements
An O(n log n) Manhattan path algorithm (English)
0 references
1984
0 references
computational geometry
0 references
shortest paths
0 references
segments on the plane
0 references
Manhattan path
0 references
