Delauney Triangulations and the Radiosity Approach

dc.contributor.authorSchuierer, Svenen_US
dc.date.accessioned2015-10-05T07:56:09Z
dc.date.available2015-10-05T07:56:09Z
dc.date.issued1989en_US
dc.description.abstractThe 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.seriesinformationEG 1989-Technical Papersen_US
dc.identifier.doi10.2312/egtp.19891025en_US
dc.identifier.issn1017-4656en_US
dc.identifier.urihttps://doi.org/10.2312/egtp.19891025en_US
dc.publisherEurographics Associationen_US
dc.titleDelauney Triangulations and the Radiosity Approachen_US
Files