Convex Decomposition of Polyhedra and Robustness
From MaRDI portal
Publication:3990658
DOI10.1137/0221025zbMath0747.68093OpenAlexW2136054249MaRDI QIDQ3990658
Tamal Krishna Dey, Chanderjit L. Bajaj
Publication date: 28 June 1992
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://docs.lib.purdue.edu/cstech/842
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items
Many-face complexity in incremental convex arrangements, Boundary-trimmed 3D triangular mesh segmentation based on iterative merging strategy, Exact Minkowksi sums of polyhedra and exact and efficient decomposition of polyhedra into convex pieces, Bounds on the size of tetrahedralizations, Optimal tetrahedralization of the 3D-region ``between a convex polyhedron and a convex polygon, A survey on Mesh Segmentation Techniques, Tetrahedral meshes from planar cross-sections, Decomposing the boundary of a nonconvex polyhedron, Strategies for polyhedral surface decomposition: an experimental study., UNSTRUCTURED MESH GENERATION: THEORY, PRACTICE, AND PERSPECTIVES, PARALLEL SOLID MODELING USING BSP DATAFLOW, Approximate convex decomposition of polyhedra and its applications, DIMENSION-INDEPENDENT BSP (1): SECTION AND INTERIOR-TO-BOUNDARY MAPPING
