Fast detection of polyhedral intersection
From MaRDI portal
Publication:759483
DOI10.1016/0304-3975(82)90120-7zbMATH Open0553.68033OpenAlexW1996036165MaRDI QIDQ759483FDOQ759483
Authors: David P. Dobkin, David 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
Recommendations
Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99) Polytopes and polyhedra (52Bxx)
Cites Work
Cited In (45)
- Storing the subdivision of a polyhedral surface
- Parallel computational geometry
- Fast computation of the modality of polygons
- The complexity of many cells in arrangements of planes and related problems
- Optimal detection of intersections between convex polyhedra
- Approximate polytope membership queries
- On intersection searching problems involving curved objects
- On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees
- Title not available (Why is that?)
- Approximate convex intersection detection with applications to width and Minkowski sums
- Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
- Optimal output-sensitive convex hull algorithms in two and three dimensions
- Ray shooting in polygons using geodesic triangulations
- Parallel construction of subdivision hierarchies
- Title not available (Why is that?)
- Output-sensitive results on convex hulls, extreme points, and related problems
- Quasi-optimal range searching in spaces of finite VC-dimension
- FAST SOFTWARE FOR BOX INTERSECTIONS
- On the complexity of approximating and illuminating three-dimensional convex polyhedra
- Sigma-local graphs
- Fast dynamic intersection searching in a set of isothetic line segments
- Finding the largest empty disk containing a query point
- Computing shortest transversals
- A dual approach to detect polyhedral intersections in arbitrary dimensions
- Computing hereditary convex structures
- Strategies for polyhedral surface decomposition: an experimental study.
- Bounded-degree polyhedronization of point sets
- Exact join detection for convex polyhedra and other numerical abstractions
- Fast polyhedra abstract domain
- The shortest watchtower and related problems for polyhedral terrains
- Computational geometry in a curved world
- On the detection of a common intersection of k convex subjects in the plane
- Computing circular separability
- Detecting the intersection of convex objects in the plane
- Polyhedral line transversals in space
- Witness (Delaunay) graphs
- Minimum vertex distance between separable convex polygons
- Collision detection for complicated polyhedra using the fast multipole method or ray crossing
- Bounds on the size of tetrahedralizations
- Counting and representing intersections among triangles in three dimensions
- COMPUTING CONSTRAINED SHORTEST SEGMENTS: BUTTERFLY WINGSPANS IN LOGARITHMIC TIME
- Intersection of unit-balls and diameter of a point set in \(\mathbb R^3\).
- Finding transversals for sets of simple geometric figures
- TEMPORAL COHERENCE IN BOUNDING VOLUME HIERARCHIES FOR COLLISION DETECTION
- An efficient algorithm for the three-dimensional diameter problem
This page was built for publication: Fast detection of polyhedral intersection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q759483)
