dc.contributor.author | Daniel, M. | en_US |
dc.date.accessioned | 2014-10-21T07:44:37Z | |
dc.date.available | 2014-10-21T07:44:37Z | |
dc.date.issued | 1996 | en_US |
dc.identifier.issn | 1467-8659 | en_US |
dc.identifier.uri | http://dx.doi.org/10.1111/1467-8659.1540219 | en_US |
dc.description.abstract | Determining a tight bounding volume of all the surface normal vectors is of interest in surface modelling especially for intersection problems, in order to detect closed intersection curves. It is also important to determine quickly whether two such volumes intersect. This paper adresses both problems through the introduction of a pyramid with a convex planar base. For intersection problems, a different method has been proposed by M. Hohmeyer. The various solutions are discussed and compared. | en_US |
dc.publisher | Blackwell Science Ltd and the Eurographics Association | en_US |
dc.title | Using a Convex Pyramid to Bound Surface Normal Vectors | en_US |
dc.description.seriesinformation | Computer Graphics Forum | en_US |
dc.description.volume | 15 | en_US |
dc.description.number | 4 | en_US |
dc.identifier.doi | 10.1111/1467-8659.1540219 | en_US |
dc.identifier.pages | 219-227 | en_US |