Pages that link to "Item:Q1196362"
From MaRDI portal
The following pages link to Applications of a new space-partitioning technique (Q1196362):
Displaying 17 items.
- Optimal partition trees (Q420575) (← links)
- An incidence theorem in higher dimensions (Q452010) (← links)
- A faster algorithm for computing motorcycle graphs (Q471142) (← links)
- How hard is half-space range searching? (Q685178) (← links)
- Space reduction and an extension for a hidden line elimination algorithm (Q1126253) (← links)
- On range searching with semialgebraic sets (Q1329188) (← 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)
- Spanners for geodesic graphs and visibility graphs (Q1709579) (← links)
- Ray shooting and stone throwing with near-linear storage (Q1776898) (← links)
- Iterated snap rounding (Q1862124) (← links)
- Connected component and simple polygon intersection searching (Q1918994) (← links)
- Visibility testing and counting for uncertain segments (Q2420576) (← links)
- A new asymmetric inclusion region for minimum weight triangulation (Q2655340) (← links)
- EFFICIENT NON-INTERSECTION QUERIES ON AGGREGATED GEOMETRIC DATA (Q3405967) (← links)
- Simplex Range Searching and Its Variants: A Review (Q4604367) (← links)
- Connected component and simple polygon intersection searching (Q5060096) (← links)
