A new unsupervised cube-based algorithm for iso-surface generation

Computer Networks

Volumn 29, Issue 14, 1997, Pages 1737-1744

  Lucas, Laurent ^a   Gillard, Didier ^a   Rémion, Yannick ^a  

^a UNIVERSITÉ DE REIMS CHAMPAGNE ARDENNE   (France)

Author keywords

3D quantification; Computational geometry; Convex hull; Delaunay triangulation; Marching cubes; Surface reconstruction

Indexed keywords

ALGORITHMS; ERROR COMPENSATION; GEOMETRY; HEURISTIC METHODS; MATHEMATICAL MODELS; SURFACES;

SURFACE RECONSTRUCTION;

COMPUTATIONAL GEOMETRY;

EID: 0031247661     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0169-7552(97)00086-x     Document Type: Article

References (5)

1. M.E. Algorri, F. Schmitt, Deformable models for reconstructing unstructured 3D data, in: Proc. 1st Internat Conf. CVRMed'95, Lecture Note in Computer Science, Springer, Berlin, 1995, pp. 420-426.
2. F. Aurenhammer, Voronoï diagrams: A survey of a fundamental geometric data structure, ACM Computing Surveys 23 (1991) 345-405.
3. C.B. Barber, D.P. Dobkin, H. Huhdanpaa, The quickhull algorithm for convex hull. Geometry Center Tech. Rept. GCG53, 1993.
4. J.L. Bentley, M.G. Faust, F.P. Preparata, Approximation algorithms for convex hull, Comm. ACM (1982) 64-68.
5. J.D. Boissonnat, Shape reconstruction from planar cross sections, CGVIP 44 (1988) 1-29.