Quadrilateral and tetrahedral mesh stripification using 2-factor partitioning of the dual graph
Pablo Diaz-Gutierrez, M. Gopi
In The Visual Computer, 21(8-10), 2005.
Abstract: 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.
Keyword(s): graph matching, 2-factor, quadrilateral stripification, tetrahedral stripification
BibTeX format:
@article{Diaz-Gutierrez:2005:QAT,
  author = {Pablo Diaz-Gutierrez and M. Gopi},
  title = {Quadrilateral and tetrahedral mesh stripification using 2-factor partitioning of the dual graph},
  journal = {The Visual Computer},
  volume = {21},
  number = {8-10},
  pages = {689--697},
  year = {2005},
}
Search for more articles by Pablo Diaz-Gutierrez.
Search for more articles by M. Gopi.

Return to the search page.


graphbib: Powered by "bibsql" and "SQLite3."