An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra

DOI10.1137/0221041zbMATH Open0825.68642OpenAlexW2146517658MaRDI QIDQ4018399FDOQ4018399

Authors: Bernard Chazelle 

Publication date: 16 January 1993

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0221041

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (20)

• Polyhedral GPU Accelerated Shape from Silhouette
• Conservative interpolation between volume meshes by local Galerkin projection
• Extremal polygon containment problems
• An Efficient Implementation of Mass Conserving Characteristic-Based Schemes in Two and Three Dimensions
• Computing the maximum overlap of two convex polygons under translations
• Approximating points by a piecewise linear function
• Conservative interpolation on unstructured polyhedral meshes: an extension of the supermesh approach to cell-centered finite-volume variables
• Lower bounds for intersection searching and fractional cascading in higher dimension
• A simpler linear-time algorithm for intersecting two convex polyhedra in three dimensions
• Approximate convex intersection detection with applications to width and Minkowski sums
• Solving the diffusion equation on a non-aligned mesh
• Optimal output-sensitive convex hull algorithms in two and three dimensions
• Minimum-sum dipolar spanning tree in \(\mathbb R^3\)
• Title not available (Why is that?)
• 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
• Generation and Recognition of Digital Planes Using Multi-dimensional Continued Fractions

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)