Delauney Triangulations and the Radiosity Approach

dc.contributor.author	Schuierer, Sven	en_US
dc.date.accessioned	2015-10-05T07:56:09Z
dc.date.available	2015-10-05T07:56:09Z
dc.date.issued	1989	en_US
dc.description.abstract	The radiosity approach requires the subdivision of complex surfaces into simple components called patches. Since we assume to have constant intensity over a patch, the generation of regular patches is a desirable property of the subdivision algorithm. We show that constrained Delaunay triangulations produce patches that are as close to equilateral triangles as possible and thus are well suited for the partitioning of surfaces into patches. Since a number of optimal algorithms to generate constrained Delaunay triangulations have been published, the implementation presented here made use of the earlier work. The implementation consists of a rather simple modeling tool called POLY, a fast triangulation algorithm for arbitrary polygons and the form factor computation combined with a z-buffer output module.	en_US
dc.description.seriesinformation	EG 1989-Technical Papers	en_US
dc.identifier.doi	10.2312/egtp.19891025	en_US
dc.identifier.issn	1017-4656	en_US
dc.identifier.uri	http://dx.doi.org/10.2312/egtp.19891025	en_US
dc.publisher	Eurographics Association	en_US
dc.title	Delauney Triangulations and the Radiosity Approach	en_US