Full metadata record
DC pole | Hodnota | Jazyk |
---|---|---|
dc.contributor.author | Kumar, Subodh | |
dc.contributor.editor | Skala, Václav | |
dc.date.accessioned | 2015-09-22T06:28:42Z | |
dc.date.available | 2015-09-22T06:28:42Z | |
dc.date.issued | 2000 | |
dc.identifier.citation | Journal of WSCG. 2000, vol. 8, no. 1-3. | en |
dc.identifier.issn | 1213-6972 (print) | |
dc.identifier.issn | 1213-6980 (CD-ROM) | |
dc.identifier.issn | 1213-6964 (online) | |
dc.identifier.uri | http://hdl.handle.net/11025/15824 | |
dc.identifier.uri | http://wscg.zcu.cz/wscg2000/wscg_2000_program.htm | |
dc.format | 8 s. | cs |
dc.format.mimetype | application/pdf | |
dc.language.iso | en | en |
dc.publisher | Václav Skala - UNION Agency | cs |
dc.relation.ispartofseries | Journal of WSCG | en |
dc.rights | © Václav Skala - UNION Agency | cs |
dc.subject | vykreslování | cs |
dc.subject | CAD | cs |
dc.subject | vyměřování | cs |
dc.subject | polygon | cs |
dc.subject | PSLG | cs |
dc.subject | výpočetní geometrie | cs |
dc.subject | povrch | cs |
dc.title | Robust incremental polygon triangulation for surface rendering | en |
dc.type | článek | cs |
dc.type | article | en |
dc.rights.access | openAccess | en |
dc.type.version | publishedVersion | en |
dc.description.abstract-translated | This paper presents a simple, robust and practical, yet fast algorithm for triangulation of points on the domain of trimmed Bézier surfaces. These R2 points are input to this algorithm by a surface sampler. A set of polygons is formed from these samples, which are then triangulated. We also show how to update the triangulation when the samples, and hence the polygons, are updated. The output is a set of triangle strips. The algorithm includes heuristics to avoid long and thin triangles. In addition, it also detects if the sampling of the trimming curve forms any non-simple polygons and corrects the triangulation by adding more samples. The triangulation algorithm is more generally applicable to polygons in a plane. We report an implementation of the algorithm and its performance on extensive surface-model walkthrough. | en |
dc.subject.translated | rendering | en |
dc.subject.translated | CAD | en |
dc.subject.translated | triangulation | en |
dc.subject.translated | polygon | en |
dc.subject.translated | PSLG | en |
dc.subject.translated | computational geometry | en |
dc.subject.translated | surface | en |
dc.type.status | Peer-reviewed | en |
Vyskytuje se v kolekcích: | Volume 8, number 1-3 (2000) |
Soubory připojené k záznamu:
Soubor | Popis | Velikost | Formát | |
---|---|---|---|---|
Z43.pdf | Plný text | 577,59 kB | Adobe PDF | Zobrazit/otevřít |
Použijte tento identifikátor k citaci nebo jako odkaz na tento záznam:
http://hdl.handle.net/11025/15824
Všechny záznamy v DSpace jsou chráněny autorskými právy, všechna práva vyhrazena.