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 13 items.
- Efficient algorithms for the one-dimensional \(k\)-center problem (Q500977) (← links)
- 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)
- Computing common tangents without a separating line (Q5057432) (← links)
- Cartographic line simplication and polygon CSG formulae in O(n log* n) time (Q5096928) (← links)
- On Top-k Weighted<scp>Sum</scp>Aggregate Nearest and Farthest Neighbors in the L1 Plane (Q5241377) (← links)
- Minimization and maximization versions of the quadratic travelling salesman problem (Q5277951) (← links)
- Dynamic convex hulls under window-sliding updates (Q6139052) (← links)