A background-priority discrete boundary triangulation method

Loke, R. E.; Jansen, F. W.; du Buf, J. M. H.

http://hdl.handle.net/10400.1/6985

Use this identifier to reference this record.

Name:	Description:	Size:	Format:
A background-priority discrete boundary triangulation method.pdf		1 MB	Adobe PDF	Download

Send Feedback

Authors

Loke, R. E.

Jansen, F. W.

du Buf, J. M. H.

Abstract(s)

Discrete boundary triangulation methods generate triangular meshes through the centers of the boundary voxels of a volumetric object. At some voxel configurations it may be arbitrary whether a part of the volume should be included in the object or could be classified as background. Consequently, important details such as concave and convex edges and corners are not consistently preserved in the describing geometry. We present a "background priority" version of an existing "object priority" algorithm [6]. We show that the ad hoc configurations of the well-known Discretized Marching Cubes algorithm [13] can be derived from our method and that a combined triangulation with "object priority" and "background priority" better would preserve object details.