The Visual Computer

, Volume 21, Issue 8–10, pp 689–697

Quadrilateral and tetrahedral mesh stripification using 2-factor partitioning of the dual graph

original article

DOI: 10.1007/s00371-005-0336-9

Cite this article as:
Diaz-Gutierrez, P. & Gopi, M. Visual Comput (2005) 21: 689. doi:10.1007/s00371-005-0336-9


In order to find a 2-factor of a graph, there exists a O(n1.5) deterministic algorithm [7] and a O(n3) randomized algorithm [14]. In this paper, we propose novel O(nlog3nloglogn) algorithms to find a 2-factor, if one exists, of a graph in which all n vertices have degree 4 or less. Such graphs are actually dual graphs of quadrilateral and tetrahedral meshes. A 2-factor of such graphs implicitly defines a linear ordering of the mesh primitives in the form of strips. Further, by introducing a few additional primitives, we reduce the number of tetrahedral strips to represent the entire tetrahedral mesh and represent the entire quad surface using a single quad strip.


Graph matching 2-factor Quadrilateral stripification Tetrahedral stripification 

Copyright information

© Springer-Verlag 2005

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversity of CaliforniaIrvineUSA

Personalised recommendations