This video presents an application of geodesic computation on 3D meshes to surface remeshing. The connectivity of the resulting mesh is computed using a geodesic Delaunay triangulation of the sampling points. The user can provide a speed function to conform the remeshing to various contraints such as curvature variation or texture gradient. This remeshing method is fast thanks to the use of the fast marching algorithm. It is simple to implement, robust and can serve as a basis building block for further processing of the surface such as segmentation or flattening.


    Access

    Download


    Export, share and cite



    Title :

    Geodesic computation for adaptive remeshing


    Contributors:
    Peyre, G. (author) / Cohen, L. (author)


    Publication date :

    2005-01-01


    Size :

    333475 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Geodesic Remeshing Using Front Propagation

    Peyré, G. / Cohen, L. D. | British Library Online Contents | 2006


    ADAPTIVE REMESHING FOR UNSTEADY RANS COMPUTATIONS

    Gammacurta, E. / Etienne, S. / Pelletier, D. et al. | British Library Conference Proceedings | 2010


    Adaptive Remeshing for Unsteady RANS Computations

    Gammacurta, Eric / Etienne, Stéphane / Pelletier, Dominique et al. | AIAA | 2010


    Adaptive remeshing for viscous incompressible flows

    HETU, JEAN-FRANCOIS / PELLETIER, DOMINIQUE | AIAA | 1990


    Adaptive Remeshing For Sheet Metal Forming Simulations

    Finn, M. / Galbraith, P. | British Library Conference Proceedings | 1995