Pages that link to "Item:Q3212329"
From MaRDI portal
The following pages link to COMPACT INTERVAL TREES: A DATA STRUCTURE FOR CONVEX HULLS (Q3212329):
Displayed 7 items.
- Improved bounds for wireless localization (Q970612) (← links)
- Applications of a semi-dynamic convex hull algorithm (Q1196456) (← links)
- Cartographic line simplification and polygon CSG formulae in \(O(n\log^* n)\) time (Q1276944) (← links)
- Ray shooting in polygons using geodesic triangulations (Q1330785) (← links)
- Approximating points by a piecewise linear function (Q2375945) (← links)
- COMPUTING CONSTRAINED SHORTEST SEGMENTS: BUTTERFLY WINGSPANS IN LOGARITHMIC TIME (Q4513231) (← links)
- An O(n <font>log</font> n) ALGORITHM FOR FINDING A SHORTEST CENTRAL LINK SEGMENT (Q4682194) (← links)