Graph Based Topological Analysis of Tessellated Surfaces

Ban, Tula Ram and Sen, Dibakar (2003) Graph Based Topological Analysis of Tessellated Surfaces. In: Eighth ACM Symposium on Solid Modeling and Applications, June 16 - 20, 2003, Seattle, Washington, USA, pp. 274-279.

Preview

PDF p274-ban.pdf Download (488kB)

Abstract

In this paper a graph-based method is presented which not only characterizes topological classification of the tessellated surfaces but also simultaneously generates the substantial circles or generators on the surface. Canonical polygons cannot always be mapped back to the original surface in terms of the edges of the given triangles. Hence, instead of applying canonical transformation to the initial "word", an associated graph is constructed using the unique vertices in the word. The graph is then decomposed into its constituent loops and paths. Based on the type of edges present, the loops are classified into three types. The number of loops of each type in the graph is then used for counting the rank or genus and classification of the given surface as being open or closed, orientable or non-orientable. The image of the loops and paths on the original surface give the substantial circles and arcs on the surface respectively.

Item Type:	Conference Poster
Publisher:	ACM Press
Additional Information:	© ACM,2003. This is the author's version of the work.It is posted here by permission of ACM for your personal use. Not for redistribution.The definitive version was published in Proceedings of the eighth ACM symposium on Solid modeling and applications,2003 http://doi.acm.org/10.1145/781606.781651
Keywords:	Computational Geometry and Object Modeling;Graph Theory – graph labeling;Algorithms;Computational topology;simplical complex;surface classification;characterization;cut lines
Department/Centre:	Division of Mechanical Sciences > Mechanical Engineering
Date Deposited:	15 Jun 2004
Last Modified:	19 Sep 2010 04:12
URI:	http://eprints.iisc.ac.in/id/eprint/278

Actions (login required)

View Item