An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra
From MaRDI portal
Publication:4018399
Cited in
(20)- Generation and Recognition of Digital Planes Using Multi-dimensional Continued Fractions
- Conservative interpolation between volume meshes by local Galerkin projection
- Polyhedral GPU Accelerated Shape from Silhouette
- Extremal polygon containment problems
- An Efficient Implementation of Mass Conserving Characteristic-Based Schemes in Two and Three Dimensions
- Conservative interpolation on unstructured polyhedral meshes: an extension of the supermesh approach to cell-centered finite-volume variables
- Computing the maximum overlap of two convex polygons under translations
- Approximating points by a piecewise linear function
- Lower bounds for intersection searching and fractional cascading in higher dimension
- A simpler linear-time algorithm for intersecting two convex polyhedra in three dimensions
- Solving the diffusion equation on a non-aligned mesh
- Approximate convex intersection detection with applications to width and Minkowski sums
- Optimal output-sensitive convex hull algorithms in two and three dimensions
- Minimum-sum dipolar spanning tree in \(\mathbb R^3\)
- scientific article; zbMATH DE number 1471729 (Why is no real title available?)
- Maximum overlap and minimum convex hull of two convex polyhedra under translations
- Computing hereditary convex structures
- Bounds on the size of tetrahedralizations
- Conservative remapping and region overlays by intersecting arbitrary polyhedra
- On the planar two-center problem and circular hulls
This page was built for publication: An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4018399)
