抄録
Isosurfacing is one of the most useful visualization technique. Although isosurfacing can visualize a given volume dataset faster than other visualization techniques, more accelerated isosurface extraction algorithm is required for large-scale and complex dataset. This paper represents an accelerated isosurface extraction algorithm using a critical point graph. Sevelal datasets such as analytic dataset are used to prove the temporal efficiency of the presented extraction algorithm compared with a well-known isosurfacing algorithm called Marching Cubes.
