Finding the intersection of two convex polyhedra
From MaRDI portal
Publication:1253450
DOI10.1016/0304-3975(78)90051-8zbMath0396.52002OpenAlexW2081280922MaRDI QIDQ1253450
David E. Muller, Franco P. Preparata
Publication date: 1978
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2142/74093
Analysis of algorithms and problem complexity (68Q25) Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Polytopes and polyhedra (52Bxx)
Related Items (49)
The power of geometric duality ⋮ Ray shooting on triangles in 3-space ⋮ On certain Hamiltonian inner triangulations ⋮ Reconstructing visible regions from visible segments ⋮ Approximating points by a piecewise linear function ⋮ Polygonizations of point sets in the plane ⋮ Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints: Properties and algorithms ⋮ Geometrical tools in classification ⋮ Minimum polygonal separation ⋮ Separation and approximation of polyhedral objects ⋮ Hidden-surface removal in polyhedral cross-sections ⋮ AN IMPROVED ALGORITHM FOR SUBDIVISION TRAVERSAL WITHOUT EXTRA STORAGE ⋮ Sweep methods for parallel computational geometry ⋮ Establishing order in planar subdivisions ⋮ Optimal tetrahedralization of the 3D-region ``between a convex polyhedron and a convex polygon ⋮ NURBS Enhanced Virtual Element Methods for the Spatial Discretization of the Multigroup Neutron Diffusion Equation on Curvilinear Polygonal Meshes ⋮ A hierarchical representation and computation scheme of arbitrary-dimensional geometrical primitives based on CGA ⋮ An Efficient Implementation of Mass Conserving Characteristic-Based Schemes in Two and Three Dimensions ⋮ Efficient representation of Laguerre mosaics with an application to microstructure simulation of complex ore ⋮ Unnamed Item ⋮ Triangulating a nonconvex polytope ⋮ An optimal parallel algorithm for linear programming in the plane ⋮ Finding Hamiltonian cycles in certain planar graphs ⋮ Triangulating a simple polygon in linear time ⋮ On the edge-length ratio of outerplanar graphs ⋮ Decomposing the boundary of a nonconvex polyhedron ⋮ Modeling and Manipulating Cell Complexes in Two, Three and Higher Dimensions ⋮ Outlier respecting points approximation ⋮ Parallel methods for visibility and shortest-path problems in simple polygons ⋮ Decomposing the boundary of a nonconvex polyhedron ⋮ COMPACT REPRESENTATIONS OF SIMPLICIAL MESHES IN TWO AND THREE DIMENSIONS ⋮ An energy-conserving contact theory for discrete element modelling of arbitrarily shaped particles: contact volume based model and computational issues ⋮ Mollified finite element approximants of arbitrary order and smoothness ⋮ A CASE STUDY IN ALGORITHM ENGINEERING FOR GEOMETRIC COMPUTING ⋮ Linear space data structures for two types of range search ⋮ Representing geometric structures in \(d\) dimensions: Topology and order ⋮ Finding the intersection of n half-spaces in time O(n log n) ⋮ Generating rooted triangulations without repetitions ⋮ Space sweep solves intersection of convex polyhedra ⋮ Storing the subdivision of a polyhedral surface ⋮ Reporting and counting segment intersections ⋮ Applications of random sampling in computational geometry. II ⋮ Minimum vertex distance between separable convex polygons ⋮ Acrophobic guard watchtower problem ⋮ Navigating planar topologies in near-optimal space and time ⋮ An n log n algorithm for determining the congruity of polyhedra ⋮ On a circle placement problem ⋮ An efficient algorithm for enumeration of triangulations ⋮ Testing over-representation of observations in subsets of a DEA technology
Cites Work
This page was built for publication: Finding the intersection of two convex polyhedra
