Title: Comparisom of accelerating techniques for discontinuity meshing
Authors: Nechvíle, Karel
Tobola, Petr
Sochor, Jiří
Citation: WSCG ’2003: Short papers: The 11-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision 2003, 3.-7, p. 95-103.
Issue Date: 2003
Publisher: UNION Agency
Document type: konferenční příspěvek
conferenceObject
URI: http://wscg.zcu.cz/wscg2003/Papers_2003/H47.pdf
http://hdl.handle.net/11025/6170
ISBN: 80-903100-1-X
Keywords: globální osvětlení;nespojité mřížkování;zrychlovací techniky
Keywords in different language: global illumination;disacontinuity meshing;accelerating techniques
Abstract: Creating an appropriate mesh is one of demanding tasks of many global illumination algorithms. Discontinuity meshing proved to diminish artifacts caused by other meshing strategies. Since naive discontinuity meshing would produce a great amount of geometric computations, accelerating techniques are usually involved. In this paper, we present results obtained with help of k -discrete orientation polytopes ( k -DOPs) and oriented bounding boxes (OBBs) and compare them to previously used accelerating schemes like voxels, BSP-trees and octrees.
Rights: © UNION Agency
Appears in Collections:WSCG '2003: Short papers

Files in This Item:
File Description SizeFormat 
H47.pdfPlný text319,23 kBAdobe PDFView/Open


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

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