Implementing ray tracing with octrees and neighbor finding

Implementing ray tracing with octrees and neighbor finding (1989)

by Hanan Samet

Venue:	Computers And Graphics
Citations:	17 - 4 self

Datum	Value	Source
TITLE	Implementing ray tracing with octrees and neighbor finding	INFERENCE
AUTHOR NAME	Hanan Samet	SVM HeaderParse 0.2
AUTHOR AFFIL	Computer Science Department, Institute of Advanced Computer Studies and Center for Automation; Research. University of Maryland, College Park	SVM HeaderParse 0.2
AUTHOR ADDR	MD 20742	SVM HeaderParse 0.2
ABSTRACT	Abstract--A ray tracing implementation is described that is based on an octree representation of a scene. Rays are traced through the scene by calculating the blocks through which they pass. This calculation is performed in a bottom-up manner through the use of neighbor finding. The octrees are assumed to be implemented by a pointer representation. The most basic operation in computer graphics is the conversion of an internal model of a three-dimensional scene into a two-dimensional scene that lies on the viewplane. The purpose is to generate an image of the	SVM HeaderParse 0.2
YEAR	1989	INFERENCE
VENUE	Computers And Graphics	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	445--460	INFERENCE
VOLUME	13	INFERENCE
CITATIONS	29 found	ParsCit 1.0