Anisotropic voronoi diagrams and guaranteed-quality anisotropic mesh generation
Proceedings of the nineteenth annual symposium on Computational geometry
Anisotropic polygonal remeshing
ACM SIGGRAPH 2003 Papers
Variational shape approximation
ACM SIGGRAPH 2004 Papers
Anisotropic Centroidal Voronoi Tessellations and Their Applications
SIAM Journal on Scientific Computing
Variational tetrahedral meshing
ACM SIGGRAPH 2005 Papers
Provably good sampling and meshing of Lipschitz surfaces
Proceedings of the twenty-second annual symposium on Computational geometry
Spectral surface quadrangulation
ACM SIGGRAPH 2006 Papers
Periodic global parameterization
ACM Transactions on Graphics (TOG)
Designing quadrangulations with discrete harmonic forms
SGP '06 Proceedings of the fourth Eurographics symposium on Geometry processing
Generic Remeshing of 3D Triangular Meshes with Metric-Dependent Discrete Voronoi Diagrams
IEEE Transactions on Visualization and Computer Graphics
An incremental approach to feature aligned quad dominant remeshing
Proceedings of the 2008 ACM symposium on Solid and physical modeling
Volumetric parameterization and trivariate b-spline fitting using harmonic functions
Proceedings of the 2008 ACM symposium on Solid and physical modeling
Hexahedral mesh generation constraints
Engineering with Computers - Special Issue: 5th Symposium on Trends in Unstructured Mesh Generation in 2006. Guest Editor: Steven J. Owen
Spectral quadrangulation with orientation and alignment control
ACM SIGGRAPH Asia 2008 papers
ACM SIGGRAPH 2009 papers
On centroidal voronoi tessellation—energy smoothness and fast computation
ACM Transactions on Graphics (TOG)
Repairing and meshing imperfect shapes with Delaunay refinement
2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling
Anisotropic blue noise sampling
ACM SIGGRAPH Asia 2010 papers
Eulerian solid simulation with contact
ACM SIGGRAPH 2011 papers
HOT: Hodge-optimized triangulations
ACM SIGGRAPH 2011 papers
SMI 2011: Full Paper: Template-based quadrilateral meshing
Computers and Graphics
Boundary aligned smooth 3D cross-frame field
Proceedings of the 2011 SIGGRAPH Asia Conference
Beady: interactive beadwork design and construction
ACM Transactions on Graphics (TOG) - SIGGRAPH 2012 Conference Proceedings
SMI 2012: Full As-conformal-as-possible discrete volumetric mapping
Computers and Graphics
Vertex location optimisation for improved remeshing
Graphical Models
Centroidal Voronoi Tessellation of Line Segments and Graphs
Computer Graphics Forum
Design-driven quadrangulation of closed 3D curves
ACM Transactions on Graphics (TOG) - Proceedings of ACM SIGGRAPH Asia 2012
Particle-based anisotropic surface meshing
ACM Transactions on Graphics (TOG) - SIGGRAPH 2013 Conference Proceedings
Embedded thin shells for wrinkle simulation
ACM Transactions on Graphics (TOG) - SIGGRAPH 2013 Conference Proceedings
ACM Transactions on Graphics (TOG)
PolyCut: monotone graph-cuts for PolyCube base-complex construction
ACM Transactions on Graphics (TOG)
Optimizing polycube domain construction for hexahedral remeshing
Computer-Aided Design
Approximating functions on a mesh with restricted Voronoï diagrams
SGP '13 Proceedings of the Eleventh Eurographics/ACMSIGGRAPH Symposium on Geometry Processing
| Hi-index | 0.00 |
This paper introduces Lp-Centroidal Voronoi Tessellation (Lp-CVT), a generalization of CVT that minimizes a higher-order moment of the coordinates on the Voronoi cells. This generalization allows for aligning the axes of the Voronoi cells with a predefined background tensor field (anisotropy). Lp-CVT is computed by a quasi-Newton optimization framework, based on closed-form derivations of the objective function and its gradient. The derivations are given for both surface meshing (Ω is a triangulated mesh with per-facet anisotropy) and volume meshing (Ω is the interior of a closed triangulated mesh with a 3D anisotropy field). Applications to anisotropic, quad-dominant surface remeshing and to hexdominant volume meshing are presented. Unlike previous work, Lp-CVT captures sharp features and intersections without requiring any pre-tagging.