Geodesic Remeshing Using Front Propagation
International Journal of Computer Vision
Geometric modeling based on triangle meshes
ACM SIGGRAPH 2006 Courses
On centroidal voronoi tessellation—energy smoothness and fast computation
ACM Transactions on Graphics (TOG)
Hyperbolic centroidal Voronoi tessellation
Proceedings of the 14th ACM Symposium on Solid and Physical Modeling
Geodesic Methods in Computer Vision and Graphics
Foundations and Trends® in Computer Graphics and Vision
Centroidal Voronoi tessellation in universal covering space of manifold surfaces
Computer Aided Geometric Design
Fast marching for robust surface segmentation
PIA'11 Proceedings of the 2011 ISPRS conference on Photogrammetric image analysis
Approximating geodesics on point set surfaces
SPBG'06 Proceedings of the 3rd Eurographics / IEEE VGTC conference on Point-Based Graphics
Particle-based anisotropic surface meshing
ACM Transactions on Graphics (TOG) - SIGGRAPH 2013 Conference Proceedings
| Hi-index | 0.00 |
In this paper, we solve the problem of mesh partition using intrinsic computations on the 3D surface. The key concept is the notion of centroidal tesselation that is widely used in an eucidan settings. Using the Fast Marching algorithm, we are able to recast this powerful tool in the language of mesh processing. This method naturally fits into a framework for 3D geometry modelling and processing that uses only fast geodesic computations. With the use of classical geodesic-based building blocks, we are able to take into account any available information or requirement such as a 2D texture or the curvature of the surface.