Pages that link to "Item:Q1891228"
From MaRDI portal
The following pages link to Dynamic half-space range reporting and its applications (Q1891228):
Displaying 23 items.
- The projection median of a set of points in \({\mathbb{R}}^{d}\) (Q664356) (← links)
- Bounded-degree polyhedronization of point sets (Q691768) (← links)
- Minimum cuts in geometric intersection graphs (Q827339) (← links)
- Dynamic coresets (Q834605) (← links)
- Iterated snap rounding with bounded drift (Q929748) (← links)
- Dynamic ham-sandwich cuts in the plane (Q1025301) (← links)
- Reporting points in halfspaces (Q1196295) (← links)
- Efficient partition trees (Q1199132) (← links)
- Facility location and the geometric minimum-diameter spanning tree. (Q1421033) (← links)
- Output-sensitive results on convex hulls, extreme points, and related problems (Q1816463) (← links)
- Triangular range counting query in 2D and its application in finding \(k\) nearest neighbors of a line segment (Q1886235) (← links)
- On geometric optimization with few violated constraints (Q1906043) (← links)
- Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications (Q2207601) (← links)
- Dynamic geometric data structures via shallow cuttings (Q2223621) (← links)
- Two approaches to building time-windowed geometric data structures (Q2319633) (← links)
- The \(k\)-nearest-neighbor Voronoi diagram revisited (Q2346966) (← links)
- On polyhedra induced by point sets in space (Q2462350) (← links)
- Polygonal path simplification with angle constraints (Q2571211) (← links)
- REVERSE NEAREST NEIGHBOR QUERIES IN FIXED DIMENSION (Q2999092) (← links)
- (Q5088951) (← links)
- (Q5088955) (← links)
- (Q5115770) (← links)
- Dynamic data structures for \(k\)-nearest neighbor queries (Q6101840) (← links)
