Delaunay tetrahedralization: a tool for building triangulated surfaces

@inproceedings{ConraudRM1996a,
 abstract = { This paper presents how the well-known geometrical data structure named Delaunay tetrahedralization can be useful for building 3D triangulated surfaces from data such as scattered points or sets of parallel closed curves. Descriptions of related previous works will be made and details about our choices of methods and about sorne adaptations we made in the frame of the GOCAD project will be given. After a listing of intercsting properties of Delaunay d-triangulation in the first section (i.e: a 2-triangulation is a classic triangulation, a 3-triangulation is a tetrahedralization) and a quick description of the algorithm implemented in GOCAD for building a Delaunay d-triangulation in the second section, the third and the fourth sections will focus respectively on the building of triangulated surfaces from sets of curves and from scattered points. },
 author = { Conraud, Joël },
 booktitle = { 13th gOcad Meeting },
 month = { "june" },
 publisher = { ASGA },
 title = { Delaunay tetrahedralization: a tool for building triangulated surfaces },
 year = { 1996 }
}