Interactive Hausdorff distance computation for general polygonal models

ACM Transactions on Graphics

Volumn 28, Issue 3, 2009, Pages

  Tang, Min ^a   Lee, Minkyoung ^a   Kim, Young J ^a  

^a Ewha Womans University   (South Korea)

Author keywords

Dynamics simulation; Hausdorff distance; Penetration depth; Shape similarity

Indexed keywords

BOUNDING-VOLUME HIERARCHY; DISTANCE BOUND; DYNAMICS SIMULATION; ERROR BOUND; HAUSDORFF DISTANCE; IMPLEMENTATION COMPLEXITY; INPUT MODELS; INTERACTIVE RATES; ORDER OF MAGNITUDE; PENETRATION DEPTH; PHYSICALLY-BASED ANIMATION; POLYGONAL MODELS; SHAPE SIMILARITY; SIMPLE ALGORITHM; SUBDIVISION SCHEMES; VORONOI;

ANIMATION; COMPUTATIONAL COMPLEXITY; DISTANCE MEASUREMENT; SIMULATORS;

APPROXIMATION ALGORITHMS;

EID: 70349656317     PISSN: 07300301     EISSN: 15577368     Source Type: Journal    
DOI: 10.1145/1531326.1531380     Document Type: Conference Paper

References (38)

