Convex partitions of polyhedra: a lower bound and worst-case optimal algorithm
SIAM Journal on Computing
Data structures and algorithms 3: multi-dimensional searching and computational geometry
Data structures and algorithms 3: multi-dimensional searching and computational geometry
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
Triangulation and CSG representation of polyhedra with arbitrary genus
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Convex decomposition of polyhedra and robustness
SIAM Journal on Computing
On the difficulty of triangulating three-dimensional nonconvex polyhedra.
Discrete & Computational Geometry
An optimal algorithm for intersecting three-dimensional convex polyhedra
SIAM Journal on Computing
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Compatible tetrahedralizations
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
A Simple Primal Algorithm for Intersecting 3-Polyhedra in Linear Time
A Simple Primal Algorithm for Intersecting 3-Polyhedra in Linear Time
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Stabbing triangulations by lines in 3D
Proceedings of the eleventh annual symposium on Computational geometry
Strategies for polyhedral surface decomposition: an experimental study
Proceedings of the eleventh annual symposium on Computational geometry
Linear complexity hexahedral mesh generation
Proceedings of the twelfth annual symposium on Computational geometry
Tetrahedralization of Two Nested Convex Polyhedra
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Detecting tetrahedralizations of a set of line segments
Journal of Algorithms
Compatible Tetrahedralizations
Fundamenta Informaticae
| Hi-index | 0.00 |