Walking on broken mesh: Defect-tolerant geodesic distances and parameterizations

Computer Graphics Forum

Volumn 30, Issue 2, 2011, Pages 623-632

  Campen, Marcel ^a   Kobbelt, Leif ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER GRAPHICS; REPAIR;

COMPUTATIONAL FRAMEWORK; CONNECTED COMPONENT; DEFECT TOLERANT; GEODESIC DISTANCE FIELD; GEODESIC DISTANCES; INTRINSIC DISTANCES; MEMORY EFFICIENCY; SURFACE REPRESENTATION;

GEODESY;

EID: 84862003981     PISSN: 01677055     EISSN: 14678659     Source Type: Journal    
DOI: 10.1111/j.1467-8659.2011.01896.x     Document Type: Conference Paper

References (43)

1. ANDÚJAR C., BRUNET P., AYALA D.: Topology-reducing surface simplification using a discrete solid representation. ACM Trans. Graph. 21, 2 (2002), 88-105.
2. BRONSTEIN A. M., BRONSTEIN M. M., KIMMEL R.: Efficient computation of isometry-invariant distances between surfaces. SIAM J. Scientific Computing 28, 5 (2006), 1812-1836.
3. BISCHOFF S., KOBBELT L.: Structure preserving cad model repair. Comput. Graph. Forum 24, 3 (2005), 527-536.
4. BOMMES D., KOBBELT L.: Accurate computation of geodesic distance fields for polygonal curves on triangle meshes. In Proc. VMV (2007), pp. 151-160.
5. BÜRGER K., KRÜGER J., WESTERMANN R.: Sample-based surface coloring. IEEE Transactions on Visualization and Computer Graphics 16, 5 (2010), 763-776.
6. BIERMANN H., MARTIN I. M., BERNARDINI F., ZORIN D.: Cut-and-paste editing of multiresolution surfaces. In SIGGRAPH '02 (2002), pp. 312-321.
7. BISCHOFF S., PAVIC D., KOBBELT L.: Automatic restoration of polygon models. ACM Trans. Graph. 24, 4 (2005), 1332-1352.
8. BERNSTEIN M., SILVA V. D., LANGFORD J. C., TENENBAUM J. B.: Graph Approximations to Geodesics on Embedded Manifolds. Tech. rep., Stanford University, 2000.
9. BORODIN P., ZACHMANN G., KLEIN R.: Consistent normal orientation for polygonal meshes. In CGI '04: Proc. Computer Graphics International (2004), pp. 18-25.
10. COX T., COX M.: Multidimensional Scaling. Chapman and Hall, 1994.
11. CHEN J., HAN Y.: Shortest paths on a polyhedron. In SCG '90: Proc. Symp. Comp. Geom. (1990), pp. 360-369.
12. DO CARMO M. P.: Differential Geometry of Curves and Surfaces. Prentice-Hall, Englewood Cliffs, NJ, 1976.
13. DESCHAMPS T., COHEN L. D.: Minimal paths in 3d images and application to virtual endoscopy. In ECCV 2000, Proc. Europ. Conf. on Computer Vision (2000), pp. 543-557.
14. ELAD A., KIMMEL R.: On bending invariant signatures for surfaces. IEEE Trans. PAMI 25 (2003), 1285-1295.
15. FRISKEN S. F., PERRY R. N.: Simple and efficient traversal methods for quadtrees and octrees. Journal of Graphics Tools 7, 7 (2002), 2002.
16. GATZKE T., GRIMM C., GARLAND M., ZELINKA S.: Curvature maps for local shape comparison. In Shape Modeling International (2005), pp. 244-256.
17. GROSSMANN R., KIRYATI N., KIMMEL R.: Computational surface flattening: A voxel-based approach. IEEE Trans. PAMI 24 (2002), 433-441.
18. HASSOUNA M. S., FARAG A. A.: Multistencils fast marching methods: A highly accurate solution to the eikonal equation on cartesian domains. IEEE Transactions on Pattern Analysis and Machine Intelligence 29 (2007), 1563-1574.
19. JU T.: Fixing geometric errors on polygonal models: A survey. J. Comput. Sci. Technol. 24, 1 (2009), 19-29.
20. KIRYATI N., SZÉKELY G.: Estimating shortest paths and minimal distances on digitized three-dimensional surfaces. Pattern Recognition 26, 11 (1993), 1623-1637.
21. KIMMEL R., SETHIAN J. A.: Computing geodesic paths on manifolds. In Proc. Natl. Acad. Sci. (1998), pp. 8431-8435.
22. MACDONALD D. J., BOOTH K. S.: Heuristics for ray tracing using space subdivision. Vis. Comput. 6, 3 (1990), 153-166.
23. MITRA N. J., BRONSTEIN A., BRONSTEIN M.: Intrinsic regularity detection in 3d geometry. In ECCV (2010), p. to appear.
24. MOENNING C., DODGSON N. A.: Fast Marching farthest point sampling for implicit surfaces and point clouds. Tech. Rep. 565, University of Cambridge, 2003.
25. MITCHELL J. S. B., MOUNT D. M., PAPADIMITRIOU C. H.: The discrete geodesic problem. SIAM J. Comput. 16, 4 (1987), 647-668.
26. MÉMOLI F., SAPIRO G.: Fast computation of weighted distance functions and geodesics on implicit hyper-surfaces: 730. J. Comput. Phys. 173, 2 (2001), 764.
27. MÉMOLI F., SAPIRO G.: Comparing point clouds. In Proc. Symp. Geom. Proc. (2004), pp. 32-40.
28. MÉMOLI F., SAPIRO G.: Distance functions and d geodesics on submanifolds of r and point clouds. SIAM Journal of Applied Mathematics 65, 4 (2005), 1227-1260.
29. MEHRA R., ZHOU Q., LONG J., SHEFFER A., GOOCH A., MITRA N. J.: Abstraction of man-made shapes. ACM Transactions on Graphics 28, 5 (2009), #137, 1-10.
30. NOVOTNI M., KLEIN R.: Computing geodesic paths on triangular meshes. In WSCG (2002), pp. 341-348.
31. PEYRE G., COHEN L.: Geodesic remeshing using front propagation. In INT. J. COMPUT. VISION (2003), pp. 33-40.
32. POLTHIER K., SCHMIES M.: Straightest geodesics on polyhedral surfaces. In SIGGRAPH '06 (2006), pp. 30-38.
33. RAVIV D., BRONSTEIN A. M., BRONSTEIN M. M., KIMMEL R.: Symmetries of non-rigid shapes. In Proc. International Conference on Computer Vision (ICCV) (Oct. 2007).
34. RUGGERI M. R., DAROM T., SAUPE D., KIRYATI N.: Approximating geodesics on point set surfaces. In Proc. Symp. on Point-Based Graphics (2006), pp. 85-93.
35. SAMET H.: Neighbour finding in images represented by octrees. In Vision, Graphics & Image Proc. (1989), pp. 367-386.
36. SUN J., CHEN X., FUNKHOUSER T.: Fuzzy geodesics and consistent sparse correspondences for deformable shapes. Computer Graphics Forum 29, 5 (2010).
37. SETHIAN J. A.: A fast marching level set method for monotonically advancing fronts. In Proc. Nat. Acad. Sci (1995), pp. 1591-1595.
38. SETHIAN J. A.: Fast marching methods. SIAM Review 41 (1999), 199-235.
39. SCHMIDT R., GRIMM C., WYVILL B.: Interactive decal compositing with discrete exponential maps. In SIGGRAPH '06: ACM SIGGRAPH 2006 Papers (2006), pp. 605-613.
40. SURAZHSKY V., SURAZHSKY T., KIRSANOV D., GORTLER S. J., HOPPE H.: Fast exact and approximate geodesics on meshes. ACM Trans. Gr. 24, 3 (2005), 553-560.
41. TZUR Y., TAL A.: Flexistickers: photogrammetric texture mapping using casual images. In SIGGRAPH '09: ACM SIGGRAPH 2009 papers (2009), pp. 1-10.
42. XIN S.-Q., WANG G.-J.: Improving Chen and Han's algorithm on the discrete geodesic problem. ACM Trans. Graph. 28, 4 (2009), 1-8.
43. ZELINKA S., GARLAND M.: Similarity-based surface modelling using geodesic fans. In Proc. Symposium on Geometry Processing (2004), pp. 204-213.