Name
Abstract | ||
|---|---|---|
Since the introduction of standard techniques for isosurface extraction from volumetric datasets, one of the hardest problems has been to reduce the number of triangles (or polygons) generated. The paper presents an algorithm that considerably reduces the number of polygons generated by a Marching Cubes-like scheme (W. Lorensen and H. Cline, 1987) without excessively increasing the overall computational complexity. The algorithm assumes discretization of the dataset space and replaces cell edge interpolation by midpoint selection. Under these assumptions, the extracted surfaces are composed of polygons lying within a finite number of incidences, thus allowing simple merging of the output facets into large coplanar polygons. An experimental evaluation of the proposed approach on datasets related to biomedical imaging and chemical modelling is reported |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1109/VISUAL.1994.346308 | VIS '94 Proceedings of the conference on Visualization '94 |
Keywords | Field | DocType |
finite number,marching cubes-like scheme,experimental evaluation,chemical modelling,hardest problem,isosurface extraction,dataset space,cell edge interpolation,biomedical imaging,volumetric datasets,adaptive filters,chemicals,feature extraction,data visualisation,marching cube,interpolation,geometric modeling,surface reconstruction,computational complexity,application software,computational geometry,data structures,object modeling,merging | Discretization,Computer science,Marching cubes,Computational geometry,Interpolation,Isosurface,Smoothing group,Artificial intelligence,Geometry,Computer vision,Polygon,Algorithm,Computational complexity theory | Conference |
ISSN | ISBN | Citations |
1070-2385 | 0-7803-2521-4 | 67 |
PageRank | References | Authors |
8.58 | 14 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Claudio Montani | 1 | 1595 | 135.33 |
| Scateni, R. | 2 | 339 | 44.03 |
| Roberto Scopigno | 3 | 3056 | 236.09 |