Contributing vertices-based Minkowski sum computation of convex polyhedra

CAD Computer Aided Design

Volumn 41, Issue 7, 2009, Pages 525-538

  Barki, Hichem ^a   Denis, Florence ^a   Dupont, Florent ^a  

^a UNIVERSITÉ LYON 1   (France)

Author keywords

Computer aided design; Contributing vertices; Convex hull; Minkowski sum; Slope diagram

Indexed keywords

COMPUTATIONAL GEOMETRY; IMAGE PROCESSING; MATHEMATICAL MORPHOLOGY; ROBOT PROGRAMMING;

COMPUTATIONAL GEOMETRY ALGORITHMS; CONTRIBUTING VERTICES; CONVEX HULL; CONVEX POLYHEDRONS; MINKOWSKI SUM; SLOPE DIAGRAM; SPATIAL PLANNING; STEREOGRAPHIC PROJECTION;

COMPUTER AIDED DESIGN;

EID: 67349273728     PISSN: 00104485     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cad.2009.03.008     Document Type: Article

References (39)

1. Ghosh P. A unified computational framework for Minkowski operations. Comput Graph 17 4 (1993) 357-378
2. Lee I.-K., Kim M.-S., and Elber G. Polynomial/rational approximation of Minkowski sum boundary curves. Graph Models Image Process 60 2 (1998) 136-165
3. Kaul A., and Rossignac J. Solid-interpolating deformations: Construction and animation of PIPs. Comput Graph 16 1 (1992) 107-115
4. Serra J. Image analysis and mathematical morphology vol. 1 (1982), Academic Press, London
5. Serra J. Image analysis and mathematical morphology vol. 2 (1988), Academic Press, New York
6. Tuzikov A., Roerdink J., and Heijmans H. Similarity measures for convex polyhedra based on Minkowski addition. Pattern Recognit 33 (2000) 979-995
7. Kim Y, Otaduy M, Lin M, Manocha D. Fast penetration depth estimation using rasterization hardware and hierarchical refinement. In: SCG'03: Proc. of the nineteenth annual symposium on computational geometry. 2003 p. 386-7
8. Lozano-Pérez T. Spatial planning: A configuration space approach. IEEE Trans Comput 32 2 (1983) 108-120
9. Ghosh P., and Kumar K. Support function representation of convex bodies, its application in geometric computing, and some related representations. Comput Vis Image Underst 72 3 (1998) 379-403
10. Barber C.B., Dobkin D., and Huhdanpaa H. The quickhull algorithm for convex hulls. ACM Trans Math Softw 22 4 (1996) 469-483
11. Seidel R. Output-size sensitive algorithms for constructive problems in computational geometry. Ph.D. thesis, Ithaca, (NY) USA: Faculty of the Graduate School, 1987
12. d. Inf Process Lett 19 4 (1984) 197
13. Chand D., and Kapur S. An algorithm for convex polytopes. J ACM 17 1 (1970) 78-86
14. Preparata F., and Hong S. Convex hulls of finite sets of points in two and three dimensions. Commun ACM 20 2 (1977) 87-93
15. Graham R. An efficient algorithm for determining the convex hull of a finite planar set. Inf Process Lett 1 4 (1972) 132-133
16. O'Rourke J. Computational geometry in C. 2nd edition (1998), Cambridge University Press, New York (NY) USA
17. Chazelle B. Convex decompositions of polyhedra. In: STOC'81: Proc. of the thirteenth annual ACM symposium on theory of computing. 1981. p. 70-9
18. Chazelle B., Dobkin D., Shouraboura N., and Tal A. Strategies for polyhedral surface decomposition: An experimental study. Comput Geom Theory Appl 7 5-6 (1997) 327-342
19. Aronov B., Sharir M., and Tagansky B. The union of convex polyhedra in three dimensions. SIAM J Comput 26 6 (1997) 1670-1688
20. Halperin D. Robust geometric computing in motion. Int J Robotics Res 21 3 (2002) 219-232
21. Dobkin D., Hershberger J., Kirkpatrick D., and Suri S. Computing the intersection-depth of polyhedra. Algorithmica 9 (1993) 518-533
22. The CGAL project homepage. http://www.cgal.org
23. Nef W. Beiträge zur theorie der polyeder. 1978
24. Hachenberger P., Kettner L., and Mehlhorn K. Boolean operations on 3D selective nef complexes: Data structure, algorithms, optimized implementation and experiments. Comput Geom Theory Appl 38 1-2 (2007) 64-99
25. Hachenberger P, Kettner L. Boolean operations on 3D selective nef complexes: Optimized implementation and experiments. In: SPM'05: Proc. of the 2005 ACM symposium on solid and physical modeling. 2005. p. 163-74
26. Hachenberger P. Exact Minkowski sums of polyhedra and exact and efficient decomposition of polyhedra in convex pieces. In: Proc. 15th annual European symposium on algorithms, 2007, p. 669-80
27. Varadhan G., and Manocha D. Accurate Minkowski sum approximation of polyhedral models. Graph Models 68 4 (2006) 343-355
28. Varadhan G, Krishnan S, Sriram T, Manocha D. Topology preserving surface extraction using adaptive subdivision. In: SGP'04: Proc. of the 2004 Eurographics/ACM SIGGRAPH symposium on geometry processing. 2004. p. 235-244
29. Lien J.-M. Point-based Minkowski sum boundary. PG'07: Proc. of the 15th pacific conference on computer graphics and applications (PG'07) (2007), IEEE Computer Society, Washington, (DC) USA 261-270
30. Guibas LJ, Ramshaw L, Stolfi L. A kinetic framework for computational geometry. In: Proc. of 24th annual IEEE symposium on the foundation of computer science, 1983. p. 100-11
31. Guibas L., and Seidel R. Computing convolutions by reciprocal search. Discrete Comput Geom 2 (1987) 175-193
32. Basch J, Guibas L, Ramkumar G, Ramshaw L. Polyhedral tracings and their convolution. In: Proc. of 2nd workshop on the algorithmic foundations of robotics, 1996. p. 171-84
33. Bekker H, Roerdink J. An efficient algorithm to calculate the Minkowski sum of convex 3D polyhedra. In: ICCS'01: Proc. of the international conference on computational sciences-Part I. 2001. p. 619-28
34. Wu Y., Shah J., and Davidson J. Improvements to algorithms for computing the Minkowski sum of 3-polytopes. Comput Aided Des 35 13 (2003) 1181-1192
35. Fogel E., and Halperin D. Exact and efficient construction of Minkowski sums of convex polyhedra with applications. Comput Aided Des 39 11 (2007) 929-940
36. The GNU MP bignum library. http://gmplib.org/
37. Fabri A, Pion S. A generic lazy evaluation scheme for exact geometric computations. In: Proc. 2nd library-centric software design, 2006
38. Weibel C. Minkowski sums. http://roso.epfl.ch/cw/poly/public.php
39. Fukuda K. From the zonotope construction to the minkowski addition of convex polytopes. J Symbolic Comput 38 4 (2004) 1261-1272