Convex partitions of polyhedra: a lower bound and worst-case optimal algorithm
SIAM Journal on Computing
Art gallery theorems and algorithms
Art gallery theorems and algorithms
Triangulating a nonconvex polytope
Discrete & Computational Geometry - Selected papers from the fifth annual ACM symposium on computational geometry, Saarbrücken, Germany, June 5-11, 1989
Convex decomposition of polyhedra and robustness
SIAM Journal on Computing
On the difficulty of triangulating three-dimensional nonconvex polyhedra.
Discrete & Computational Geometry
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Quality mesh generation in three dimensions
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Compatible tetrahedralizations
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
On the form factor between two polygons
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
Bounds on the size of tetrahedralizations
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Decomposing the Boundary of a Nonconvex Polyhedron
SWAT '92 Proceedings of the Third Scandinavian Workshop on Algorithm Theory
On visible surface generation by a priori tree structures
SIGGRAPH '80 Proceedings of the 7th annual conference on Computer graphics and interactive techniques
Proceedings of the eleventh annual symposium on Computational geometry
Levels of detail & polygonal simplification
Crossroads - Special issue on computer graphics
Decomposing polygon meshes for interactive applications
I3D '01 Proceedings of the 2001 symposium on Interactive 3D graphics
Partitioning 3D Surface Meshes Using Watershed Segmentation
IEEE Transactions on Visualization and Computer Graphics
Piecewise regular meshes: construction and compression
Graphical Models - Special issue: Processing on large polygonal meshes
A planar-reflective symmetry transform for 3D shapes
ACM SIGGRAPH 2006 Papers
Approximate convex decomposition of polyhedra
SIGGRAPH '04 ACM SIGGRAPH 2004 Posters
Approximate convex decomposition of polyhedra
Proceedings of the 2007 ACM symposium on Solid and physical modeling
Convex hull covering of polygonal scenes for accurate collision detection in games
GI '08 Proceedings of graphics interface 2008
Approximate convex decomposition of polyhedra and its applications
Computer Aided Geometric Design
3D Mesh Exploration for Smart Visual Interfaces
VISUAL '08 Proceedings of the 10th international conference on Visual Information Systems: Web-Based Visual Information Search and Management
Minimum decomposition of a digital surface into digital plane segments is NP-hard
Discrete Applied Mathematics
Hierarchical convex approximation of 3D shapes for fast region selection
SGP '08 Proceedings of the Symposium on Geometry Processing
A simple and efficient approach for 3D mesh approximate convex decomposition
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Semantic 3D Media and Content: Surface partial matching and application to archaeology
Computers and Graphics
Minimal decomposition of a digital surface into digital plane segments is NP-Hard
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
A sweep and translate algorithm for computing voxelized 3D Minkowski sums on the GPU
Computer-Aided Design
| Hi-index | 0.00 |