From 3D Unstructured Data Points to 3D Surface

in: 13th gOcad Meeting, ASGA

Abstract

A 3D triangulated surface can easily be built from an unstructured 3D set of points( e.g. using the Delauney method) if the set of points is almost planaI' or at least does not correspond to a multi-valued surface such as a salt dome. In such cases the multivaluation of the surface means that no method relying on projection can be applied. However, sueh a set of points can be l'epresented by a triangulated surface. In this paper a method is presented for producing a triangulated surface from a complex 3D set of points.

Download / Links

    BibTeX Reference

    @inproceedings{BombardeRM1996a,
     abstract = { A 3D triangulated surface can easily be built from an unstructured 3D set of points( e.g. using the Delauney method) if the set of points is almost planaI' or at least does not correspond to a multi-valued surface such as a salt dome. In such cases the multivaluation of the surface means that no method relying on projection can be applied. However, sueh a set of points can be l'epresented by a triangulated surface. In this paper a method is presented for producing a triangulated surface from a complex 3D set of points. },
     author = { Bombarde, Sebastien AND Lecour, Magali },
     booktitle = { 13th gOcad Meeting },
     month = { "june" },
     publisher = { ASGA },
     title = { From 3D Unstructured Data Points to 3D Surface },
     year = { 1996 }
    }