Piecewise smooth surface reconstruction
SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
Approximation with Active B-Spline Curves and Surfaces
PG '02 Proceedings of the 10th Pacific Conference on Computer Graphics and Applications
ACM SIGGRAPH 2003 Papers
Anisotropic polygonal remeshing
ACM SIGGRAPH 2003 Papers
Variational shape approximation
ACM SIGGRAPH 2004 Papers
Direct Anisotropic Quad-Dominant Remeshing
PG '04 Proceedings of the Computer Graphics and Applications, 12th Pacific Conference
Periodic global parameterization
ACM Transactions on Graphics (TOG)
Spectral quadrangulation with orientation and alignment control
ACM SIGGRAPH Asia 2008 papers
Quadrilateral mesh simplification
ACM SIGGRAPH Asia 2008 papers
ACM SIGGRAPH 2009 papers
Motorcycle graphs: canonical quad mesh partitioning
SGP '08 Proceedings of the Symposium on Geometry Processing
Semi-regular quadrilateral-only remeshing from simplified base domains
SGP '09 Proceedings of the Symposium on Geometry Processing
ACM SIGGRAPH 2010 papers
A wave-based anisotropic quadrangulation method
ACM SIGGRAPH 2010 papers
Connectivity editing for quadrilateral meshes
Proceedings of the 2011 SIGGRAPH Asia Conference
Simple quad domains for field aligned mesh parametrization
Proceedings of the 2011 SIGGRAPH Asia Conference
Global parametrization of range image sets
Proceedings of the 2011 SIGGRAPH Asia Conference
Computer Aided Geometric Design
Global parametrization by incremental flattening
ACM Transactions on Graphics (TOG) - SIGGRAPH 2012 Conference Proceedings
Dual loops meshing: quality quad layouts on manifolds
ACM Transactions on Graphics (TOG) - SIGGRAPH 2012 Conference Proceedings
ACM Transactions on Graphics (TOG) - SIGGRAPH 2012 Conference Proceedings
Generation of bi-monotone patches from quadrilateral mesh for reverse engineering
Computer-Aided Design
A Divide-and-Conquer Approach to Quad Remeshing
IEEE Transactions on Visualization and Computer Graphics
| Hi-index | 0.00 |
Today's quad-meshing techniques generate high-quality quadrilateral meshes whose extraordinary vertices (i.e., not four-valence vertices except on the boundary) are generally located in highly curved regions. The motorcycle graph (MCG) algorithm of Eppstein et al. can be used to generate structured partitions of such quadrilateral meshes. However, it is not always possible for it to capture feature curves in the highly-curved parts of the model on the partition boundaries because model geometry is not taken into account. This study investigated feature-aware algorithms representing extensions of the MCG algorithm. Initial partitioning is first performed using a speed control algorithm identical to the MCG algorithm except that it assigns variable rather than constant speed to particles. Partition boundaries are then improved via local path flipping operations. The MCG algorithm and the speed control algorithm are intended to trace as many feature curves as possible, but do not necessarily trace all of them. For this reason, feature curves are extracted and integrated into the proposed framework by adding seeds located at ordinary vertices in addition to extraordinary seeds. The proposed algorithm generates partitions that are still structured, and has been tested with quadrilateral mesh models generated using the mixed integer quadrangulation technique of Bommes et al.