Point-based Minkowski sum boundary

Proceedings - Pacific Conference on Computer Graphics and Applications

Volumn , Issue , 2007, Pages 261-270

  Lien, Jyh Ming ^a  

^a GEORGE MASON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; COLOR IMAGE PROCESSING; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; COMPUTER GRAPHICS; DISTANCE MEASUREMENT; GRAPHIC METHODS; SOFTWARE PROTOTYPING;

(+ MOD 2N) OPERATION; (ALGORITHMIC) COMPLEXITY; GEOMETRIC APPLICATIONS; MINKOWSKI SUMS; PARALLELIZATION; PENETRATION DEPTHS; POINT-BASED; POINT-BASED REPRESENTATION; SOLID MODELLING; VIRTUAL PROTOTYPING (VP);

COMPUTER APPLICATIONS;

EID: 46749142142     PISSN: 15504085     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PG.2007.47     Document Type: Conference Paper

References (27)

1. B. Adams and P. Dutre. Interactive boolean operations on surfel-bounded solids. ACM Trans. Graph., 22(3):651-656, 2003.
2. M. Alexa, J. Behr, D. Cohen-Or, S. Fleishman, D. Levin, and C. T. Silva. Computing and rendering point set surfaces. IEEE Transactions on Visualization and Computer Graphics, 9(1):3-15, 2003.
3. N. M. Amato, O. B. Bayazit, L. K. Dale, C. V. Jones, and D. Vallejo. OBPRM: An obstacle-based PRM for 3D workspaces. In Robotics: The Algorithmic Perspective, pages 155-168, Natick, MA, 1998. A.K. Peters. Proc. Third Workshop on Algorithmic Foundations of Robotics (WAFR), Houston, TX, 1998.
4. J. Barraquand, L. E. Kavraki, J.-C. Latombe, T.-Y. Li, R. Motwani, and P. Raghavan. A random sampling scheme for path planning. Int. J. of Rob. Res, 16(6):759-774, 1997.
5. V. Boor, M. H. Overmars, and A. F. van der Stappen. The Gaussian sampling strategy for probabilistic roadmap planners. In Proc. IEEE Int. Conf. Robot. Autom. (ICRA), volume 2, pages 1018-1023, May 1999.
6. Y. Chen, H. Wang, D. W. Rosen, and J. Rossignac. A point-based offsetting method of polygonal meshes, 2006. ASME Journal of Computing and Information Science in Engineering, in review.
7. E. Fogel and D. Halperin. Exact and efficient construction of Minkowski sums of convex polyhedra with applications. In Proc. 8th Wrkshp. Alg. Eng. Exper. (Alenex'06), pages 3-15, 2006.
8. K. Fukuda. From the zonotope construction to the minkowski addition of convex polytopes. Journal of Symbolic Computation, 38(4):1261-1272, 2004.
9. P. K. Ghosh. A unified computational framework for minkowski operations. Computers and Graphics, 17(4):357-378, 1993.
10. S. Gottschalk, M. C. Lin, and D. Manocha. OBBTree: A hierarchical structure for rapid interference detection. Computer Graphics, 30(Annual Conference Series): 171-180, 1996.
11. P. Gritzmann and B. Sturmfels. Minkowski addition of polytopes: computational complexity and applications to grobner bases. SIAM J. Discret. Math., 6(2):246-269, 1993.
12. L. J. Guibas and R. Seidel. Computing convolutions by reciprocal search. Discrete Comput. Geom., 2:175-193, 1987.
13. P. Hachenberger and L. Kettner. Boolean operations on 3d selective nef complexes: optimized implementation and experiments. In SPM '05: Proceedings of the 2005 ACM symposium on Solid and physical modeling, pages 163-174, New York, NY, USA, 2005. ACM Press.
14. D. Halperin. Robust geometric computing in motion. The International Journal of Robotics Research, 21(3):219-232, 2002.
15. A. Kaul and J. Rossignac. Solid-interpolating deformations: construction and animation of PIPs. In Proc. Eurographics '91, pages 493-505, 1991.
16. J. Klein and G. Zachmann. Point cloud collision detection. In Computer Graphics forum (EUROGRAPHICS), pages 567-576, 2004.
17. J.-C. Latombe. Robot Motion Planning. Kluwer Academic Publishers, Boston, MA, 1991.
18. T. Lozano-Pérez. Spatial planning: A configuration space approach. IEEE Trans. Comput., C-32:108-120, 1983.
19. M. Pauly and M. Gross. Spectral processing of point-sampled geometry. In SIGGRAPH '01: Proceedings of the 28th annual conference on Computer graphics and interactive techniques, pages 379-386, New York, NY, USA, 2001. ACM Press.
20. M. Pauly, R. Keiser, and M. Gross. Multi-scale feature extraction on point-sampled surfaces. In Proceedings of the Eurographics/ACM SIGGRAPH symposium on Geometry processing, pages 281-289, 2003.
21. M. Pauly, R. Keiser, L. P. Kobbelt, and M. Gross. Shape modeling with point-sampled geometry. In SIGGRAPH '03: ACM SIGGRAPH 2003 Papers, pages 641-650, 2003.
22. M. Peternell, H. Pottmann, and T. Steiner. Minkowski sum boundary surfaces of 3d-objects. Technical report, Vienna Univ. of Technology, August 2005.
23. S. Rusinkiewicz and M. Levoy. Qsplat: a multiresolution point rendering system for large meshes. In SIGGRAPH '00: Proceedings of the 27th annual conference on Computer graphics and interactive techniques, pages 343-352, New York, NY, USA, 2000. ACM Press/Addison-Wesley Publishing Co.
24. J. Serra, editor. Image Analysis and Mathematical Morphology, volume 2: Theoretical Advances. Academic Press, New York 1988
25. R. Shekhar, E. Fayyad, R. Yagel, and J. F. Cornhill. Octree-based decimation of marching cubes surfaces. In VIS '96: Proceedings of the 7th conference on Visualization '96, pages 335-ff., Los Alamitos, CA, USA, 1996. IEEE Computer Society Press.
26. G. Varadhan and D. Manocha. Star-shaped roadmaps - a deterministic sampling approach for complete motion planning. In Robotics Science & Systems, 2005.
27. G. Varadhan and D. Manocha. Accurate minkowski sum approximation of polyhedral models. Graph. Models, 68(4):343-355, 2006.