Full metadata record
DC FieldValueLanguage
dc.contributor.authorČermák, Martin
dc.contributor.authorSkala, Václav
dc.date.accessioned2014-08-19T11:55:33Z
dc.date.available2014-08-19T11:55:33Z
dc.date.issued2002
dc.identifier.citationInternational Conference on Computer Vision and Graphics, p. 174-179.cs
dc.identifier.isbn8391768309
dc.identifier.urihttp://hdl.handle.net/11025/11696
dc.description.abstractThis paper presents a new modification of one method for polygonization of implicit surfaces. The algoritm puts emphasis on the quality of polygonal mesh and on the polygonization speed. 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 marching cubes algorithm that is based on similar principle. Experimental results prove quality and efficiency of acceleration technique used for such type of geometric algorithm.en
dc.format8 s.cs
dc.format.mimetypeapplication/pdf
dc.language.isoenen
dc.publisherSilesian University of Technologycs
dc.relation.ispartofseriesInternational Conference on Computer Vision and Graphicsen
dc.rightsPlný text není přístupný.cs
dc.subjectimplicitní plochycs
dc.subjectpolygonizacecs
dc.subjecttriangulacecs
dc.subjectzrychlenícs
dc.subjectpochodující metodacs
dc.titleAccelerated Edge Spinning Algorithm for Implicit Surfacesen
dc.typekonferenční příspěvekcs
dc.typeconferenceObjecten
dc.rights.accessclosedAccessen
dc.type.versionpublishedVersionen
dc.subject.translatedimplicit surfacesen
dc.subject.translatedpolygonizationen
dc.subject.translatedtriangulationen
dc.subject.translatedaccelerationen
dc.subject.translatedmarching methoden
dc.type.statusPeer-revieweden
Appears in Collections:Konferenční příspěvky / Conference Papers (KIV)

Files in This Item:
File Description SizeFormat 
Skala_2002_EdgeSpinning_Cermak.pdfPlný text730,01 kBAdobe PDFView/Open    Request a copy


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

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