Computing geometry-aware handle and tunnel loops in 3D models

SIGGRAPH'08: International Conference on Computer Graphics and Interactive Techniques, ACM SIGGRAPH 2008 Papers 2008

Volumn , Issue , 2008, Pages

  Dey, Tamal K ^a   Li, Kuiyu ^a   Sun, Jian ^b   Cohen Steinen, David ^c  

^a OHIO STATE UNIVERSITY   (United States)

^b STANFORD UNIVERSITY   (United States)

^c INRIA   (France)

Author keywords

Feature identification; Persistent homology; Shape analysis; Surface loop; Topology; Topology repair

Indexed keywords

FEATURE IDENTIFICATION; PERSISTENT HOMOLOGY; SHAPE ANALYSIS; SURFACE LOOP; TOPOLOGY REPAIR;

COMPUTER GRAPHICS; INTERACTIVE COMPUTER GRAPHICS; REPAIR; THREE DIMENSIONAL; TOPOLOGY; TUNNELS;

SURFACE ANALYSIS;

EID: 57649092681     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. ALLIEZ, P., COHEN-STEINER, D., YVINEC, M., AND DESBRUN, M. 2005. Variational tetrahedral meshing. In Proc. SIGGRAPH 2005, 617-625.
2. BEN-CHEN, M., GOTSMAN, C., AND BUNIN, G. 2008. Conformal flattening by curvature prescription and metric scaling. Computer Graphics Forum (Proc. Eurographics) 27.
3. BIASOTTI, S., GLORGI, D., SPAGNUOLO, M., AND FALC1DIENO, B. 2008. Reeb graphs for shape analysis and applications. Theoretical Comput. Sci. 392, 5-22.
4. BLSCHOFF, S., AND KOBBELT, L. 2005. Structure preserving CAD model repair. Comput. Graphics Forum 24, 527-536.
5. CHEN, C., AND FREEDMAN, D. 2008. Quantifying homology classes. In Sympos. Theoretical Aspects Comput. Sci., 169-180.
6. CHENG, S.-W., DEY, T. K., AND LEVINE, J. A. 2007. A practical Delaunay meshing algorithm for a large class of domains. In Proc. 16th Internat. Meshing Roundtable, 477-494.
7. COHEN-STEINER, D., EDELSBRUNNER, H., AND MOROZOV, D. 2006. Vines and vineyards by updating persistence in linear time. In Proc. 22nd Ann. Sympos. Comput. Geom., 119-126.
8. DEY, T. K., AND SUN, J. 2006. Defining and computing curve-skeletons with medial geodesic function. In Proc. Sympos. Geom. Processing, 143-152.
9. DEY, T. K., LI, K., AND SUN, J. 2007. On computing handle and tunnel loops. In IEEE Proc. Internat. Conf. Cyherworlds, 357-366.
10. DEY, T. K. 2007. Curve and surface reconstruction: algorithms with mathematical analysis. Cambridge University Press.
11. EDELSBRUNNER, H., LETSCHER, D., AND ZOMORODIAN, A. 2002. Topological persistence and simplification. Discrete Comput. Geom. 28, 511-533.
12. EL-SANA, J., AND VARSHNEY, A. 1997. Controlled simplification of genus for polygonal models. In Proc. IEEE Visualization, 403-412.
13. ÉRIC COLIN DE VERDIÈRE, AND ERICKSON, J. 2006. Tightening non-simple paths and cycles on surfaces. In Proc. ACM-SIAM Sympos. Discrete Algorithms, 192-201.
14. ÉRIC COLIN DE VERDIÈRE, AND LAZARUS, F. 2005. Optimal system of loops on an orientable surface. Discrete Comput. Geom. 33, 507-534.
15. ERICKSON, J., AND WHITTLESEY, K. 2005. Greedy optimal ho-motopy and homology generators. In Proc. ACM-SIAM Sympos. Discrete Algorithms, 1038-1046.
16. GU, X., GORTLER, S., AND HOPPE, H. 2002. Geometry images. In Proc. SIGGRAPH 2002, 355-361.
17. GUSKOV, I, AND WOOD, Z. 2001. Topological noise removal. In Proc. Graphics Interface 2001, 19-26.
18. HATCHER, A. 2002. Algebraic Topology. Cambridge University Press.
19. LEVOY, M., PULLI, K., CURLESS, B., RUSINKIEWICZ, S., ROLLER, D., PEREIRA, L., GINZTON, M., ANDERSON, S., DAVIS, J., GINSBERG, J., SHADE, J., AND FULK, D. 2000. The digital Michelangelo project: 3d scanning of large statues. In Proc. SIGGRAPH 2000, 131-144.
20. NI, X., GARLAND, M., AND HART, J. C. 2004. Fair morse functions for extracting the topological structure of a surface mesh. In Proc. SIGGRAPH 2004, 613-622.
21. NOORUDDIN, F. S., AND TURK, G. 2003. Simplification and repair of polygonal models using volumetric techniques. IEEE Trans. Vis. Cotnput. Graph. 9, 191-205.
22. OUDOT, S., RLNEAU, L., AND YVINEC, M. 2005. Meshing volumes bounded by smooth surfaces. In Proc. 14th Internal. Meshing Roundtahle, 203-219.
23. PASCUCCI, V., SCORZELLI, G., BREMER, P.-T., AND MAS-CARENHAS, A. 2007. Robust on-line computation of Reeb graphs: simplicity and speed. ACM Trans. Graphics. 58, 1-9.
24. SHATTUCK, D. W., AND LEAHY, R. M. 2001. Automated graph-based analysis and correction of cortical volume topology. IEEE Trans. Med. Imaging 20, 1167-1177.
25. SHEFFER, A., AND HART, J. 2002. Seamster: inconspicuous low-distortion texture seam layout. In Proc. IEEE Visualization, 291-298.
26. WOOD, Z., HOPPE, H., DESBRUN, M., AND SCHRÖDER, P. 2004. Removing excess topology from isosurfaces. ACM Trans. Graphics 23, 511-533.
27. YIN, X., JIN, M., AND GU, X. 2007. Computing shortest cycles using universal covering space. Visual Computer 23, 999-1004.
28. ZHOU, Q.-Y., JU, T., AND HU, S.-M. 2007. Topology repair of solid models using skeletons. IEEE Trans. Vis. Comput. Graph. 13, 675-685.
29. ZOMORODIAN, A., AND CARLSSON, G. 2005. Computing persistent homology. Discrete Comput. Geom. 33, 249-274.
30. ZOMORODIAN, A., AND CARLSSON, G. 2007. Localized homology. In Proc. Shape Modeling Internat., 189-198.