Title: A background-priority discrete boundary triangulation method
Authors: Loke, Robert Edward
Jansen, Frederik W.
du Buf, Hans
Citation: WSCG '2006: Short Papers Proceedings: The 14-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision 2006: University of West Bohemia, Plzen, Czech Republic, January 31 - February 2, 2006, p. 53-60.
Issue Date: 2006
Publisher: Václav Skala - UNION Agency
Document type: konferenční příspěvek
URI: http://wscg.zcu.cz/WSCG2006/Papers_2006/Short/!WSCG2006_Short_Proceedings_Final.pdf
ISBN: 80-86943-05-4
Keywords: objemové modely;počítačem podporované projektování;výpočetní geometrie;zpracování obrazu
Keywords in different language: volume models;computer aided design;computational geometry;image processing
Abstract: 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.
Rights: © Václav Skala - UNION Agency
Appears in Collections:WSCG '2006: Short Papers Proceedings

Files in This Item:
File Description SizeFormat 
Loke.pdfPlný text1,01 MBAdobe PDFView/Open

Please use this identifier to cite or link to this item: http://hdl.handle.net/11025/6596

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.