Covering Minkowski sum boundary using points with applications

Computer Aided Geometric Design

Volumn 25, Issue 8, 2008, Pages 652-666

  Lien, Jyh Ming ^a  

^a NONE   (United States)

Author keywords

Geometric modeling; Minkowski sum approximation; Motion planning; Parallelization; Penetration depth estimation; Point based representation

Indexed keywords

APPLICATIONS; COMPUTATIONAL COMPLEXITY; DISTANCE MEASUREMENT; MOTION PLANNING;

GEOMETRIC MODELING; MINKOWSKI SUM APPROXIMATION; PARALLELIZATION; PENETRATION DEPTH ESTIMATION; POINT-BASED REPRESENTATION;

COMPUTATIONAL GEOMETRY;

EID: 53149148079     PISSN: 01678396     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cagd.2008.06.006     Document Type: Article

References (30)

1. Alexa M., Behr J., Cohen-Or D., Fleishman S., Levin D., and Silva C.T. Computing and rendering point set surfaces. IEEE Trans. Visualization and Computer Graphics 9 1 (2003) 3-15
2. Amato N.M., Bayazit O.B., Dale L.K., Jones C.V., and Vallejo D. OBPRM: An obstacle-based PRM for 3D workspaces. Robotics: The Algorithmic Perspective, Natick, MA, Proc. Third Workshop on Algorithmic Foundations of Robotics (WAFR). Houston, TX (1998), A.K. Peters 155-168
3. Arya S., Mount D.M., Netanyahu N.S., Silverman R., and Wu A. An optimal algorithm for approximate nearest neighbor searching in fixed dimensions. J. ACM 45 (1998) 891-923
4. Barraquand J., Kavraki L.E., Latombe J.-C., Li T.-Y., Motwani R., and Raghavan P. A random sampling scheme for path planning. Int. J. Robot. Res. 16 6 (1997) 759-774
5. Boor, V., Overmars, M.H., van der Stappen, A.F., 1999. The Gaussian sampling strategy for probabilistic roadmap planners. In: Proc. IEEE Int. Conf. Robot. Autom. (ICRA), vol. 2, May 1999, pp. 1018-1023
6. Chen, Y., Wang, H., Rosen, D.W., Rossignac, J., 2006. A point-based offsetting method of polygonal meshes. ASME Journal of Computing and Information Science in Engineering, submitted for publication
7. Fogel, E., Halperin D., 2006. Exact and efficient construction of Minkowski sums of convex polyhedra with applications. In: Proc. 8th Workshp. Alg. Eng. Exper., Alenex '06, pp. 3-15
8. Fukuda K. From the zonotope construction to the Minkowski addition of convex polytopes. J. Symbolic Comput. 38 4 (2004) 1261-1272
9. Ghosh P.K. A unified computational framework for Minkowski operations. Computers and Graphics 17 4 (1993) 357-378
10. Gottschalk, S., Lin, M.C., Manocha, D., 1996. OBBTree: A hierarchical structure for rapid interference detection. Computer Graphics, 30 (Annual Conference Series), pp. 171-180
11. Gritzmann P., and Sturmfels B. Minkowski addition of polytopes: computational complexity and applications to Gröbner bases. SIAM J. Discret. Math. 6 2 (1993) 246-269
12. Guibas L.J., and Seidel R. Computing convolutions by reciprocal search. Discrete Comput. Geom. 2 (1987) 175-193
13. Hachenberger, P., 2007. Exact Minkowksi sums of polyhedra and exact and efficient decomposition of polyhedra in convex pieces. In: Proc. 15th Annual European Symposium on Algorithms (ESA), pp. 669-680
14. Halperin D. Robust geometric computing in motion. Int. J. Robot. Res. 21 3 (2002) 219-232
15. Kaul, A., Rossignac, J., 1991. Solid-interpolating deformations: construction and animation of PIPs. In: Proc. Eurographics '91, pp. 493-505
16. Klein, J., Zachmann, G., 2004. Point cloud collision detection. In: Computer Graphics Forum (EUROGRAPHICS), pp. 567-576
17. Latombe J.-C. Robot Motion Planning (1991), Kluwer Academic Publishers, Boston, MA
18. Lien, J.-M., 2007. Approximate star-shaped decomposition of point set data. In: Proceedings of the IEEE/Eurographics Symposium on Point Based Graphics (PBG)
19. Lien, J.-M., 2007. Point-based Minkowski sum boundary. In: PG '07: Proceedings of the 15th Pacific Conference on Computer Graphics and Applications, Washington, DC, USA, IEEE Computer Society, pp. 261-270
20. Lien, J.-M., 2008. Hybrid motion planning using Minkowski sums. In: Proc. Robotics: Sci. Syst. IV, Zurich, Switzerland, http://www.roboticsproceedings.org/rss04/p13.html
21. Lozano-Pérez T. Spatial planning: A configuration space approach. IEEE Trans. Comput. C-32 (1983) 108-120
22. Pauly M., and Gross M. Spectral processing of point-sampled geometry. SIGGRAPH '01: Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques (2001), ACM Press, New York, NY 379-386
23. Pauly, M., Keiser, R., Gross, M., 2003a. Multi-scale feature extraction on point-sampled surfaces. In: Proceedings of the Eurographics/ACM SIGGRAPH Symposium on Geometry Processing, pp. 281-289
24. Pauly, M., Keiser, R., Kobbelt, L.P., Gross, M., 2003b. Shape modeling with point-sampled geometry. In: SIGGRAPH '03: ACM SIGGRAPH 2003 Papers, pp. 641-650
25. Peternell, M., Pottmann, H., Steiner, T., 2005. Minkowski sum boundary surfaces of 3d-objects, Technical report, Vienna Univ. of Technology, August
26. Rusinkiewicz S., and Levoy M. Qsplat: a multiresolution point rendering system for large meshes. SIGGRAPH '00: Proceedings of the 27th Annual Conference on Computer Graphics and Interactive Techniques (2000), ACM Press/Addison-Wesley Publishing Co, New York, NY 343-352
27. In: Serra J. (Ed). Image Analysis and Mathematical Morphology, vol. 2: Theoretical Advances (1988), Academic Press, New York
28. Shekhar R., Fayyad E., Yagel R., and Cornhill J.F. Octree-based decimation of marching cubes surfaces. Proceedings of the 7th Conference on Visualization '96. VIS '96, Los Alamitos, CA, USA (1996), IEEE Computer Society Press 335-342
29. Varadhan, G., Manocha, D., 2005. Star-shaped roadmaps - a deterministic sampling approach for complete motion planning. In: Proc. Robotics: Sci. Syst. (RSS)
30. Varadhan G., and Manocha D. Accurate Minkowski sum approximation of polyhedral models. Graph. Models 68 4 (2006) 343-355