The following pages link to (Q4038707):
Displaying 34 items.
- A local search algorithm for ray-convex polyhedron intersection (Q429472) (← links)
- Outlier respecting points approximation (Q517798) (← links)
- Witness (Delaunay) graphs (Q551502) (← links)
- Range minima queries with respect to a random permutation, and approximate range counting (Q629829) (← links)
- Representation complexity of adaptive 3D distance fields (Q632926) (← links)
- A simpler linear-time algorithm for intersecting two convex polyhedra in three dimensions (Q728493) (← links)
- Linear data structures for fast ray-shooting amidst convex polyhedra (Q834599) (← links)
- A new fast algorithm for computing the distance between two disjoint convex polygons based on Voronoi diagram (Q863827) (← links)
- Hausdorff approximation of 3D convex polytopes (Q963404) (← links)
- Applications of a new space-partitioning technique (Q1196362) (← links)
- Dynamic point location in arrangements of hyperplanes (Q1199133) (← links)
- Hierarchy of surface models and irreducible triangulations. (Q1428114) (← links)
- An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\) (Q1591950) (← links)
- Ray shooting and stone throwing with near-linear storage (Q1776898) (← links)
- Optimal output-sensitive convex hull algorithms in two and three dimensions (Q1816462) (← links)
- Linear time approximation of 3D convex polytopes (Q1862132) (← links)
- A time-optimal parallel algorithm for three-dimensional convex hulls (Q1899449) (← links)
- Finding a closet visible vertex pair between two polygons (Q1899450) (← links)
- Separation and approximation of polyhedral objects (Q1900992) (← links)
- Shape matching under rigid motion (Q1947970) (← links)
- Convex hulls of spheres and convex hulls of disjoint convex polytopes (Q1947973) (← links)
- On the planar two-center problem and circular hulls (Q2105328) (← links)
- Multi-agent pathfinding with continuous time (Q2124435) (← links)
- Dynamic geometric data structures via shallow cuttings (Q2223621) (← links)
- Ray shooting on triangles in 3-space (Q2366231) (← links)
- Computing the intersection-depth to polyhedra (Q2366234) (← links)
- Counterexample-guided predicate abstraction of hybrid systems (Q2368954) (← links)
- Computing the shortest watchtower of a polyhedral terrain in \(O(n\log n)\) time. (Q2482906) (← links)
- Succinct and Implicit Data Structures for Computational Geometry (Q2848977) (← links)
- (Q5009560) (← links)
- Adaptive Planar Point Location (Q5009786) (← links)
- Computing common tangents without a separating line (Q5057432) (← links)
- An optimal algorithm for finding the separation of simple polygons (Q5060097) (← links)
- Adaptive Point Location in Planar Convex Subdivisions (Q5370568) (← links)