Pages that link to "Item:Q1601023"
From MaRDI portal
The following pages link to Fast algorithms for approximating distances (Q1601023):
Displaying 4 items.
- A fast robust algorithm for computing discrete Voronoi diagrams (Q846176) (← links)
- The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition (Q2441579) (← links)
- (Q4226562) (← links)
- An efficient algorithm for computing free distance (Corresp.) (Q5641068) (← links)