Learn More
We present an exact implementation of an efficient algorithm that computes Minkowski sums of convex polyhedra in R. Our implementation is complete in the sense that it does not assume general position. Namely, it can handle degenerate input, and it produces exact results. We also present applications of the Minkowski-sum computation to answer collision and(More)
Arrangements of planar curves are fundamental structures in computational geometry. Recently, the arrangement package of Cgal, the Computational Geometry Algorithms Library, has been redesigned and re-implemented exploiting several advanced programming techniques. The resulting software package, which constructs and maintains planar arrangements, is easier(More)
In this paper a Web architecture for 3D content delivery is presented. The architecture is based on a progressive compression representation integrated into the X3D framework. The architecture is designed to enhance the Internet user experience by delivering 3D content quickly, reliably, and with high quality. The progressive compressed stream enables(More)
We introduce a general framework for sweeping a set of curves embedded on a two-dimensional parametric surface. We can handle planes, cylinders, spheres, tori, and surfaces homeomorphic to them. A major goal of our work is to maximize code reuse by generalizing the prevalent sweep-line paradigm and its implementation so that it can be employed on a large(More)
Why should wait for some days to get or receive the cgal arrangements and their applications a step by step guide book that you order? Why should you take it if you can get the faster one? You can find the same book that you order right here. This is it the book that you can receive directly after purchasing. This cgal arrangements and their applications a(More)
Assembly partitioning with an infinite translation is the application of an infinite translation to partition an assembled product into two complementing subsets of parts, referred to as subassemblies, each treated as a rigid body. We present an exact implementation of an efficient algorithm to obtain such a motion and subassemblies given an assembly of(More)
We present an exact imp ementation of an efficient algorithm that computes Minkowski sums of convex polyhedra in R<sup>3</sup>. Our implementation is complete in the sense that it does not assume general position, namely, it can handle degenerate input, and produces exact results. Our software also includes applications of the Minkowski-sum computation to(More)
We describe the algorithms and implementation details involved in the concretizations of a generic framework that enables exact construction, maintenance, and manipulation of arrangements embedded on certain two-dimensional orientable parametric surfaces in three-dimensional space. The fundamentals of the framework are described in a companion paper. Our(More)
Arrangements of planar curves are fundamental structures in computational geometry. We describe the recent developments in the arrangement package of Cgal, the Computational Geometry Algorithms Library, making it easier to use, to extend and to adapt to a variety of applications. This improved flexibility of the code does not come at the expense of(More)