Accurate minkowski sum approximation of polyhedral models

Proceedings - Pacific Conference on Computer Graphics and Applications

Volumn , Issue , 2004, Pages 392-401

  Varadhan, Gokul ^a   Manocha, Dinesh ^a  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY PROCESSING; ISOSURFACE RECONSTRUCTION; POLYHEDRAL MODELS; VOLUMETRIC GRIDS;

ALGORITHMS; APPROXIMATION THEORY; CALCULATIONS; IMAGE PROCESSING; STATISTICAL METHODS;

MATHEMATICAL MODELS;

EID: 17444395597     PISSN: 15504085     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PCCGA.2004.1348370     Document Type: Conference Paper

References (26)

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