Exact Minkowski of sums of convex polyhedra

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2005, Pages 382-383

  Fogel, Efi ^a   Halperin, Dan ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Arrangements; CGAL; Minkowski sums; Robustness and precision

Indexed keywords

COMPUTATIONAL GEOMETRY; QUERY LANGUAGES; ROBUSTNESS (CONTROL SYSTEMS);

ARRANGEMENTS; CGAL; MINKOWSKI SUMS; ROBUSTNESS AND PRECISION;

ALGORITHMS;

EID: 33244495078     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1064092.1064157     Document Type: Conference Paper

References (6)

1. The CGAL project homepage. http://www.cgal.org/.
2. The GNU MP bignum library. http://www.swox.com/gmp/.
3. E. Fogel and D. Halperin. Exact and efficient construction of Minkowski sums of convex polyhedra with applications. Manuscript, Tel Aviv University, http://www.cs.tau.ac.il/~efif/CD/exact_mink.3d.pdf, 2005.
4. E. Fogel, R. Wein, and D. Halperin. Code flexibility and program efficiency by genericity: Improving CGAL'S arrangements. In Proc. 12th Annu. Euro. Sympos. Alg., volume 3221, pages 664-676. Springer-Verlag, 2004.
5. L. Kettner. Using generic programming for designing a data structure for polyhedral surfaces. Comput. Geom. Theory Appl., 13:65-90, 1999.
6. M. G. Lin and D. Manocha. Collision and proximity queries. In J. E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, 2nd Edition, chapter 35, pages 787-807. CRC, 2004.