ALL libraries (COBIB.SI union bibliographic/catalogue database)
  • Triangulacija med vzporedno ležečimi krivuljami = Triangulation among parallel contours
    Klemenčič, Aleš ; Kovačič, Stanislav
    The Delunay triangulation of a point set is a collection of edges satisfying an "empty circle" property: for each edge we can find a circle containing the edges endpoints but not containing any other ... points. For a reconstruction of asurface in a 3D space, the general Delaunay triangulation is not appropriate,because we need only a subset of all triangles. If the surface is convex, then triangles forming convex hull are sufficient, if the surface is non-convex, internal as well as some external edges have to be removed. Often a set of 2D images exist, where the object of interest can be delineated on consecutive images. In this paper we present an algorithm that can be used to build a trinagulized surface based on a set of parallel contours. We show the application of the algorithm for surface reconstruction of ventricles in humanbrain.
    Type of material - conference contribution
    Publish date - 2000
    Language - slovenian
    COBISS.SI-ID - 12105945