1. AGARWAL, P. K., S.HAR-PELED, SHARIR, M., AND WANG, Y. 2003. Hausdorff distance under translation for points, disks, and balls. In Proc. 19th Annu. ACM Sympos. Comput. Geom., 282-291.
2. ALEXA, M., BEHR, J., COHEN-OR, D., FLEISHMAN, S., LEVIN, D., AND SILVA, C. T. 2003. Computing and rendering point set surfaces. IEEE Transactions on Visualization and Computer Graphics 9, 1, 3-15.
3. ALT, H., AND GUIBAS, L. J. 2000. Discrete geometric shapes: Matching, interpolation, and approximation. In Handbook of 3http://www.havok.com/ Computational Geometry, J.-R. Sack and J. Urrutia, Eds. Elsevier Science Publishers B.V. North-Holland, Amsterdam, 121-153.
4. ALT, H., BEHRENDS, B., AND BLöMER, J. 1995. Approximate matching of polygonal shapes. Ann. Math. Artif. Intell. 13, 251-266.
5. ALT, H., BRASS, P., GODAU, M., KNAUER, C., AND WENK, C. 2003. Computing the Hausdorff distance of geometric patterns and shapes. In Discrete and Computational Geometry., vol.25. 65-76.
6. ASPERT, N., SANTA-CRUZ, D., AND EBRAHIMI, T. 2002. Mesh: Measuring errors between surfaces using the hausdorff distance. In Proceedings of the IEEE International Conference on Multimedia and Expo, 705-708.
7. ATALLAH, M. J. 1983. A linear time algorithm for the Hausdorff distance between convex polygons. Inf. Process. Lett. 17, 207-209.
8. CHEW, L. P., GOODRICH, M. T., HUTTENLOCHER, D. P., KEDEM, K., KLEINBERG, J. M., AND KRAVETS, D. 1997. Geometric pattern matching under Euclidean motion. Computational Geometry: Theory and Applications 7, 113-124.
9. CIGNONI, P., ROCCHINI, C., AND SCOPIGNO, R. 1998. Metro: Measuring error on simplified surfaces. Computer Graphics Forum 17, 2, 167-174.
10. COHEN, J., VARSHNEY, A., MANOCHA, D., TURK, G., WEBER, H., AGARWAL, P., BROOKS, F., AND WRIGHT, W. 1996. Simplification envelopes. In Proc. of ACM Siggraph'96, 119-128.
11. EHMANN, S., AND LIN, M. C. 2001. Accurate and fast proximity queries between polyhedra using convex surface decomposition. Computer Graphics Forum (Proc. of Eurographics'2001) 20, 3, 500-510.
12. FISHER, S., AND LIN, M. C. 2001. Fast penetration depth estimation for elastic bodies using deformed distance fields. Proc. of IEEE/RSJ International Conference on Intelligent Robots and Systems 2001.
13. GARLAND, M., AND HECKBERT, P. S. 1997. Surface simplification using quadric error metrics. In Proc. of ACM SIGGRAPH, 209-216.
14. GODAU, M. 1998. On the complexity of measuring the similarity between geometric objects in higher dimensions. PhD thesis, Freie Universität.
15. GOODRICH, M. T., MITCHELL, J. S. B., AND ORLETSKY, M. W. 1999. Approximate geometric pattern matching under rigid motions. IEEE Transactions on Pattern Analysis and Machine Intelligence 21, 37-39
16. GUENDELMAN, E., BRIDSON, R., AND FEDKIW, R. 2003. Nonconvex rigid bodies with stacking. In ACM SIGGRAPH, ACM, New York, NY, USA, 871-878.
17. GUTHE, M., BORODIN, P., AND KLEIN, R. 2005. Fast and accurate Hausdorff distance calculation between meshes. In International Conferences in Central Europe on Computer Graphics, Visualization and Computer Vision (WSCG), 41-48.
18. HIPPMANN, G. 2004. An algorithm for compliant contact between complexly shaped bodies. Multibody System Dynamics 12, 4.
19. HUTTENLOCHER, D. P., KEDEM, K., AND KLEINBERG, J. M. 1992. On dynamic Voronoi diagrams and the minimum Hausdorff distance for point sets under Euclidean motion in the plane. In ACM Symposium on Computational Geometry, 110-119.
20. HUTTENLOCHER, D. P., KEDEM, K., AND SHARIR, M. 1993. The upper envelope of Voronoi surfaces and its applications. Discrete and Computational Geometry 9, 267-291.
21. HUTTENLOCHER, D. P., KLANDERMAN, G. A., AND RUCKLIDGE, W. J. 1993. Comparing images using the Hausdorff distance. IEEE Trans. Pattern Anal. Mach. Intell. 15, 850-863.
22. JESORSKY, O., KIRCHBERG, K., FRISCHHOLZ, R., ET AL. 2001. Robust face detection using the Hausdorff distance. Lecture Notes in Computer Science, 90-95.
23. KETTNER, L., MEHLHORN, K., PION, S., SCHIRRA, S., AND YAP, C. 2008. Classroom examples of robustness problems in geometric computations. Comput. Geom. Theory Appl. 40, 1, 61-78.
24. KIM, Y. J., OTADUY, M. A., LIN, M. C., AND MANOCHA, D. 2002. Fast penetration depth computation for physically-based animation. Proc. of ACM Symposium on Computer Animation.
25. LARSEN, E., GOTTSCHALK, S., LIN, M., AND MANOCHA, D. 2000. Distance queries with rectangular swept sphere volumes. Proc. of IEEE Int. Conference on Robotics and Automation.
26. LIN, M., AND MANOCHA, D. 2003. Collision and proximity queries. In Handbook of Discrete and Computational Geometry.
27. LLANAS, B. 2005. Efficient computation of the Hausdorff distance between polytopes by exterior random covering. Comput. Optim. Appl. 30, 2, 161-194.
28. LOPEZ, M. A., AND REISNER, S. 2008. Hausdorff approximation of 3D convex polytopes. Inf. Process. Lett. 107, 2, 76-82.
29. LUEBKE, D., WATSON, B., COHEN, J., REDDY, M., AND VARSHNEY, A. 2002. Level of detail for 3D graphics. Elsevier Science Inc. New York, NY, USA.
30. MOORE, M., AND WILHELMS, J. 1988. Collision detection and response for computer animation. In Computer Graphics (SIGGRAPH '88 Proceedings), J. Dill, Ed., vol.22, 289-298.
31. NVIDIA. 2009. PhysX. http://www.nvidia.com.
32. REDON, S. 2004. Fast continuous collision detection and handling for desktop virtual prototyping. Virtual Real. 8, 1, 63-70.
33. RUCKLIDGE, W. J. 1996. Lower bounds for the complexity of the graph of the Hausdorff distance as a function of transformation. Discrete and Computational Geometry 16, 2.
34. TANG, M., AND KIM, Y. J. 2009. Deriving upper and lower bounds of Hausdorff distance for polygonal models. Tech. rep. CSE-TR-2009-2101, Ewha Womans University, Seoul, Korea.
35. VARADHAN, G., AND MANOCHA, D. 2004. Accurate Minkowski sum approximation of polyhedral models. In Pacific Graphics, 392-401.
36. WALD, I., BOULOS, S., AND SHIRLEY, P. 2007. Ray tracing deformable scenes using dynamic bounding volume hierarchies. ACM Trans. Graph. 26, 1, 6.
37. ZHANG, L., KIM, Y. J., VARADHAN, G., AND MANOCHA, D. 2007. Generalized penetration depth computation. Computer- Aided Design 39, 8, 625-638.
38. ZITOV́A, B., AND FLUSSER, J. 2003. Image registration methods: a survey. Image and Vision Computing 21, 11, 977-1000.