Full metadata record
DC FieldValueLanguage
dc.contributor.authorBirkholz, Hermann
dc.contributor.editorSkala, Václav
dc.identifier.citationWSCG '2007: Short Communications Proceedings: The 15th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision 2007 in co-operation with EUROGRAPHICS: University of West Bohemia, Plzen, Czech Republic, January 29 – February 1, 2007, p. 1-8.en
dc.description.abstractThis paper describes a procedure that synthesizes Level-of-Detail (LoD) meshes from a tree of mesh-patches. The patch tree stores the surface of the original mesh in different detail levels. The leaf patches represent the original detail, while lower levels in the tree represent the geometry of their child nodes with less detail. Such patch trees have a coarser granularity compared to basic approaches like “edge-collapse”. This is because only complete patches can switch their detail, instead of pairs of triangles. On the other hand, it can better utilize the graphics hardware, which is capable to render preloaded patches very fast. The problem of such a patchbased LoD approach is to join the patches of different resolutions together in a smooth mesh. This problem is solved by the use of different versions of the patch borders that depend on the detail level of the neighbor patches.en
dc.format6 s., 1 prezentacecs
dc.publisherVáclav Skala - UNION Agencyen
dc.relation.ispartofseriesWSCG '2007: Short Communications Proceedingsen
dc.rights© Václav Skala - UNION Agencycs
dc.subjectmíra detailucs
dc.subjectsyntéza mřížkycs
dc.titlePatch-Trees for Fast Level-of-Detail Synthesisen
dc.typekonferenční příspěvekcs
dc.subject.translatedlevel of detailen
dc.subject.translatedmesh synthesisen
Appears in Collections:WSCG '2007: Short Communications Proceedings

Files in This Item:
File Description SizeFormat 
Birkholz.pdfPlný text954,41 kBAdobe PDFView/Open
Birkholz_prezentace.pdfPrezentace2,24 MBAdobe PDFView/Open

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

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