Fast detection of polyhedral intersection
From MaRDI portal
Publication:759483
DOI10.1016/0304-3975(82)90120-7zbMath0553.68033OpenAlexW1996036165MaRDI QIDQ759483
David P. Dobkin, David G. Kirkpatrick
Publication date: 1983
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(82)90120-7
Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99) Polytopes and polyhedra (52Bxx)
Related Items
Computing circular separability ⋮ Ray shooting in polygons using geodesic triangulations ⋮ Finding transversals for sets of simple geometric figures ⋮ On intersection searching problems involving curved objects ⋮ On the complexity of approximating and illuminating three-dimensional convex polyhedra ⋮ Bounds on the size of tetrahedralizations ⋮ On the detection of a common intersection of k convex subjects in the plane ⋮ On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees ⋮ The shortest watchtower and related problems for polyhedral terrains ⋮ Parallel computational geometry ⋮ Parallel construction of subdivision hierarchies ⋮ Approximate Polytope Membership Queries ⋮ Unnamed Item ⋮ Computational geometry in a curved world ⋮ Unnamed Item ⋮ Ray shooting and intersection searching amidst fat convex polyhedra in 3-space ⋮ Detecting the intersection of convex objects in the plane ⋮ Bounded-degree polyhedronization of point sets ⋮ Strategies for polyhedral surface decomposition: an experimental study. ⋮ Intersection of unit-balls and diameter of a point set in \(\mathbb R^3\). ⋮ An efficient algorithm for the three-dimensional diameter problem ⋮ Computing hereditary convex structures ⋮ Witness (Delaunay) graphs ⋮ Sigma-local graphs ⋮ The complexity of many cells in arrangements of planes and related problems ⋮ Optimal output-sensitive convex hull algorithms in two and three dimensions ⋮ Output-sensitive results on convex hulls, extreme points, and related problems ⋮ Computing shortest transversals ⋮ A dual approach to detect polyhedral intersections in arbitrary dimensions ⋮ Storing the subdivision of a polyhedral surface ⋮ Polyhedral line transversals in space ⋮ Quasi-optimal range searching in spaces of finite VC-dimension ⋮ TEMPORAL COHERENCE IN BOUNDING VOLUME HIERARCHIES FOR COLLISION DETECTION ⋮ Counting and representing intersections among triangles in three dimensions ⋮ Minimum vertex distance between separable convex polygons ⋮ COMPUTING CONSTRAINED SHORTEST SEGMENTS: BUTTERFLY WINGSPANS IN LOGARITHMIC TIME ⋮ FINDING THE LARGEST EMPTY DISK CONTAINING A QUERY POINT
Cites Work
