The following pages link to (Q3358267):
Displaying 20 items.
- Max-throughput for (conservative) \(k\)-of-\(n\) testing (Q513287) (← links)
- Confluently persistent tries for efficient version control (Q970608) (← links)
- Casting an object with a core (Q1024213) (← links)
- Finding the \(k\) smallest spanning trees (Q1196455) (← links)
- Worst-case versus average case complexity of ray-shooting (Q1271535) (← links)
- Motion planning in the presence of movable obstacles (Q1356169) (← links)
- Constructing Voronoi diagrams from hollow spheres using conformal geometric algebra (Q1695114) (← links)
- Building an optimal point-location structure in \(O(\operatorname{sort}(n))\) I/Os (Q1741853) (← links)
- Connected component and simple polygon intersection searching (Q1918994) (← links)
- Two-dimensional packet classification and filter conflict resolution in the internet (Q2272209) (← links)
- Nearest-neighbor searching under uncertainty. I (Q2411831) (← links)
- Computing the shortest watchtower of a polyhedral terrain in \(O(n\log n)\) time. (Q2482906) (← links)
- Triangles in space or building (and analyzing) castles in the air (Q2638823) (← links)
- The inverse Voronoi problem in graphs. II: Trees (Q2663704) (← links)
- Succinct and Implicit Data Structures for Computational Geometry (Q2848977) (← links)
- Dynamic planar point location with optimal query time (Q5096145) (← links)
- (Q5116523) (← links)
- New Bounds for Range Closest-Pair Problems (Q5116533) (← links)
- Random access in persistent strings and segment selection (Q6174650) (← links)
- Farthest-point Voronoi diagrams in the presence of rectangular obstacles (Q6174812) (← links)
