Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings (Q5390616)
From MaRDI portal
scientific article; zbMATH DE number 5874054
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings |
scientific article; zbMATH DE number 5874054 |
Statements
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings (English)
0 references
4 April 2011
0 references
geometric graphs
0 references
Voronoi diagrams
0 references
epsilon-cuttings
0 references
trapezoidal maps
0 references
arrangements
0 references
shortest paths
0 references
