Accurate Minkowski sum approximation of polyhedral models

Graphical Models

Volumn 68, Issue 4, 2006, Pages 343-355

  Varadhan, Gokul ^a   Manocha, Dinesh ^a  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

Computer aided design; Configuration space; Minkowski sum; Offset

Indexed keywords

ALGORITHMS; COMPUTER AIDED DESIGN; FEATURE EXTRACTION; MATHEMATICAL MODELS; MOTION PLANNING; OPTICAL RESOLVING POWER; PROBLEM SOLVING;

CONFIGURATION SPACE; MINKOWSKI SUM; OFFSET;

THREE DIMENSIONAL COMPUTER GRAPHICS;

ALGORITHM; COMPUTER AIDED DESIGN; NUMERICAL METHOD; THREE-DIMENSIONAL MODELING;

EID: 33745806166     PISSN: 15240703     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.gmod.2005.11.003     Document Type: Article

References (26)

1. Abrams S., and Allen P. Computing swept volumes. J. Vis. Comput. Anim. (2000) 11
2. Aronov B., Sharir M., and Tagansky B. The union of convex polyhedra in three dimensions. SIAM J. Comput. 26 (1997) 1670-1688
3. J. Basch, L. Guibas, G. Ramkumar, L. Ramshaw, Polyhedral tracings and their convolutions, in: Proc. Workshop on the Algorithmic Foundations of Robotics, 1996.
4. J.-D. Boissonnat, E. de Lange, M. Teillaud, Minkowski operations for satellite antenna layout, in: Symposium on Computational Geometry, 1997, pp. 67-76.
5. B. Chazelle, Convex decompositions of polyhedra, in: ACM Symposium on Theory of Computing, 1981, pp. 70-79.
6. Chazelle B., Dobkin D., Shouraboura N., and Tal A. Strategies for polyhedral surface decomposition: an experimental study. Comput. Geom. Theory Appl. 7 (1997) 327-342
7. Dobkin D., Hershberger J., Kirkpatrick D., and Suri S. Computing the intersection-depth of polyhedra. Algorithmica 9 (1993) 518-533
8. Ehmann S., and Lin M.C. Accurate and fast proximity queries between polyhedra using convex surface decomposition. Comput. Graph. Forum (Proc. of Eurographics'2001) 20 3 (2001) 500-510
9. R.C. Evans, M.A. O'Connor, J.R. Rossignac, Construction of minkowski sums and derivatives morphological combinations of arbitrary polyhedra in cad/cam systems, US Patent 5159512, 1992.
10. E. Flato, D. Halperin, Robust and efficient construction of planar minkowski sums, in: Abstracts 16th European Workshop Comput. Geom., Eilat, 2000, pp. 85-88.
11. P. Ghosh, A unified computational framework for minkowski operations, in: Computers and Graphics, 17(4), 1993, pp. 357-378.
12. Guibas L., and Seidel R. Computing convolutions by reciprocal search. Discrete Comput. Geom. 2 (1987) 175-193
13. Halperin D. Robust geometric computing in motion. Int. J. Robotics Res. 21 3 (2002)
14. Ju T., Losasso F., Schaefer S., and Warren J. Dual contouring of hermite data. ACM Trans. Grap. (Proc. SIGGRAPH) 21 3 (2002)
15. A. Kaul, J. Rossignac, Solid-interpolating deformations: construction and animation of PIPs, in: W. Purgathofer (Ed.), Eurographics '91, North-Holland, 1991, pp. 493-505.
16. Y.J. Kim, M.A. Otaduy, M.C. Lin, D.Manocha, Fast penetration depth computation using rasterization hardware and hierarchical refinement, in: Proc. of Workshop on Algorithmic Foundations of Robotics, 2002.
17. L. Kobbelt, M. Botsch, U. Schwanecke, H.P. Seidel, Feature-sensitive surface extraction from volume data, in: Proc. of ACM SIGGRAPH, 2001, pp. 57-66.
18. 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
19. W.E. Lorensen, H.E. Cline, Marching cubes: a high resolution 3D surface construction algorithm, in: Computer Graphics (SIGGRAPH '87 Proceedings), vol. 21, 1987, pp. 163-169.
20. Lozano-Pérez T. Spatial planning: a configuration space approach. IEEE Trans. Comput. C-32 (1983) 108-120
21. Rossignac J., and Requicha A. Offsetting operations in solid modeling. Comput. Aided Geom. Design 3 (1986) 129-148
22. Seong J.-K., Kim M.-S., and Sugihara K. The minkowski sum of two simple surfaces generated by slope-monotone closed curves. Geom. Model. Process. Theory Appl. (2002)
23. Serra J. Image Analysis and Mathematical Morphology (1982), Academic Press, London, UK
24. G. Varadhan, S. Krishnan, Y.J. Kim, S. Diggavi, D. Manocha. Efficient max-norm distance computation and reliable voxelization, in: Eurographics Symposium on Geometry Processing, 2003.
25. G. Varadhan, S. Krishnan, T. Sriram, D. Manocha, A simple algorithm for complete motion planning of translating polyhedral robots. Technical report, Workshop on Algorithmic Foundations of Robotics, 2004.
26. G. Varadhan, S. Krishnan, T. Sriram, D. Manocha, Topology preserving isosurface extraction using adaptive subdivision. Technical report, Eurographics Symposium on Geometry Processing, 2004.