scientific article; zbMATH DE number 177829
From MaRDI portal
Publication:4038707
Recommendations
- Separation and approximation of polyhedral objects
- scientific article; zbMATH DE number 742976
- scientific article; zbMATH DE number 5066290
- A linear algorithm for determining the separation of convex polyhedra
- Separating point sets in polygonal environments
- SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS
- scientific article; zbMATH DE number 1958118
- A method for detecting structure in polyhedra
- On the problem polyhedral separability: a numerical solution
Cited in
(38)- Hausdorff approximation of 3D convex polytopes
- Ray shooting and stone throwing with near-linear storage
- Dynamic geometric data structures via shallow cuttings
- A method for detecting structure in polyhedra
- scientific article; zbMATH DE number 742976 (Why is no real title available?)
- scientific article; zbMATH DE number 5066290 (Why is no real title available?)
- Multi-agent pathfinding with continuous time
- Computing the shortest watchtower of a polyhedral terrain in \(O(n\log n)\) time.
- Computing common tangents without a separating line
- An optimal algorithm for finding the separation of simple polygons
- A local search algorithm for ray-convex polyhedron intersection
- Convex hulls of spheres and convex hulls of disjoint convex polytopes
- A simpler linear-time algorithm for intersecting two convex polyhedra in three dimensions
- A new fast algorithm for computing the distance between two disjoint convex polygons based on Voronoi diagram
- Shape matching under rigid motion
- Approximate convex intersection detection with applications to width and Minkowski sums
- Applications of a new space-partitioning technique
- A time-optimal parallel algorithm for three-dimensional convex hulls
- Finding a closet visible vertex pair between two polygons
- Hierarchy of surface models and irreducible triangulations.
- Optimal output-sensitive convex hull algorithms in two and three dimensions
- Linear data structures for fast ray-shooting amidst convex polyhedra
- An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\)
- Counterexample-guided predicate abstraction of hybrid systems
- Separation and approximation of polyhedral objects
- Adaptive planar point location
- Separation of disconnected machining regions on the basis of a CSG model
- Range minima queries with respect to a random permutation, and approximate range counting
- Representation complexity of adaptive 3D distance fields
- Succinct and Implicit Data Structures for Computational Geometry
- Ray shooting on triangles in 3-space
- Adaptive Point Location in Planar Convex Subdivisions
- Computing the intersection-depth to polyhedra
- Dynamic point location in arrangements of hyperplanes
- Witness (Delaunay) graphs
- Linear time approximation of 3D convex polytopes
- On the planar two-center problem and circular hulls
- Outlier respecting points approximation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4038707)
