Triangulation and CSG representation of polyhedra with arbitrary genus
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
On good triangulations in three dimensions
SMA '91 Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications
Compatible tetrahedralizations
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Implementation of a motion planning system in three dimensions
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Bounds on the size of tetrahedralizations
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
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
Partitioning 3D Surface Meshes Using Watershed Segmentation
IEEE Transactions on Visualization and Computer Graphics
A decomposition-based approach to layered manufacturing
Computational Geometry: Theory and Applications
A Decomposition-Based Approach to Layered Manufacturing
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Approximation of Minimum Triangulation for Polyhedron with Bounded Degrees
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Algorithms and Complexity for Tetrahedralization Detections
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Tetrahedralization of Two Nested Convex Polyhedra
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
The complexity of finding small triangulations of convex 3-polytopes
Journal of Algorithms - Special issue: SODA 2000
Detecting tetrahedralizations of a set of line segments
Journal of Algorithms
Approximating the minimum triangulation of convex 3-polytopes with bounded degrees
Computational Geometry: Theory and Applications
Optimal Accurate Minkowski Sum Approximation of Polyhedral Models
ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues
Validation and Storage of Polyhedra through Constrained Delaunay Tetrahedralization
GIScience '08 Proceedings of the 5th international conference on Geographic Information Science
Haptic rendering of complex objects via directional sampling
VRCAI '08 Proceedings of The 7th ACM SIGGRAPH International Conference on Virtual-Reality Continuum and Its Applications in Industry
Approximating the minimum triangulation of convex 3-polytopes with bounded degrees
Computational Geometry: Theory and Applications
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Constrained Delaunay tetrahedral mesh generation and refinement
Finite Elements in Analysis and Design
Algorithms and theory of computation handbook
Compatible Tetrahedralizations
Fundamenta Informaticae
Efficiently hex-meshing things with topology
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |