Least squares conformal maps for automatic texture atlas generation
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
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
Lofting curve networks using subdivision surfaces
Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Geometric modeling with conical meshes and developable surfaces
ACM SIGGRAPH 2006 Papers
Spectral surface quadrangulation
ACM SIGGRAPH 2006 Papers
Vector field design on surfaces
ACM Transactions on Graphics (TOG)
Periodic global parameterization
ACM Transactions on Graphics (TOG)
Rotational symmetry field design on surfaces
ACM SIGGRAPH 2007 papers
Designing quadrangulations with discrete harmonic forms
SGP '06 Proceedings of the fourth Eurographics symposium on Geometry processing
N-symmetry direction field design
ACM Transactions on Graphics (TOG)
Quadrilateral mesh simplification
ACM SIGGRAPH Asia 2008 papers
ACM SIGGRAPH 2009 papers
Geometry-aware direction field processing
ACM Transactions on Graphics (TOG)
Harmonic functions for quadrilateral remeshing of arbitrary manifolds
Computer Aided Geometric Design - Special issue: Geometry processing
A wave-based anisotropic quadrangulation method
ACM SIGGRAPH 2010 papers
Shape space exploration of constrained meshes
Proceedings of the 2011 SIGGRAPH Asia Conference
Connectivity editing for quadrilateral meshes
Proceedings of the 2011 SIGGRAPH Asia Conference
Design-driven quadrangulation of closed 3D curves
ACM Transactions on Graphics (TOG) - Proceedings of ACM SIGGRAPH Asia 2012
| Hi-index | 0.00 |
We present a framework for exploring topologically unique quadrangulations of an input shape. First, the input shape is segmented into surface patches. Second, different topologies are enumerated and explored in each patch. This is realized by an efficient subdivision-based quadrangulation algorithm that can exhaustively enumerate all mesh topologies within a patch. To help users navigate the potentially huge collection of variations, we propose tools to preview and arrange the results. Furthermore, the requirement that all patches need to be jointly quadrangulatable is formulated as a linear integer program. Finally, we apply the framework to shape-space exploration, remeshing, and design to underline the importance of topology exploration.