Anisotropic geodesic distance computation for parametric surfaces

IEEE International Conference on Shape Modeling and Applications 2008, Proceedings, SMI

Volumn , Issue , 2008, Pages 179-186

  Seong, Joon Kyung ^a   Jeong, Won Ki ^a   Cohen, Elaine ^a  

^a UNIVERSITY OF UTAH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CURVATURE TENSORS; DISTANCE MAPS; INTERNATIONAL CONFERENCES; PARAMETRIC SURFACES; SHAPE MODELLING;

ANISOTROPY; APPLICATIONS; LADDER NETWORKS; MAPS; PARAMETRIC DEVICES; TENSORS;

SURFACE PROPERTIES;

EID: 50949117664     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SMI.2008.4547968     Document Type: Conference Paper

References (44)

1. D. C. Alexander and J. C. Gee. Elastic matching of diffusion tensor images. Comput. Vis. Image Underst., 77(9):233-250, 2000.
2. M. Ankerst, G. Kastenmller, H.-P. Kriegel, and T. Seidl. 3d shape histograms for similarity search and classification in spatial databases. In SSD '99: Proceedings of the 6th International Symposium on Advances in Spatial Databases, pages 207-226, London, UK, 1999. Springer-Verlag.
3. S. Belongie, J. Malik, and J. Puzicha. Matching shapes. iccv, 01:454, 2001.
4. F. Bornemann and C. Rasch. Finite-element discretization of static hamilton-jacobi equations based on a local variational principle. Computing and Visualization in Science, 9(2):57-69, 2006.
5. A. M. Bronstein, M. M. Bronstein, Y. S. Devir, and R. Kimmel. Parallel algorithms for approximation of distance maps on parametric surfaces. Technical Report, 2007.
6. D.-Y. Chen, M. Ouhyoung, X.-P. Tian, Y.-T. Shen, and M. Ouhyoung. On visual similarity based 3d model retrieval. In Eurographics, pages 223-232, Granada, Spain, 2003.
7. J. Chen and Y. Han. Shortest paths on a polyhedron. Int. J. Comput. Geom. & Appl., 6(2):127-144, 1990.
8. S.-W. Cheng, H.-S. Na, A. Vigneron, and Y. Wang. Approximate shortest paths in anisotropic regions. In SODA '07: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, pages 766-774, Philadelphia, PA, USA, 2007. Society for Industrial and Applied Mathematics.
9. Q. Du and D. Wang. Anisotropic centroidal voronoi tessellations and their applications. SIAM J. Sci. Comput., 26(3):737-761, 2005.
10. A. Elad and R. Kimmel. On bending invariant signatures for surfaces. IEEE Transactions on Pattern Analysis and Machine Intelligence, 25(10):1285-1295, 2003.
11. T. Funkhouser, M. Kazhdan, P. Shilane, P. Min, W. Kiefer, A. Tal, S. Rusinkiewicz, and D. Dobkin. Modeling by example. ACM Trans. Graph., 23(3):652-663, 2004.
12. T. Funkhouser and P. Shilane. Partial matching of 3d shapes with priority-driven search. In In Proceedings of Symposium on Geometry Processing, pages 131-142, 2006.
13. R. Gal and D. Cohen-Or. Salient geometric features for partial shape matching and similarity. ACM Trans. Graph., 25(1):130-150, 2006.
14. L. Guillaume, D. Florent, and B. Atilla. Curvature tensor based triangle mesh segmentation with boundary rectification. In CGI '04: Proceedings of the Computer Graphics International (CGI'04), pages 10-17, Washington, DC, USA, 2004. IEEE Computer Society.
15. M. Hilaga, Y. Shinagawa, T. Kohmura, and T. L. Kunii. Topology matching for fully automatic similarity estimation of 3d shapes. In SIGGRAPH '01: Proceedings of the 28th annual conference on Computer graphics and interactive techniques, pages 203-212, New York, NY, USA, 2001. ACM.
16. M. Hofer and H. Pottmann. Energy-minimizing splines in manifolds. ACM Trans. Graph., 23(3):284-293, 2004.
17. S. Iyanaga and Y. Kawada. Finsler Spaces. MIT Press, 1980.
18. W.-K. Jeong, P. T. Fletcher, R. Tao, and R. Whitaker. Interactive visualization of volumetric white matter connectivity in DT-MRI using a parallel-hardware Hamilton-Jacobi solver. IEEE Transactions on Visualization and Computer Graphics, 13(6):1480-1487, 2007.
19. A. E. Johnson and M. Hebert. Using spin images for efficient object recognition in cluttered 3d scenes. IEEE Transactions on Pattern Analysis and Machine Intelligence, 21(5):433-449, 1999.
20. T. Kanai and H. Suzuki. Approximate shortest path on polyhedral surface based on selective refinement of the discrete graph and its applications. gmp, 00:241, 2000.
21. S. Katz and A. Tal. Hierarchical mesh decomposition using fuzzy clustering and cuts. In SIGGRAPH '03: ACM SIGGRAPH 2003 Papers, pages 954-961, New York, NY, USA, 2003. ACM.
22. M. Kazhdan, T. Funkhouser, and S. Rusinkiewicz. Shape matching and anisotropy. In SIGGRAPH '04: ACM SIGGRAPH 2004 Papers, pages 623-629, New York, NY, USA, 2004. ACM Press.
23. R. Kimmel and J. Sethian. Computing geodesic paths on manifolds. In Proceedings of National Academy of Sciences, pages 8431-8435, 1998.
24. A. P. Mangan and R. T. Whitaker. Partitioning 3d surface meshes using watershed segmentation. IEEE Transactions on Visualization and Computer Graphics, 5(4):308-321, 1999.
25. J. S. B. Mitchell, D. M. Mount, and C. H. Papadimitriou. The discrete geodesic problem. SIAM J. Comput., 16(4):647-668, 1987.
26. D. L. Page, A. F. Koschan, and M. A. Abidi. Perception-based 3d triangle mesh segmentation using fast marching watersheds. cvpr, 02:27, 2003.
27. G. Peyré and L. D. Cohen. Geodesic remeshing using front propagation. Int. J. Comput. Vision, 69(1):145-156, 2006.
28. E. Pichon, C.-F. Westin, and A. Tannenbaum. A Hamilton-Jacobi-Bellman approach to high angular resolution diffusion tractography. In MICCAI, pages 180-187, 2005.
29. E. Prados, S. Soatto, C. Lenglet, J.-P. Pons, N. Wotawa, R. Deriche, and O. Faugeras. Control theory and fast marching techniques for brain connectivity mapping. In CVPR '06: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, pages 1076-1083, 2006.
30. A. Razdan and M. Bae. A hybrid approach to feature segmentation of triangle meshes. Computer-Aided Design, 35(9):783-789, 2003.
31. J. H. Reif and Z. Sun. Movement planning in the presence of flows. Algorithmica, 39(2):127-153, 2004.
32. J. Sellen. Direction weighted shortest path planning. In In Proceedings of the International Conference on Robotics and Automation, pages 1970-1975, 1995.
33. J. Sethian. A fast marching level set method for monotonically advancing fronts. In Proc. Natl. Acad. Sci., volume 93, pages 1591-1595, February 1996.
34. J. A. Sethian and A. M. Popovici. 3-d traveltime computation using the fast marching method. Geophysics, 64(2):516-523, 2006.
35. J. A. Sethian and A. Vladimirsky. Ordered upwind methods for static Hamilton-Jacobi equations: Theory and algorithms. SIAM J. Numer. Anal., 41(1):325-363, 2003.
36. J. A. Sethian and A. Vladimirsky. Ordered upwind methods for static Hamilton-Jacobi equations: Theory and algorithms. SIAM Journal of Numerical Analysis, 41(1):325-363, 2003.
37. O. Sifri, A. Sheffer, and C. Gotsman. Geodesic-based surface remeshing. In In Proc. 12th International Meshing Roundtable, pages 189-199, 2003.
38. S. S. Skiena. The algorithm design manual. Springer, 2000.
39. P.-P. J. Sloan, I. Charles F. Rose, and M. F. Cohen. Shape by example. In I3D '01: Proceedings of the 2001 symposium on Interactive 3D graphics, pages 135-143, New York, NY, USA, 2001. ACM.
40. V. Surazhsky, T. Surazhsky, D. Kirsanov, S. J. Gortler, and H. Hoppe. Fast exact and approximate geodesics onmeshes. ACMTrans. Graph., 24(3):553-560, 2005.
41. Y.-H. R. Tsai, L.-T. Cheng, S. Osher, and H.-K. Zhao. Fast sweeping algorithms for a class of Hamilton-Jacobi equations. SIAM Journal of Numerical Analysis, 41(2):659-672, 2003.
42. H. Yamauchi, S. Gumhold, R. Zayer, and H.-P. Seidel. Mesh segmentation driven by gaussian curvature. The Visual Computer, 21(8-10):659-668, 2005.
43. Y. Zhang, J. PAIK, A. Koschan, M. Abidi, and D. Gorsich. A simple and efficient algorithm for part decomposition of 3d triangulated models based on curvature analysis. In IEEE International conference on Image Processing, pages 273-276, 2002.
44. K. Zhou, J. Synder, B. Guo, and H.-Y. Shum. Iso-charts: stretch-driven mesh parameterization using spectral analysis. In SGP '04: Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing, pages 45-54, New York, NY, USA, 2004. ACM.