Pages that link to "Item:Q685179"
From MaRDI portal
The following pages link to Range searching with efficient hierarchical cuttings (Q685179):
Displaying 50 items.
- Tight lower bounds for halfspace range searching (Q420572) (← links)
- Optimal partition trees (Q420575) (← links)
- Range minima queries with respect to a random permutation, and approximate range counting (Q629829) (← links)
- A greedy clustering algorithm based on interval pattern concepts and the problem of optimal box positioning (Q670431) (← links)
- Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points (Q680145) (← links)
- New variants of perfect non-crossing matchings (Q831710) (← links)
- Computing minimum-area rectilinear convex hull and \(L\)-shape (Q833717) (← links)
- Topology and combinatorics of partitions of masses by hyperplanes (Q855777) (← links)
- Constructing minimum-interference networks (Q929744) (← links)
- Enclosing weighted points with an almost-unit ball (Q990963) (← links)
- A general approach for cache-oblivious range reporting and approximate range counting (Q991183) (← links)
- The effect of corners on the complexity of approximate range searching (Q1014333) (← links)
- A (slightly) faster algorithm for Klee's measure problem (Q1037647) (← links)
- Fast algorithms for collision and proximity problems involving moving geometric objects (Q1126250) (← links)
- Applications of a new space-partitioning technique (Q1196362) (← links)
- Cutting hyperplanes for divide-and-conquer (Q1209837) (← links)
- Orthogonal queries in segments (Q1355726) (← links)
- 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects (Q1370928) (← links)
- On fat partitioning, fat covering and the union size of polygons (Q1384209) (← links)
- Approximate range searching (Q1595401) (← links)
- Semi-group range sum revisited: query-space lower bound tightened (Q1751095) (← links)
- Ray shooting and stone throwing with near-linear storage (Q1776898) (← links)
- New lower bounds for Hopcroft's problem (Q1816464) (← links)
- Reporting intersecting pairs of convex polytopes in two and three dimensions (Q1862123) (← links)
- On counting point-hyperplane incidences (Q1873152) (← links)
- An efficient \(k\) nearest neighbors searching algorithm for a query line. (Q1874395) (← links)
- Triangular range counting query in 2D and its application in finding \(k\) nearest neighbors of a line segment (Q1886235) (← links)
- Almost optimal set covers in finite VC-dimension (Q1906049) (← links)
- Vertical decompositions for triangles in 3-space (Q1907609) (← links)
- Equipartition of mass distributions by hyperplanes (Q1911766) (← links)
- Computing depth orders for fat objects and related problems (Q1917032) (← links)
- Algorithms for generalized halfspace range searching and other intersection searching problems (Q1917041) (← links)
- The exact fitting problem in higher dimensions (Q1917054) (← links)
- Connected component and simple polygon intersection searching (Q1918994) (← links)
- Characterization and computation of feasible trajectories for an articulated probe with a variable-length end segment (Q1984612) (← links)
- Testing polynomials for vanishing on Cartesian products of planar point sets: collinearity testing and related problems (Q2105319) (← links)
- Tree drawings revisited (Q2189731) (← links)
- Trajectory planning for an articulated probe (Q2206741) (← links)
- Removing depth-order cycles among triangles: an algorithm generating triangular fragments (Q2225657) (← links)
- Linear-space data structures for range mode query in arrays (Q2254510) (← links)
- Approximate range searching: The absolute model (Q2269144) (← links)
- Lower bounds for off-line range searching (Q2365324) (← links)
- Subquadratic algorithms for algebraic 3SUM (Q2415376) (← links)
- A tight lower bound for computing the diameter of a 3D convex polytope (Q2461545) (← links)
- Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D (Q2482197) (← links)
- Extremal point queries with lines and line segments and related problems (Q2571215) (← links)
- Succinct and Implicit Data Structures for Computational Geometry (Q2848977) (← links)
- IMPROVED POINTER MACHINE AND I/O LOWER BOUNDS FOR SIMPLEX RANGE REPORTING AND RELATED PROBLEMS (Q2875643) (← links)
- Improved Points Approximation Algorithms Based on Simplicial Thickness Data Structures (Q3000523) (← links)
- Simplex Range Searching and Its Variants: A Review (Q4604367) (← links)
