Title: Polygonization by the Edge Spinning
Authors: Čermák, Martin
Skala, Václav
Citation: ALGORITMY 2002, p. 245-252.
Issue Date: 2002
Publisher: Slovenská technická univerzita v Bratislavě
Document type: konferenční příspěvek
conferenceObject
URI: http://hdl.handle.net/11025/11436
ISBN: 80-227-1750-9
Keywords: implicitní plochy;triangulace;pochodující trojúhelníky;polygonizace
Keywords in different language: implicit surfaces;triangulation;marching triangles;polygonization
Abstract: This paper presents a new method for polygonization of implicit surfaces. Our method put emphasis on the shape of triangles of the resulting polygonal mesh. The main advantages of the triangulation presented are simplicity and the stable features that can be used for next expanding. The implementation is not complicated and only the standard data structures are used. This algorithm is based on the surface tracking scheme and it is compared with the other algorithms which are based on the similar principle, such as the Marching cubes and the Marching triangles algorithms.
Appears in Collections:Konferenční příspěvky / Conference Papers (KIV)

Files in This Item:
File Description SizeFormat 
Skala_2002_Polygonization-Algoritmy.pdfPlný text600,75 kBAdobe PDFView/Open    Request a copy


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

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