Contributing vertices-based minkowski sum of a non-convex polyhedron without fold and a convex polyhedron

2009 IEEE International Conference on Shape Modeling and Applications, SMI 2009

Volumn , Issue , 2009, Pages 73-80

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

^a UNIVERSITÉ LYON 1   (France)

Author keywords

3D envelope computation; Contributing vertices; Minkowski sum

Indexed keywords

COMPUTATIONAL GEOMETRY ALGORITHMS; CONTRIBUTING VERTICES; CONVEX DECOMPOSITION; CONVEX POLYHEDRONS; EXACT RESULTS; MINKOWSKI SUM; ORTHOGONAL BASIS VECTORS; ORTHOGRAPHIC PROJECTIONS;

COMPUTATIONAL GEOMETRY;

EID: 70449552890     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SMI.2009.5170166     Document Type: Conference Paper

References (24)

1. I-K Lee, M-S Kim, G Elber. Polynomial/rational approximation of Minkowski sum boundary curves. Graph. Models Image Process. 1998, 60(2): 136-165.
2. A Kaul, J Rossignac. Solid-interpolating deformations: construction and animation of PIPs. Comput. Graph. 1992, 16(1): 107-115.
3. J Serra. Image Analysis and Mathematical Morphology. Vol.2. New York: Academic Press, 1988.
4. T Lozano-Ṕerez. Spatial planning: a configuration space approach. IEEE Trans. Comput. 1983, 32(2): 108-120.
5. B Chazelle. Convex decompositions of polyhedra. In: STOC '81: Proc. of the Thirteenth Annual ACM Symposium on Theory of Computing, ACM, New York: NY, USA, 1981: 70-79.
6. H Barki, F Denis, F Dupont. Contributing verticesbased Minkowski sum computation of convex polyhedra. In revision, Comput. Aided Des..
7. D Halperin. Robust geometric computing in motion. Int. J. Robotics Res. 2002, 21(3): 219-232.
8. B Aronov, M Sharir, B Tagansky. The union of convex polyhedra in three dimensions. SIAM J. Comput. 1997, 26(6): 1670-1688.
9. R Evans, M O'Connor, J Rossignac. Construction of Minkowski sums and derivatives morphological combinations of arbitrary polyhedra in CAD/CAM systems. US Patent 5159512, 1992.
10. P Hachenberger. Exact Minkowski sums of polyhedra and exact and efficient decomposition of polyhedra in convex pieces. In: Proc. 15th Annual European Symposium on Algorithms, 2007: 669-680.
11. P Hachenberger, L Kettner, K Mehlhorn. Boolean operations on 3d selective Nef complexes: data structure, algorithms, optimized implementation and experiments. Comput. Geom. Theory Appl. 2007, 38(1-2): 64-99.
12. G Varadhan, D Manocha. Accurate Minkowski sum approximation of polyhedral models. Graph. Models 2006, 68(4): 343-355.
13. J-M Lien. Point-based Minkowski sum boundary. In: PG '07: Proc. of the 15th Pacific Conference on Computer Graphics and Applications (PG'07), IEEE Computer Society, Washington, DC, USA, 2007: 261-270.
14. P Ghosh. A unified computational framework for Minkowski operations. Comput. Graph. 1993, 17(4): 357-378.
15. H Bekker, J Roerdink. 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, Springer- Verlag, London, UK, 2001: 619-628.
16. Y Wu, , J Shah, J Davidson. Improvements to algorithms for computing the Minkowski sum of 3-polytopes. Comput. Aided Des. 2003, 35(13): 1181-1192.
17. E Fogel, D Halperin. Exact and efficient construction of Minkowski sums of convex polyhedra with applications. Comput. Aided Des. 2007, 39(11):929-940. (Pubitemid 47539371)
18. L J Guibas, L Ramshaw, L Stolfi. A kinetic framework for computational geometry. In: Proc. of 24th annual IEEE Symposium on the Foundation of Computer Science, 1983: 100-111.
19. L Guibas, R Seidel. Computing convolutions by reciprocal search. Discrete Comput. Geom. 1987, 2: 175-193.
20. J Basch, L Guibas, G Ramkumar, L Ramshaw. Polyhedral tracings and their convolution. In: Proc. of 2nd Workshop on the Algorithmic Foundations of Robotics, 1996: 171-184.
21. M Meyerovitch. Robust, generic and efficient construction of envelopes of surfaces in threedimensional space. In: Proc. 14th Annual European Symposium on Algorithms (ESA), Vol.4168 of LNCS, Springer-Verlag, 2006: 792-803.
22. The CGAL project homepage. http://www.cgal.org/.
23. The GNU MP bignum library. http://gmplib.org/.
24. A Fabri, S Pion. A generic lazy evaluation scheme for exact geometric computations. In: Proc. 2nd Library-Centric Software Design, 2006.