Finding the intersection of two convex polyhedra
From MaRDI portal
Cites work
- Computational Complexity of Fourier Transforms Over Finite Fields
- Convex hulls of finite sets of points in two and three dimensions
- scientific article; zbMATH DE number 3457676 (Why is no real title available?)
- scientific article; zbMATH DE number 3557226 (Why is no real title available?)
- scientific article; zbMATH DE number 3323651 (Why is no real title available?)
- Location of a Point in a Planar Subdivision and Its Applications
- On Finding the Maxima of a Set of Vectors
Cited in
(55)- On a circle placement problem
- The power of geometric duality
- Reconstructing visible regions from visible segments
- Polygonizations of point sets in the plane
- Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints: Properties and algorithms
- Minimum polygonal separation
- Hidden-surface removal in polyhedral cross-sections
- Establishing order in planar subdivisions
- Triangulating a simple polygon in linear time
- Parallel methods for visibility and shortest-path problems in simple polygons
- Finding the intersection of n half-spaces in time O(n log n)
- Geometrical tools in classification
- A hierarchical representation and computation scheme of arbitrary-dimensional geometrical primitives based on CGA
- Representing geometric structures in \(d\) dimensions: Topology and order
- Generating rooted triangulations without repetitions
- Storing the subdivision of a polyhedral surface
- Reporting and counting segment intersections
- Applications of random sampling in computational geometry. II
- An efficient algorithm for enumeration of triangulations
- Separation and approximation of polyhedral objects
- Sweep methods for parallel computational geometry
- Optimal tetrahedralization of the 3D-region ``between a convex polyhedron and a convex polygon
- 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
- Acrophobic guard watchtower problem
- Navigating planar topologies in near-optimal space and time
- Efficient representation of Laguerre mosaics with an application to microstructure simulation of complex ore
- Testing over-representation of observations in subsets of a DEA technology
- Ray shooting on triangles in 3-space
- On certain Hamiltonian inner triangulations
- Approximating points by a piecewise linear function
- Modeling and manipulating cell complexes in two, three and higher dimensions
- COMPACT REPRESENTATIONS OF SIMPLICIAL MESHES IN TWO AND THREE DIMENSIONS
- A CASE STUDY IN ALGORITHM ENGINEERING FOR GEOMETRIC COMPUTING
- AN IMPROVED ALGORITHM FOR SUBDIVISION TRAVERSAL WITHOUT EXTRA STORAGE
- Approximate convex intersection detection with applications to width and Minkowski sums
- Decomposing the boundary of a nonconvex polyhedron
- NURBS Enhanced Virtual Element Methods for the Spatial Discretization of the Multigroup Neutron Diffusion Equation on Curvilinear Polygonal Meshes
- An Efficient Implementation of Mass Conserving Characteristic-Based Schemes in Two and Three Dimensions
- Outlier respecting points approximation
- Linear space data structures for two types of range search
- A new contact detection method for arbitrary dilated polyhedra with potential function in discrete element method
- Generalized Bézier volumes over simple convex polyhedra
- Decomposing the boundary of a nonconvex polyhedron
- Linear planar 3-SAT
- Thirty years of developments in contact modelling of non-spherical particles in DEM: a selective review
- Generation of polygonal meshes in compact space
- Formal definition of hexahedral blocking operations using n-G-maps
- Robust curve embedding in inconsistent surface meshes
- Space sweep solves intersection of convex polyhedra
- Minimum vertex distance between separable convex polygons
- An n log n algorithm for determining the congruity of polyhedra
- Triangulating a nonconvex polytope
- An optimal parallel algorithm for linear programming in the plane
- Finding Hamiltonian cycles in certain planar graphs
This page was built for publication: Finding the intersection of two convex polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1253450)
