Pages that link to "Item:Q1097038"
From MaRDI portal
The following pages link to Halfplanar range search in linear space and \(O(n^{0.695})\) query time (Q1097038):
Displaying 35 items.
- Tight lower bounds for halfspace range searching (Q420572) (← links)
- Optimal partition trees (Q420575) (← links)
- Linear space data structures for two types of range search (Q578916) (← links)
- The complexity and construction of many faces in arrangements of lines and of segments (Q582900) (← links)
- On counting pairs of intersecting segments and off-line triangle range searching (Q676268) (← links)
- How hard is half-space range searching? (Q685178) (← links)
- The intersection searching problem for c-oriented polygons (Q751326) (← links)
- Dynamic partition trees (Q804289) (← links)
- Storing line segments in partition trees (Q911289) (← links)
- Optimal solutions for a class of point retrieval problems (Q1062772) (← links)
- The power of geometric duality revisited (Q1068550) (← links)
- The power of geometric duality (Q1082821) (← links)
- \(\epsilon\)-nets and simplex range queries (Q1089803) (← links)
- Fractional cascading. II: Applications (Q1099958) (← links)
- Lower bounds for the addition-subtraction operations in orthogonal range queries and related problems (Q1124391) (← links)
- Intersection queries in sets of disks (Q1196457) (← links)
- Efficient partition trees (Q1199132) (← links)
- Quasi-optimal upper bounds for simplex range searching and new zone theorems (Q1201746) (← links)
- Implicitly representing arrangements of lines or segments (Q1263966) (← links)
- Reporting and counting segment intersections (Q1821557) (← links)
- Quasi-optimal range searching in spaces of finite VC-dimension (Q1823698) (← links)
- Triangular range counting query in 2D and its application in finding \(k\) nearest neighbors of a line segment (Q1886235) (← links)
- Simplex range reporting on a pointer machine (Q1917035) (← links)
- Algorithms for projecting points to give the most uniform distribution with applications to hashing (Q2366237) (← links)
- A Real Elementary Approach to the Master Recurrence and Generalizations (Q3010381) (← links)
- Spanning trees with low crossing number (Q3358265) (← links)
- Lower Bounds on the Complexity of Polytope Range Searching (Q3471697) (← links)
- Simplex Range Searching and Its Variants: A Review (Q4604367) (← links)
- (Q5009629) (← links)
- Intersection queries in sets of disks (Q5056120) (← links)
- Dynamic partition trees (Q5056121) (← links)
- Lower bounds on the complexity of simplex range reporting on a pointer machine (Q5204338) (← links)
- TWO-DIMENSIONAL RANGE SEARCH BASED ON THE VORONOI DIAGRAM (Q5311631) (← links)
- Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses (Q5943320) (← links)
- Half-plane point retrieval queries with independent and dependent geometric uncertainties (Q6110075) (← links)
