Pages that link to "Item:Q1849788"
From MaRDI portal
The following pages link to Realistic input models for geometric algorithms (Q1849788):
Displayed 17 items.
- Tight lower bounds for halfspace range searching (Q420572) (← links)
- Approximating the Fréchet distance for realistic curves in near linear time (Q443909) (← links)
- A note on the perimeter of fat objects (Q709064) (← links)
- An optimal-time algorithm for shortest paths on realistic polyhedra (Q848859) (← links)
- On realistic terrains (Q934023) (← links)
- Smoothed analysis of probabilistic roadmaps (Q1028227) (← links)
- Decompositions and boundary coverings of non-convex fat polyhedra (Q1037773) (← links)
- Guarding scenes against invasive hypercubes. (Q1405005) (← links)
- Spanning trees crossing few barriers (Q1422228) (← links)
- Computing the visibility map of fat objects (Q2269142) (← links)
- Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions (Q2269835) (← links)
- Approximate range searching using binary space partitions (Q2489539) (← links)
- Connect the Dot: Computing Feed-Links with Minimum Dilation (Q3183440) (← links)
- Delaunay Triangulation of Imprecise Points Simplified and Extended (Q3183447) (← links)
- The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains (Q3541078) (← links)
- I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions (Q5387782) (← links)
- Approximate Range Searching in External Memory (Q5387785) (← links)