Convex partitions of polyhedra: a lower bound and worst-case optimal algorithm
SIAM Journal on Computing
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
On the difficulty of tetrahedralizing 3-dimensional non-convex polyhedra
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
On the representation and manipulation of rigid solids
On the representation and manipulation of rigid solids
The complexity and construction of many faces in arrangements of lines and of segments
Discrete & Computational Geometry - Special issue on the complexity of arrangements
Polygon nesting and robustness
Information Processing Letters
Efficient binary space partitions for hidden-surface removal and solid modeling
Discrete & Computational Geometry - Selected papers from the fifth annual ACM symposium on computational geometry, Saarbrücken, Germany, June 5-11, 1989
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
On good triangulations in three dimensions
SMA '91 Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications
Convex decomposition of polyhedra and robustness
SIAM Journal on Computing
An efficient algorithm for finding the CSG representation of a simple polygon
SIGGRAPH '88 Proceedings of the 15th annual conference on Computer graphics and interactive techniques
Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms
ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
On good triangulations in three dimensions
SMA '91 Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications
Bounds on the size of tetrahedralizations
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Large mesh generation from boundary models with parametric face representation
SMA '95 Proceedings of the third ACM symposium on Solid modeling and applications
Detecting tetrahedralizations of a set of line segments
Journal of Algorithms
A robust segment/triangle intersection algorithm for interference tests. Efficiency study
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |