Pages that link to "Item:Q4682169"
From MaRDI portal
The following pages link to ON ENUMERATING AND SELECTING DISTANCES (Q4682169):
Displaying 5 items.
- A linear time algorithm for max-min length triangulation of a convex polygon (Q845931) (← links)
- The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition (Q2441579) (← links)
- Proximity problems on line segments spanned by points (Q2489537) (← links)
- On approximate range counting and depth (Q5902137) (← links)
- On reverse shortest paths in geometric proximity graphs (Q6092309) (← links)
