Interval Analysis For Computer Graphics

Interval Analysis For Computer Graphics (1992)

by John M. Snyder

Venue:	Computer Graphics
Citations:	124 - 2 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Interval Analysis For Computer Graphics	user correction - Legacy Corrections
AUTHOR NAME	John M. Snyder	SVM HeaderParse 0.2
AUTHOR AFFIL	California Institute of Technology	SVM HeaderParse 0.2
AUTHOR ADDR	Pasadena, CA 91125	SVM HeaderParse 0.2
ABSTRACT	This paper discusses how interval analysis can be used to solve a wide variety of problems in computer graphics. These problems include ray tracing, interference detection, polygonal decomposition of parametric surfaces, and CSG on solids bounded by parametric surfaces. Only two basic algorithms are required: SOLVE, which computes solutions to a system of constraints, and MINIMIZE, which computes the global minimum of a function, subject to a system of constraints. We present algorithms for SOLVE and MINIMIZE using interval analysis as the conceptual framework. Crucial to the technique is the creation of "inclusion functions" for each constraint and function to be minimized. Inclusion functions compute a bound on the range of a function, given a similar bound on its domain, allowing a branch and bound approach to constraint solution and constrained minimization. Inclusion functions also allow the MINIMIZE algorithm to compute global rather than local minima, unlike many other numerica...	user correction - Legacy Corrections
YEAR	1992	INFERENCE
VENUE	Computer Graphics	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	121--130	INFERENCE
VOLUME	26	INFERENCE
CITATIONS	20 found	ParsCit 1.0