The following pages link to Efficient partition trees (Q1199132):
Displaying 50 items.
- Tighter estimates for \(\epsilon\)-nets for disks (Q265723) (← links)
- Efficient algorithms for counting and reporting pairwise intersections between convex polygons (Q294592) (← links)
- Optimal partition trees (Q420575) (← links)
- A faster algorithm for computing motorcycle graphs (Q471142) (← links)
- Relative convex hulls in semi-dynamic arrangements (Q476434) (← links)
- \(\varepsilon\)-Mnets: Hitting geometric set systems with subsets (Q527442) (← links)
- Range minima queries with respect to a random permutation, and approximate range counting (Q629829) (← links)
- Relative \((p,\varepsilon )\)-approximations in geometry (Q633202) (← links)
- On bounded leg shortest paths problems (Q633848) (← links)
- On counting pairs of intersecting segments and off-line triangle range searching (Q676268) (← links)
- Range searching with efficient hierarchical cuttings (Q685179) (← links)
- On ray shooting in convex polytopes (Q685183) (← links)
- Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique (Q714991) (← links)
- Computing minimum-area rectilinear convex hull and \(L\)-shape (Q833717) (← links)
- Covering many or few points with unit disks (Q839638) (← links)
- Topology and combinatorics of partitions of masses by hyperplanes (Q855777) (← links)
- Semi-algebraic Ramsey numbers (Q896011) (← links)
- Tight bounds for connecting sites across barriers (Q958235) (← links)
- Geometric pattern matching for point sets in the plane under similarity transformations (Q989531) (← links)
- Efficient \(c\)-oriented range searching with DOP-trees (Q1000927) (← links)
- A practical approximation algorithm for the LMS line estimator (Q1019876) (← links)
- Dynamic ham-sandwich cuts in the plane (Q1025301) (← links)
- A (slightly) faster algorithm for Klee's measure problem (Q1037647) (← links)
- Finding the \(\Theta \)-guarded region (Q1037785) (← links)
- Convex subdivisions with low stabbing numbers (Q1046805) (← links)
- Fast algorithms for collision and proximity problems involving moving geometric objects (Q1126250) (← links)
- Quasi-optimal upper bounds for simplex range searching and new zone theorems (Q1201746) (← links)
- On range searching with semialgebraic sets (Q1329188) (← links)
- Crossing families (Q1330788) (← links)
- On joints in arrangements of lines in space and related problems (Q1331145) (← links)
- Derandomizing an output-sensitive convex hull algorithm in three dimensions (Q1346251) (← 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)
- Improved upper bounds for approximation by zonotopes (Q1373005) (← links)
- Indexing moving points (Q1394801) (← links)
- Efficient searching with linear constraints (Q1591152) (← links)
- A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs (Q1733046) (← links)
- Dynamic half-space range reporting and its applications (Q1891228) (← links)
- Almost optimal set covers in finite VC-dimension (Q1906049) (← links)
- Equipartition of mass distributions by hyperplanes (Q1911766) (← links)
- Algorithms for generalized halfspace range searching and other intersection searching problems (Q1917041) (← links)
- A deterministic algorithm for the three-dimensional diameter problem (Q1917056) (← links)
- On separating points by lines (Q1985301) (← links)
- On grids in point-line arrangements in the plane (Q2022623) (← links)
- Testing polynomials for vanishing on Cartesian products of planar point sets: collinearity testing and related problems (Q2105319) (← links)
- Dynamic geometric data structures via shallow cuttings (Q2223621) (← links)
- Near-linear algorithms for geometric hitting sets and set covers (Q2291457) (← links)
- Multilevel polynomial partitions and simplified range searching (Q2354673) (← links)
- Subquadratic algorithms for succinct stable matching (Q2415371) (← links)
- Farthest-point queries with geometric and combinatorial constraints (Q2489542) (← links)
