dc.contributor.author | Meyer, Quirin | en_US |
dc.contributor.author | Suessmuth, Jochen | en_US |
dc.contributor.author | Sussner, Gerd | en_US |
dc.contributor.author | Stamminger, Marc | en_US |
dc.contributor.author | Greiner, Guenther | en_US |
dc.date.accessioned | 2015-02-23T16:58:12Z | |
dc.date.available | 2015-02-23T16:58:12Z | |
dc.date.issued | 2010 | en_US |
dc.identifier.issn | 1467-8659 | en_US |
dc.identifier.uri | http://dx.doi.org/10.1111/j.1467-8659.2010.01737.x | en_US |
dc.description.abstract | In this paper we analyze normal vector representations. We derive the error of the most widely used representation, namely 3D floating-point normal vectors. Based on this analysis, we show that, in theory, the discretization error inherent to single precision floating-point normals can be achieved by 250.2 uniformly distributed normals, addressable by 51 bits. We review common sphere parameterizations and show that octahedron normal vectors perform best: they are fast and stable to compute, have a controllable error, and require only 1 bit more than the theoretical optimal discretization with the same error. | en_US |
dc.publisher | The Eurographics Association and Blackwell Publishing Ltd | en_US |
dc.title | On Floating-Point Normal Vectors | en_US |
dc.description.seriesinformation | Computer Graphics Forum | en_US |
dc.description.volume | 29 | en_US |
dc.description.number | 4 | en_US |
dc.identifier.doi | 10.1111/j.1467-8659.2010.01737.x | en_US |
dc.identifier.pages | 1405-1409 | en_US |