The following pages link to (Q4225298):
Displaying 50 items.
- Efficient algorithms for counting and reporting pairwise intersections between convex polygons (Q294592) (← links)
- Labeling a rectilinear map more efficiently (Q294599) (← links)
- Entropy-bounded representation of point grids (Q390358) (← links)
- Tight lower bounds for halfspace range searching (Q420572) (← links)
- Optimal partition trees (Q420575) (← links)
- A faster algorithm for computing motorcycle graphs (Q471142) (← links)
- Improved data structures for the orthogonal range successor problem (Q617543) (← links)
- On bounded leg shortest paths problems (Q633848) (← links)
- Bold graph drawings (Q654288) (← links)
- Data structures for extension violations in a query range (Q662125) (← links)
- Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points (Q680145) (← links)
- Approximate input sensitive algorithms for point pattern matching (Q733152) (← links)
- Output sensitive algorithms for approximate incidences and their applications (Q827295) (← links)
- Algorithms for graphs of bounded treewidth via orthogonal range searching (Q833703) (← links)
- Computing minimum-area rectilinear convex hull and \(L\)-shape (Q833717) (← links)
- Optimal external memory planar point enclosure (Q834582) (← links)
- Chromatic distribution of \(k\)-nearest neighbors of a line segment in a planar colored point set (Q845996) (← links)
- Indexing text using the Ziv--Lempel trie (Q876708) (← links)
- Semi-algebraic Ramsey numbers (Q896011) (← links)
- Property-preserving data reconstruction (Q930593) (← links)
- Ray shooting and intersection searching amidst fat convex polyhedra in 3-space (Q934024) (← links)
- Approximating nearest neighbor among triangles in convex position (Q975498) (← links)
- Region-restricted clustering for geographic data mining (Q1000925) (← links)
- Efficient \(c\)-oriented range searching with DOP-trees (Q1000927) (← links)
- The effect of corners on the complexity of approximate range searching (Q1014333) (← links)
- Dynamic connectivity for axis-parallel rectangles (Q1016519) (← links)
- Cache-oblivious R-trees (Q1017905) (← links)
- On regular vertices of the union of planar convex objects (Q1017923) (← links)
- Indexing moving points (Q1394801) (← links)
- Two-dimensional substring indexing. (Q1401971) (← links)
- A (\(1+{\varepsilon}\))-approximation algorithm for 2-line-center (Q1405006) (← links)
- Efficient searching with linear constraints (Q1591152) (← links)
- On approximate nearest neighbors under \(l_\infty\) norm (Q1604212) (← links)
- Higher order Delaunay triangulations (Q1614071) (← links)
- The range 1 query (R1Q) problem (Q1659997) (← links)
- Finding pairwise intersections inside a query range (Q1755743) (← links)
- Reporting intersecting pairs of convex polytopes in two and three dimensions (Q1862123) (← links)
- Triangular range counting query in 2D and its application in finding \(k\) nearest neighbors of a line segment (Q1886235) (← links)
- Lower bounds for intersection searching and fractional cascading in higher dimension (Q1887711) (← links)
- On the power of the semi-separated pair decomposition (Q1947974) (← links)
- Color-spanning localized query (Q1998849) (← links)
- Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model (Q2096389) (← links)
- Finding pairwise intersections of rectangles in a query rectangle (Q2175440) (← links)
- Range search on tuples of points (Q2253898) (← links)
- On Euclidean vehicle routing with allocation (Q2269139) (← links)
- Approximate range searching: The absolute model (Q2269144) (← links)
- The \(n\)-dimensional \(k\)-vector and its application to orthogonal range searching (Q2287830) (← links)
- Near-linear algorithms for geometric hitting sets and set covers (Q2291457) (← links)
- Closest-pair queries in fat rectangles (Q2331215) (← links)
- Geometric BWT: compressed text indexing via sparse suffixes and range searching (Q2346957) (← links)
