Motorcycle graph enumeration from quadrilateral meshes for reverse engineering

Günpınar E., Moriguchi M., SUZUKI H., OHTAKE Y.

COMPUTER-AIDED DESIGN, cilt.55, ss.64-80, 2014 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 55
  • Basım Tarihi: 2014
  • Doi Numarası: 10.1016/j.cad.2014.05.007
  • Dergi Adı: COMPUTER-AIDED DESIGN
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.64-80
  • İstanbul Teknik Üniversitesi Adresli: Evet

Özet

Recently proposed quad-meshing techniques allow the generation of high-quality semi-regular quadrilateral meshes. This paper outlines the generation of quadrilateral segments using such meshes. Quadrilateral segments are advantageous in reverse engineering because they do not require surface trimming or surface parameterization. The motorcycle graph algorithm of Eppstein et al. produces the motorcycle graph of a given quadrilateral mesh consisting of quadrilateral segments. These graphs are preferable to base complexes, because the mesh can be represented with a smaller number of segments, as T-joints (where the intersection of two neighboring segments does not involve the whole edge or the vertex) are allowed in quadrilateral segmentation.