ACM Home Page
Please provide us with feedback. Feedback
Computing geometry-aware handle and tunnel loops in 3D models
Full text MovMov (25:51),  PdfPdf (6.92 MB)
Source
ACM Transactions on Graphics (TOG) archive
Volume 27 ,  Issue 3  (August 2008) table of contents
Proceedings of ACM SIGGRAPH 2008
SESSION: Shape analysis table of contents
Article No. 45  
Year of Publication: 2008
ISSN:0730-0301
Also published in ...
Authors
Tamal K. Dey  Ohio State University
Kuiyu Li  Ohio State University
Jian Sun  Stanford University
David Cohen-Steiner  Inria, Sophia-Antipolis
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 87,   Downloads (12 Months): 325,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1360612.1360644
What is a DOI?

ABSTRACT

Many applications such as topology repair, model editing, surface parameterization, and feature recognition benefit from computing loops on surfaces that wrap around their 'handles' and 'tunnels'. Computing such loops while optimizing their geometric lengths is difficult. On the other hand, computing such loops without considering geometry is easy but may not be very useful. In this paper we strike a balance by computing topologically correct loops that are also geometrically relevant. Our algorithm is a novel application of the concepts from topological persistence introduced recently in computational topology. The usability of the computed loops is demonstrated with some examples in feature identification and topology simplification.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
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
 
4
Bischoff, 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
 
8
 
9
 
10
 
11
Edelsbrunner, H., Letscher, D., and Zomorodian, A. 2002. Topological persistence and simplification. Discrete Comput. Geom. 28, 511--533.
 
12
13
 
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
16
 
17
 
18
Hatcher, A. 2002. Algebraic Topology. Cambridge University Press.
 
19
20
 
21
 
22
Oudot, S., Rineau, L., and Yvinec, M. 2005. Meshing volumes bounded by smooth surfaces. In Proc. 14th Internat. Meshing Roundtable, 203--219.
23
 
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
26
 
27
 
28
 
29
 
30

Collaborative Colleagues:
Tamal K. Dey: colleagues
Kuiyu Li: colleagues
Jian Sun: colleagues
David Cohen-Steiner: colleagues