Avtor/Urednik		Klemenčič, Aleš; Kovačič, Stanislav
Naslov		Triangulacija med vzporedno ležečimi krivuljami
Prevedeni naslov		Triangulation among parallel contours
Tip		članek
Vir		In: Zajc B, editor. Zbornik 9. elektrotehniške in računalniške konference ERK 2000. Zvezek B. Računalništvo in informatika, umetna inteligenca, robotika, razpoznavanje vzorcev, biomedicinska tehnika, močnostna elektrotehnika, didaktika, študentski članki; 2000 sep 21-23; Portorož. Ljubljana: Slovenska sekcija IEEE,
Leto izdaje		2000
Obseg		str. 233-40
Jezik		slo
Abstrakt		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 a surface 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 human brain.
Deskriptorji		IMAGE PROCESSING, COMPUTER-ASSISTED MAGNETIC RESONANCE IMAGING CEREBRAL VENTRICLES BRAIN