scientific article
From MaRDI portal
Publication:4038707
zbMath0765.68205MaRDI QIDQ4038707
David P. Dobkin, David G. Kirkpatrick
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (34)
Multi-agent pathfinding with continuous time ⋮ Ray shooting on triangles in 3-space ⋮ Computing the intersection-depth to polyhedra ⋮ Counterexample-guided predicate abstraction of hybrid systems ⋮ Linear data structures for fast ray-shooting amidst convex polyhedra ⋮ Computing common tangents without a separating line ⋮ An optimal algorithm for finding the separation of simple polygons ⋮ A time-optimal parallel algorithm for three-dimensional convex hulls ⋮ Finding a closet visible vertex pair between two polygons ⋮ Separation and approximation of polyhedral objects ⋮ Adaptive Point Location in Planar Convex Subdivisions ⋮ A new fast algorithm for computing the distance between two disjoint convex polygons based on Voronoi diagram ⋮ Range minima queries with respect to a random permutation, and approximate range counting ⋮ Representation complexity of adaptive 3D distance fields ⋮ A local search algorithm for ray-convex polyhedron intersection ⋮ Shape matching under rigid motion ⋮ Convex hulls of spheres and convex hulls of disjoint convex polytopes ⋮ Unnamed Item ⋮ Hierarchy of surface models and irreducible triangulations. ⋮ Dynamic geometric data structures via shallow cuttings ⋮ Applications of a new space-partitioning technique ⋮ Outlier respecting points approximation ⋮ Dynamic point location in arrangements of hyperplanes ⋮ Hausdorff approximation of 3D convex polytopes ⋮ Computing the shortest watchtower of a polyhedral terrain in \(O(n\log n)\) time. ⋮ Witness (Delaunay) graphs ⋮ Ray shooting and stone throwing with near-linear storage ⋮ A simpler linear-time algorithm for intersecting two convex polyhedra in three dimensions ⋮ Optimal output-sensitive convex hull algorithms in two and three dimensions ⋮ Succinct and Implicit Data Structures for Computational Geometry ⋮ Adaptive Planar Point Location ⋮ An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\) ⋮ On the planar two-center problem and circular hulls ⋮ Linear time approximation of 3D convex polytopes
This page was built for publication:
