Fast isosurface polygonization with embedded sharp features extraction

This source preferred by Alexander Pasko and Valery Adzhiev

Authors: Kazakov, M., Pasko, A. and Adzhiev, V.

http://cis.k.hosei.ac.jp/TR/HCIS-2003-04.pdf

Publisher: Hosei University

Place of Publication: Tokyo, Japan

This paper presents a novel isosurface polygonization algorithm capable of approximating isosurface sharp features. For the scalar field sampled at the nodes of a regular grid, it requires normal vectors to be provided in the intersection points of the isosurface with cell edges. Unlike most of other methods, the sharp features reconstruction is embedded into the polygonization algorithm and no further post-processing is necessary. The algorithm is designed assuming possible interactive modification of the source data and does not use information from the neighborhood of the grid cell. To reconstruct a sharp feature for the current cell, additional points are introduced on the intersection line of the isosurface tangent planes for each cell face and in the cell interior. We use some heuristics to avoid time-consuming singular value decomposition for the interior point calculations. The implementation of the proposed algorithm demonstrates high performance of the polygonization of the isosurface with sharp features and allows for interactive rates of isosurface visualization.

The data on this page was last updated at 04:42 on September 24, 2017.