From 3D unstructured data points to 3D surface

in: 18th gOcad Meeting, ASGA

Abstract

In this paper, a method to compute triangulated surfaces from a multivalued set of points is proposed. - The multivalued set of points is first separated into smaller sets of points (parts) - The the convex hull of each part is computed. - New hulls are computed so that each of them share a part of line with its neighboring convex hull. - These connected hulls are triangulated and the obtained patches are merged.

Download / Links

    BibTeX Reference

    @inproceedings{DuvinageRM1998b,
     abstract = { In this paper, a method to compute triangulated surfaces from a multivalued set of points is proposed.
    - The multivalued set of points is first separated into smaller sets of points (parts)
    - The the convex hull of each part is computed.
    - New hulls are computed so that each of them share a part of line with its neighboring convex hull.
    - These connected hulls are triangulated and the obtained patches are merged. },
     author = { Duvinage, Isabelle AND Mallet, Jean-Laurent },
     booktitle = { 18th gOcad Meeting },
     month = { "september" },
     publisher = { ASGA },
     title = { From 3D unstructured data points to 3D surface },
     year = { 1998 }
    }