Title: Nibble meshing: an algorithm for triangulation of non-manifold solid boundary
Authors: Marcheix, David
Gueorguieva, Stefka
Citation: Journal of WSCG. 1997, vol. 5, no. 1-3, p. 351-360.
Issue Date: 1997
Publisher: Václav Skala - UNION Agency
Document type: článek
URI: http://wscg.zcu.cz/wscg1997/wscg97.htm
ISSN: 1213-6972 (print)
1213-6980 (CD-ROM)
1213-6964 (online)
Keywords: geometrické modelování;nepotrubní topologie;hraniční reprezentace;výpočetní geometrie;trojúhelníkový generace ok
Keywords in different language: geometric modelling;non-manifold topology;boundary representation;computational geometry;triangular mesh generation
Abstract in different language: A computational method, called Nibble algorithm, for triangulation of non-manifold solid boundary is proposed. The algorithm is based on and incremental boundary traversal technique. The mesh generator creates a mesh element-by-element until the whole region is covered no matter the domain complexity (faces with non convex shapes and multi-connected boundaries are treated). At each step of the algorithm, a surface boundary called active boundary is evaluated in such a way that it nibbles the surface to be triangulated. The fundamental feature of this process is the definition of an area, called influence zone, which controls the node insertion and thus avoids edge intersection tests. Further, the generated mesh is refined through an extension of the Laplacian smoothing. It allows an optimization of the smoothing quality without saturating the time complexity. A new technique for adaptive smoothing is also applied in order to speed up the mesh refinement.
Rights: © Václav Skala - UNION Agency
Appears in Collections:Volume 5, number 1-3 (1997)

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

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

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