Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/13928
Title: Ray tracing surfaces of revolution : an old problem with a new perspective
Authors: Baciu, G 
Jia, J
Lam, G
Keywords: Computational complexity
Computational geometry
Lighting
Ray tracing
Rendering (computer graphics)
Issue Date: 2001
Publisher: IEEE
Source: Computer Graphics International 2001 : Proceedings, 3-6 July 2001, City University of Hong Kong, Hong Kong, p. 215-222 How to cite?
Abstract: We present a new subdivision scheme that is shown to improve the performance of ray tracing surfaces of revolution over Kajiya's (1983) classical work. This is based on a monotonic interval partitioning of a generatrix of a surface of revolution. The algorithm has a search complexity upper bound of O(log(m n)) for m monotonic intervals and n subdivisions for each interval and runs up to three times faster on large scenes. This method also suggests a novel hybrid bounding volume scheme that reduces this number of intersection tests between a ray and the actual object surface
URI: http://hdl.handle.net/10397/13928
ISBN: 0-7695-1007-8
ISSN: 1530-1052
DOI: 10.1109/CGI.2001.934677
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

WEB OF SCIENCETM
Citations

2
Last Week
0
Last month
0
Citations as of Aug 15, 2017

Page view(s)

31
Last Week
2
Last month
Checked on Aug 20, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.