An easy way of detecting subdivision connectivity in a triangle mesh

In this paper we discuss how a given triangle mesh can be analysed in order to decide whether it has subdivision con-nectivity or not. Our subdivision connectivity detection uti-lizes the fact that almost all vertices of a triangle mesh with subdivision connectivity are regular and that the remaining irregular vertices are vertices of the coarsest level. These vertices can therefore be used as seed points of a region growing algorithm that generates the entire base mesh from which the given mesh was refined. Once all the hierarchy levels of the given mesh are detected we reorder its vertices such that all the connectivity information of the given mesh is encoded in this vertex order and the connectivity of the base mesh only. This enables us to represent the given mesh as another triangle mesh with the same number of vertices but considerably fewer triangles and store it compactly us-ing a standard file format, such as VRML. 1. Introduction and Relate