Computational geometry: an introduction
Computational geometry: an introduction
IEEE Transactions on Pattern Analysis and Machine Intelligence
Oriented projective geometry
Multi-criteria geometric optimization problems in layered manufacturing
Proceedings of the fourteenth annual symposium on Computational geometry
Checking geometric programs or verification of geometric structures
Selected papers from the 12th annual symposium on Computational Geometry
On some geometric optimization problems in layered manufacturing
Computational Geometry: Theory and Applications
Minimizing support structures and trapped area in two-dimensional layered manufacturing
Computational Geometry: Theory and Applications
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
Rapid Prototyping and Manufacturing: Fundamentals of StereoLithography
Rapid Prototyping and Manufacturing: Fundamentals of StereoLithography
Concrete Math
Literate Programming Simplified
IEEE Software
A decomposition-based approach to layered manufacturing
Computational Geometry: Theory and Applications
Incremental Penetration Depth Estimation between Convex Polytopes Using Dual-Space Expansion
IEEE Transactions on Visualization and Computer Graphics
| Hi-index | 0.00 |
We describe a robust, exact, and efficient implementation of an algorithm that computes the width of a three-dimensional point set. The algorithm is based on efficient solutions to problems that are at the heart of computational geometry: three-dimensional convex hulls, point location in planar graphs, and computing intersections between line segments. The latter two problems have to be solved for planar graphs and segments on the unit sphere, rather than in the two-dimensional plane. The implementation is based on LEDA, and the geometric objects are represented using exact rational arithmetic.