Proceedings Fifth International Conference on Information Visualisation
Download PDF

Abstract

Abstract: The Marching Cubes algorithm of Lorensen and Cline, [4] is a method used frequently in three-dimensional object visualisation. The underlying concept of the technique is to form piecewise planar approximations to surfaces, for which predetermined normals are used for shading purposes. It should be noted that these approximations are precisely as accurate as the data given, there is no loss in quality or error introduced. The approach of using these cubes to represent data can also be used to fully describe the piece-wise planar approximation to the surface. Problems arise however in terms of storage space required for the representation of large objects, and it is this issue that is addressed here. We present an algorithm that transforms pixelwise data into a boundary representation that has potential for large reductions in storage. The algorithm does not involve any further approximation of the surface of the object than that given as input. The algorithm also provides a structure that makes surface analysis and matching very simple.
Like what you’re reading?
Already a member?Sign In
Member Price
$11
Non-Member Price
$21
Add to CartSign In
Get this article FREE with a new membership!