On computing handle and tunnel loops

Proceedings - 2007 International Conference on Cyberworlds, CW'07

Volumn , Issue , 2007, Pages 357-366

  Dey, Tamal K ^a   Li, Kuiyu ^a   Sun, Jian ^a  

^a OHIO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

(1 1 0) SURFACE; (I ,J) CONDITIONS; CLOSED SURFACES; CYBERWORLDS; FEATURE DETECTION; INTERNATIONAL CONFERENCES; THREE DIMENSIONS;

GRAPH THEORY; LEAD;

TUNNELS;

EID: 44649187263     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CW.2007.49     Document Type: Conference Paper

References (20)

1. S. Bischoff and L. Kobbelt. Structure preserving cad model repair. Comput. Graphics Forum, 24:527-536, 2005.
2. F. Chazal and A. Lieutier. Stability and homotopy of a subset of the medial axis. In Proc. ACM Sympos. Solid Modeling and Applications, pages 243-248, 2004.
3. C. J. A. Delfinado and H. Edelsbrunner. An incremental algorithm for betti numbers of simplicial complexes on the 3-sphere. Comput. Aided Geom. Design, 12:771-784, 1995.
4. T. K. Dey and H. Schipper. A new technique to compute polygonal schema for 2-manifolds with application to nullhomotopy detection. Discrete Comput. Geom., 14:93-110, 1995.
5. T. K. Dey and J. Sun. Defining and computing curve-skeletons with medial geodesic function. In Proc. Sympos. Geom. Processing, pages 143-152, 2006.
6. T. K. Dey and W. Zhao. Apporximating the medial axis from the voronoi diagram with a convergence guarantee. Algorithmica, 38:179-200, 2004.
7. J. El-Sana and A. Varshney. Controlled simplification of genus for polygonal models. In Proc. IEEE Visualizations'97, pages 403-412, 1997.
8. Éric Colin de Verdière and F. Lazarus. Optimal system of loops on an orientable surface. Discrete Comput. Geom., 33:507-534, 2005.
9. J. Erickson and S. Har-Peled. Optimally cutting a surface into a disk. Discrete Comput. Geom., 31:37-59, 2004.
10. J. Erickson and K. Whittlesey. Greedy optimal homotopy and homology generators. In Proc. ACM-SIAM Sympos. Discrete Algorithms, pages 1038-1046, 2005.
11. J. Giesen, E. A. Ramos, and B. Sadri. Medial axis approximation and unstable manifolds. In Proc. 22nd Annu. Sympos. Comput. Geom., pages 327-336, 2006.
12. I. Guskov and Z. Wood. Topological noise removal. In Proc. Graphics Interface 2001, pages 19-26, 2001.
13. A. Hatcher. Algebraic Topology. Cambridge University Press, 2002.
14. E. E. Moise. Geometric Topology in Dimensions 2 and 3. Springer-Verlag, 1977.
15. J. R. Munkres. Elements of Algebraic Topology. Addison Wesley, 1993.
16. D. Rolfsen. Knots and Links. Publish or Perish, 1976.
17. G. Vegter and C. K. Yap. Computational complexity of combinatorial surfaces. In Proc. Annu. Sympos. Comput. Geom., pages 102-111, 1990.
18. Z. Wood, H. Hoppe, M. Desbrun, and P. Schröder. Removing excess topology from isosurfaces. ACM Trans. Graphics, 23:511-533, 2004.
19. X. Yin, M. Jin, and X. Gu. Computing shortest cycles using universal covering space. Visual Computer, 2007.
20. Q.-Y. Zhou, T. Ju, and S.-M. Hu. Topology repair of solid models using skeletons. IEEE Transactions on Visualization and Computer Graphics, 2007.