| Title: | Robust incremental polygon triangulation for surface rendering |
| Authors: | Kumar, Subodh |
| Citation: | Journal of WSCG. 2000, vol. 8, no. 1-3. |
| Issue Date: | 2000 |
| Publisher: | Václav Skala - UNION Agency |
| Document type: | článek article |
| URI: | http://hdl.handle.net/11025/15824 http://wscg.zcu.cz/wscg2000/wscg_2000_program.htm |
| ISSN: | 1213-6972 (print) 1213-6980 (CD-ROM) 1213-6964 (online) |
| Keywords: | vykreslování;CAD;vyměřování;polygon;PSLG;výpočetní geometrie;povrch |
| Keywords in different language: | rendering;CAD;triangulation;polygon;PSLG;computational geometry;surface |
| Abstract in different language: | 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. |
| Rights: | © Václav Skala - UNION Agency |
| Appears in Collections: | Volume 8, number 1-3 (2000) |
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11025/15824Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.