Context Navigation

← Previous Revision
Latest Revision
Next Revision →
Normal
Revision Log

renmame.bib @ 243

Revision 243, 108.7 KB checked in by bittner, 19 years ago (diff)
SciReport? template

Rev	Line
[243]	1
	2	@InProceedings{Niepel:1995:SCD,
	3	author = "L. Niepel and J. Martinka and A. Ferko and P. Elias",
	4	title = "On Scene Complexity Definition for Rendering",
	5	booktitle = "Winter School of Computer Graphics 1995",
	6	year = "1995",
	7	month = feb,
	8	note = "held at University of West Bohemia, Plzen, Czech
	9	Republic, 14-18 February 1995",
	10	who = "Havran Vlastimil: REN-0001",
	11	}
	12
	13	@TechReport{Snyder96,
	14	author = "J. M. Snyder",
	15	title = "Area Light Sources for Real-Time Graphics",
	16	pages = 30,
	17	institution = "Microsoft Research",
	18	year = 1996,
	19	month = mar,
	20	number = "MSR-TR-96-11",
	21	who = "Havran Vlastimil: REN-0002",
	22	}
	23
	24	@InProceedings{Keller:1997:IR,
	25	author = "Alexander Keller",
	26	title = "Instant Radiosity",
	27	booktitle = "SIGGRAPH 97 Conference Proceedings",
	28	editor = "Turner Whitted",
	29	series = "Annual Conference Series",
	30	year = "1997",
	31	organization = "ACM SIGGRAPH",
	32	publisher = "Addison Wesley",
	33	month = aug,
	34	pages = "49--56",
	35	note = "ISBN 0-89791-896-7",
	36	keywords = "Radiance equation, radiosity, shading, Monte Carlo
	37	integration, quasi-Monte Carlo integration,
	38	quasi-random walk, jittered low discrepancy sampling,
	39	hardware, accumulation buffer, realtime rendering
	40	algorithms, photorealism",
	41	annote = "We present a fundamental procedure for instant
	42	rendering from the radiance equation. Operating
	43	directly on the textured scene description, the very
	44	efficient and simple algorithm produces photorealistic
	45	images without any finite element kernel or solution
	46	discretization of the underlying integral equation.
	47	Rendering rates of a few seconds are obtained by
	48	exploiting graphics hardware, the deterministic
	49	technique of the quasi-random walk for the solution of
	50	the global illumination problem, and the new method of
	51	jittered low discrepancy sampling.",
	52	who = "Havran Vlastimil: REN-0003",
	53	}
	54
	55	@Article{Tiede:1990:IMA,
	56	author = "Ulf Tiede and Karl Heinz Hoehne and Michael Bomans and
	57	Andreas Pommert and Martin Riemer and Gunnar Wiebecke",
	58	title = "Investigation of Medical {3D}-Rendering Algorithms",
	59	journal = "IEEE Computer Graphics and Applications",
	60	volume = "10",
	61	number = "2",
	62	pages = "41--53",
	63	month = mar,
	64	year = "1990",
	65	coden = "ICGADZ",
	66	ISSN = "0272-1716",
	67	bibdate = "Sat Jan 25 06:42:48 MST 1997",
	68	acknowledgement = ack-nhfb,
	69	affiliation = "Univ Hospital Eppendorf, Inst of Math \& Comput Sci in
	70	Med, Hamburg, West Ger",
	71	classification = "461; 723",
	72	journalabr = "IEEE Comput Graphics Appl",
	73	keywords = "Biomedical Engineering; Computer Graphics --- Medical
	74	Applications; Computer Programming --- Algorithms;
	75	Computerized Tomography; Gradient Shading; Magnetic
	76	Resonance --- Imaging Techniques; Shading Algorithms;
	77	Surface Rendering; surface rendering",
	78	who = "Havran Vlastimil: REN-0004",
	79	}
	80
	81	@Article{George:1990:RRD,
	82	author = "David W. George and Fran{\c{c}}ois X. Sillion and
	83	Donald P. Greenberg",
	84	title = "Radiosity Redistribution for Dynamic Environments",
	85	journal = "IEEE Computer Graphics and Applications",
	86	volume = "10",
	87	number = "4",
	88	pages = "26--34",
	89	month = jul,
	90	year = "1990",
	91	coden = "ICGADZ",
	92	ISSN = "0272-1716",
	93	bibdate = "Sat Jan 25 06:42:48 MST 1997",
	94	acknowledgement = ack-nhfb,
	95	affiliation = "Cornell Univ, Ithaca, NY, USA",
	96	annote = "They present a modification to the progressive
	97	radiosity to allow faster radiosity computation for
	98	animation sequences where objects can be added, moved,
	99	removed or their surface changed properties. When an
	100	object is added, radiosity is shot onto these new
	101	patches. A shadow volume is determined and a negative
	102	radiosity is shot to the patches in shadow. When an
	103	object is moved, it is removed from the scene and added
	104	to the new position, the radiosity being recomputed at
	105	each step. The radiosity recomputed is based on two
	106	strategies: redistribute first or interleave
	107	redistribution and propagation. Some heuristics are
	108	presented to choose the most important patches. This
	109	solution is good when just a few objects are involved
	110	but as the complexity of the scenes and mostly moving
	111	objects increases, the algorithm lost of its
	112	interest.",
	113	classification = "723",
	114	journalabr = "IEEE Comput Graphics Appl",
	115	keywords = "Computer Graphics; Computer Software --- Applications;
	116	Interactive; radiosity, animation, interaction, shadow,
	117	negative radiosity; Shading; Shadowing",
	118	who = "Havran Vlastimil: REN-0005",
	119	}
	120
	121	@TechReport{EVL-1997-43,
	122	author = "M. Stamminger and Ph. Slusallek and H.-P. Seidel",
	123	title = "Bounded Clustering -- Finding Good Bounds on Clustered
	124	Light Transport",
	125	number = "2",
	126	institution = "Universit{\"a}t Erlangen-N{\"u}rnberg",
	127	year = "1997",
	128	note = "submitted for publication",
	129	abstract = "Clustering is a very efficient technique for applying
	130	finite element methods to the computation of global
	131	illumination of complex scenes. Both computation time
	132	and memory consumption can be reduced dramatically by
	133	grouping the primitives of the input scene into a
	134	hierarchy of clusters and allowing for light exchange
	135	between all levels of this hierarchy. One problem with
	136	clustering methods, however, has been to determine good
	137	bounds on the exchange of light between nodes in the
	138	hierarchy. In this paper, we propose a set of methods
	139	applicable to both clusters and surface patches that
	140	allows for computing conservative but tight error
	141	bounds on the light transport between clusters and
	142	surface patches. Their intrinsic properties can be
	143	exploited by splitting the computation of bounds into a
	144	set of related methods, applicable to any object. The
	145	resulting algorithm abstracts from the nature of the
	146	interacting objects -- light transport between
	147	clusters, planar patches and even curved surfaces can
	148	be efficiently approximated and bound by a single set
	149	of methods.",
	150	evlib-url = "http://infovis.zib.de:8000/Dienst/UI/2.0/Describe/evl.surfacerendering%2FEVL-1997-43",
	151	evlib-revision = "1st",
	152	who = "Havran Vlastimil: REN-0006",
	153	}
	154
	155	@InProceedings{EVL-1997-38,
	156	author = "M. Stamminger and W. Nitsch and Ph. Slusallek",
	157	title = "Isotropic Clustering for Hierarchical Radiosity --
	158	Implementation and Experiences",
	159	booktitle = "Proc. Fifth International Conference in Central Europe
	160	on Computer Graphics and Visualization '97",
	161	year = "1997",
	162	abstract = "Although Hierarchical Radiosity was a big step forward
	163	for finite element computations in the context of
	164	global illumination, the algorithm can hardly cope with
	165	scenes of more than medium complexity. The reason is
	166	that Hierarchical Radiosity requires an initial linking
	167	step, comparing all pairs of initial objects in the
	168	scene. These initial objects are then hierarchically
	169	subdivided in order to accurately represent the light
	170	transport between them. Isotropic Clustering, as
	171	introduced by Sillion, in addition creates a hierarchy
	172	above the input objects. Thus, it allows for the
	173	interaction of complete clusters of objects and avoids
	174	the costly initial linking step. In this paper, we
	175	describe our implementation of the isotropic clustering
	176	algorithm and discuss some of the problems that we
	177	encountered. The complexity of the algorithm is
	178	examined and clustering strategies are compared.",
	179	postscript-url = "ftp://faui90.informatik.uni-erlangen.de/pub/Publications/1997/Publ.1997.3.ps.gz",
	180	evlib-url = "http://infovis.zib.de:8000/Dienst/UI/2.0/Describe/evl.surfacerendering%2FEVL-1997-38",
	181	evlib-revision = "1st",
	182	who = "Havran Vlastimil: REN-0007",
	183	}
	184
	185	@InProceedings{Shirley95-GIDE,
	186	author = "Peter Shirley and Bretton Wade and Philip M. Hubbard
	187	and David Zareski and Bruce Walter and Donald P.
	188	Greenberg",
	189	year = "1995",
	190	title = "Global {Illumination} via {Density} {Estimation}",
	191	booktitle = "Rendering Techniques '95 (Proceedings of the Sixth
	192	Eurographics Workshop on Rendering)",
	193	pages = "219--230",
	194	publisher = "Springer-Verlag",
	195	address = "New York, NY",
	196	who = "Havran Vlastimil: REN-0008",
	197	}
	198
	199	@InProceedings{Arvo:1990:PTI,
	200	author = "James Arvo and David Kirk",
	201	editor = "Forest Baskett",
	202	title = "Particle Transport and Image Synthesis",
	203	booktitle = "Computer Graphics (Proceedings of SIGGRAPH'90)",
	204	pages = "63--66",
	205	month = aug,
	206	year = "1990",
	207	annote = "The rendering equation is similar to the linear
	208	Boltzmann equation which has been widely studied in
	209	physics and nuclear engineering. Consequently, many of
	210	the powerful techniques which have been developed in
	211	these fields can be applied to problems in image
	212	synthesis. In this paper we adapt several statistical
	213	techniques commonly used in neutron transport to
	214	stachastic ray tracing and, more generally, to Monte
	215	Carlo solution of the rendering equation. First, we
	216	describe a technique known as {\em Russian roulette}
	217	which can be used to terminate the recursive tracing of
	218	rays without introducing statistical bias. We also
	219	examine the practice of creating ray trees in classical
	220	ray tracing in the light of a well-known technique in
	221	particle transport known as {\em splitting}. We show
	222	that neither ray trees nor paths as described in
	223	[Kaj86] constitute an optimal sampling plan in
	224	themselves and that a hybrid may be more efficient.",
	225	conference = "held in Dallas, Texas; 6--10 August 1990",
	226	keywords = "Boltzmann equation, Monte Carlo, particle transport,
	227	radiosity, ray tracing, rendering equation",
	228	who = "Havran Vlastimil: REN-0009",
	229	}
	230
	231	@InProceedings{Interrante:1997:ISS,
	232	author = "Victoria L. Interrante",
	233	title = "Illustrating Surface Shape in Volume Data via
	234	Principal Direction-Driven 3{D} Line Integral
	235	Convolution",
	236	booktitle = "SIGGRAPH 97 Conference Proceedings",
	237	editor = "Turner Whitted",
	238	series = "Annual Conference Series",
	239	year = "1997",
	240	organization = "ACM SIGGRAPH",
	241	publisher = "Addison Wesley",
	242	month = aug,
	243	pages = "109--116",
	244	note = "ISBN 0-89791-896-7",
	245	keywords = "visualization, transparent surfaces, shape
	246	representation, principal directions, stroke textures,
	247	line integral convolution, solid texture, isosurfaces,
	248	volume rendering",
	249	annote = "This paper describes how the set of principal
	250	directions and principal curvatures can be understood
	251	to define a natural {"}flow{"} over the surface of an
	252	object and, as such, can be used to guide the placement
	253	of the lines of a stroke texture that seeks to
	254	represent 3D shape in a perceptually intuitive way. The
	255	driving application for this work is the visualization
	256	of layered isovalue surfaces in volume data, where the
	257	particular identity of an individual surface is not
	258	generally known a priori and observers will typically
	259	wish to view a variety of different level surfaces from
	260	the same distribution, superimposed over underlying
	261	opaque structures. This paper describes how, by
	262	advecting an evenly distributed set of tiny opaque
	263	particles, and the empty space between them, via 3D
	264	line integral convolution through the vector field
	265	defined by the principal directions and principal
	266	curvatures of the level surfaces passing through each
	267	gridpoint of a 3D volume, it is possible to generate a
	268	single scan-converted solid stroke texture that can be
	269	used to illustrate the essential shape information of
	270	any level surface in the data. By redefining the length
	271	of the filter kernel according to the magnitude of the
	272	maximum principal curvature of the level surface at
	273	each point around which the convolution is applied, one
	274	can generate longer strokes over more the highly curved
	275	areas, where the directional information is both most
	276	stable and most relevant, and at the same time downplay
	277	the visual impact of the directional information
	278	indicated by the stroke texture in the flatter regions.
	279	In a voxel-based approach such as this one, stroke
	280	narrowness will be constrained by the resolution of the
	281	volume within which the texture is represented.
	282	However, by adaptively indexing into multiple
	283	pre-computed texture volumes, obtained by advecting
	284	particles of increasing sizes, one may selectively
	285	widen the strokes at any point by a variable amount,
	286	determined at the time of rendering, to reflect shading
	287	information or any other function defined over the
	288	volume data.",
	289	who = "Havran Vlastimil: REN-0010",
	290	}
	291
	292	@InProceedings{salesin90a,
	293	author = "David Salesin and Jorge Stolfi",
	294	title = "Rendering {CSG} Models with a {ZZ}-Buffer",
	295	pages = "67--76",
	296	booktitle = "Computer Graphics (SIGGRAPH '90 Proceedings)",
	297	volume = "24",
	298	number = "4",
	299	year = "1990",
	300	month = aug,
	301	editor = "Forest Baskett",
	302	conference = "held in Dallas, Texas; 6-10 August 1990",
	303	keywords = "ray tracing, antialiasing, constructive solid
	304	geometry, transparent surfaces, display buffers,
	305	visible-surface algorithms, rendering algorithms",
	306	annote = "The ZZ-buffer is a simple acceleration scheme for ray
	307	tracing that can be applied to a wide variety of
	308	scenes, including those with small features, textured
	309	and transparent surfaces, shadows and penubrae, and
	310	depth-of-field effects. In this paper, we describe how
	311	the ZZ-buffer algorithm can be adapted to the rendering
	312	of scenes defined by constructive solid geometry.",
	313	who = "Havran Vlastimil: REN-0011",
	314	}
	315
	316	@InProceedings{oikarinen97a,
	317	author = "Jarkko OIKARINEN and Lasse JYRKINEN",
	318	title = "Maximum Intensity Projection by 3-Dimensional Seed Filling
	319	in View Lattice",
	320	pages = "173--183",
	321	booktitle = "Proceedings of {\em Compugraphics'97}",
	322	keywords = "volume visualization, three-dimensional (3D) Imaging, Ray Casting,
	323	Volume Rendering, Medical Application",
	324	year = "1997",
	325	month = dec,
	326	who = "Havran Vlastimil: REN-0012",
	327	}
	328
	329	@Article{Brotman:1984:GSS,
	330	author = "Lynne Shapiro Brotman and Norman I. Badler",
	331	title = "Generating Soft Shadows with a Depth Buffer
	332	Algorithm",
	333	journal = "IEEE Computer Graphics and Applications",
	334	volume = "4",
	335	number = "10",
	336	pages = "5--12",
	337	month = oct,
	338	year = "1984",
	339	coden = "ICGADZ",
	340	ISSN = "0272-1716",
	341	bibdate = "Wed Jan 29 06:09:24 1997",
	342	acknowledgement = ack-nhfb,
	343	classification = "723",
	344	journalabr = "IEEE Comput Graphics Appl",
	345	keywords = "computer graphics; computer programming;
	346	computer-synthesized shadows; depth buffer algorithm;
	347	penumbra; shadow, I37 soft shadow, I37 shadow penumbra;
	348	soft shadows; visible surface rendering",
	349	who = "Havran Vlastimil: REN-0013",
	350	}
	351
	352	@InProceedings{Fang:1996:DVR,
	353	title = "Deformable Volume Rendering by {3D} Texture Mapping
	354	and Octree Encoding",
	355	author = "Shiaofen Fang and Rajagopalan Srinivasan and Su Huang
	356	and Ragu Raghavan",
	357	booktitle = "IEEE Visualization '96",
	358	organization = "IEEE",
	359	year = "1996",
	360	month = oct,
	361	note = "ISBN 0-89791-864-9",
	362	who = "Havran Vlastimil: REN-0014",
	363	}
	364
	365	@InProceedings{Reitan97a,
	366	author = "Paula J. Reitan",
	367	title = "3D Visualization of Truecolor Image Histograms",
	368	pages = "320--328",
	369	booktitle = "Proceedings of {\em Compugraphics'97}",
	370	keywords = "3D tree drawing, 3D data structures, truecolor image histograms",
	371	year = "1997",
	372	month = dec,
	373	who = "Havran Vlastimil: REN-0015",
	374	}
	375
	376	@InProceedings{EVL-1997-127,
	377	author = "Bruce Walter and G{\"{u}}n Alppay and Eric P. F.
	378	Lafortune and Sebastian Fernandez and Donald P.
	379	Greenberg",
	380	editor = "Turner Whitted",
	381	title = "Fitting Virtual Lights For Non-Diffuse Walkthroughs",
	382	booktitle = "SIGGRAPH 97 Conference Proceedings",
	383	series = "Annual Conference Series",
	384	pages = "45--48",
	385	publisher = "Addison Wesley",
	386	month = aug,
	387	year = "1997",
	388	keywords = "interactive walkthroughs, non-diffuse appearance,
	389	global illumination, Phong shading",
	390	language = "en",
	391	abstract = "This paper describes a technique for using a simple
	392	shading method, such as the Phong lighting model, to
	393	approximate the appearance calculated by a more
	394	accurate method. The results are then suitable for
	395	rapid display using existing graphics hardware and
	396	portable via standard graphics API's. Interactive
	397	walkthroughs of view-independent nondiffuse global
	398	illumination solutions are explored as the motivating
	399	application.",
	400	note = "ISBN 0-89791-896-7",
	401	evlib-url = "http://visinfo.zib.de:80/Dienst/UI/2.0/Describe/evl.computergraphics%2FEVL-1997-127",
	402	evlib-revision = "1st",
	403	organization = "ACM SIGGRAPH",
	404	who = "Havran Vlastimil: REN-0016",
	405	}
	406
	407	@Article{Verbeck:1984:CLD,
	408	author = "Channing P. Verbeck and Donald P. Greenberg",
	409	title = "A Comprehensive Light-Source Description for Computer
	410	Graphics",
	411	journal = "IEEE Computer Graphics and Applications",
	412	volume = "4",
	413	number = "7",
	414	pages = "66--75",
	415	month = jul,
	416	year = "1984",
	417	coden = "ICGADZ",
	418	ISSN = "0272-1716",
	419	bibdate = "Sat Jan 25 06:42:48 MST 1997",
	420	acknowledgement = ack-nhfb,
	421	classification = "723; 741",
	422	journalabr = "IEEE Comput Graphics Appl",
	423	keywords = "computer generated images; computer graphics ---
	424	Imaging Techniques; light sources; light, I34 Ray
	425	Tracing, I37 Light-Source Description; ray-tracing
	426	system",
	427	who = "Havran Vlastimil: REN-0017",
	428	}
	429
	430	@InProceedings{Lafortune95-FTRVM,
	431	author = "Eric P. Lafortune and Yves D. Willems",
	432	editor = "P. M. Hanrahan and W. Purgathofer",
	433	year = "1995",
	434	title = "A 5{D} {Tree} to {Reduce} the {Variance} of {Monte}
	435	{Carlo} {Ray} {Tracing}",
	436	booktitle = "Rendering Techniques '95 (Proceedings of the Sixth
	437	Eurographics Workshop on Rendering)",
	438	pages = "11--20",
	439	publisher = "Springer-Verlag",
	440	address = "New York, NY",
	441	keywords = "Monte Carlo, ray tracing, illumination caching",
	442	comments = "ISBN 3-211-82733-1",
	443	who = "Havran Vlastimil: REN-0018",
	444	}
	445
	446	@InProceedings{Tobler:1997:HSA,
	447	author = "Robert F. Tobler and Alexander Wilkie and Martin Feda
	448	and Werner Purgathofer",
	449	title = "A Hierarchical Subdivision Algorithm for Stochastic
	450	Radiosity Methods",
	451	booktitle = "Eurographics Rendering Workshop 1997",
	452	editor = "Julie Dorsey and Philipp Slusallek",
	453	year = "1997",
	454	organization = "Eurographics",
	455	publisher = "Springer Wein",
	456	address = "New York City, NY",
	457	month = jun,
	458	pages = "193--204",
	459	note = "ISBN 3-211-83001-4",
	460	keywords = "radiosity, stochastic, Monte Carlo, hierarchical,
	461	Galerkin",
	462	annote = "The algorithm proposed in this paper uses a stochastic
	463	approach to incrementally calculate the illumination
	464	function over a surface. By tracking the illumination
	465	function at different levels of meshing resolution, it
	466	is possible to get a measure for the quality of the
	467	current representation, and to adoptively subdivide in
	468	places with inadequate accuracy. With this technique a
	469	hierarchical mesh that is based on the stochastic
	470	evaluation of global illumination is generated.",
	471	who = "Havran Vlastimil: REN-0019",
	472	}
	473
	474	@TechReport{EVL-1995-11,
	475	author = "E. Gr{\"o}ller and W. Purgathofer",
	476	title = "Coherence in Computer Graphics",
	477	type = "Research paper",
	478	institution = "Institute for Computer Graphics, Technical University
	479	Vienna",
	480	year = "1995",
	481	abstract = "Coherence denotes similarities between items or
	482	entities. It describes the extent to which these items
	483	or entities are locally constant. An introduction to
	484	coherence and a survey of various types of coherence,
	485	that are used in computer graphics, are given.
	486	Techniques and data structures for exploiting coherence
	487	in computer graphics are described. Incremental
	488	techniques, bounding volume schemes, subdivision
	489	techniques and several geometric data structures are
	490	discussed in more detail. Applications of coherence
	491	principles to computer graphics are treated and a
	492	survey of previous research is done.",
	493	postscript-url = "ftp://ftp.cg.tuwien.ac.at/pub/TR/95/TR-186-2-95-04Paper.ps.gz",
	494	evlib-url = "http://infovis.zib.de:8000/Dienst/UI/2.0/Describe/evl.computergraphics%2FEVL-1995-11",
	495	evlib-revision = "1st",
	496	who = "Havran Vlastimil: REN-0020",
	497	}
	498
	499
	500	@InProceedings{Veach94-BELT,
	501	author = "Eric Veach and Leonidas Guibas",
	502	month = jun,
	503	year = "1994",
	504	title = "Bidirectional {Estimators} for {Light} {Transport}",
	505	booktitle = "Fifth Eurographics Workshop on Rendering",
	506	pages = "147--162",
	507	address = "Darmstadt, Germany",
	508	keywords = "Monte Carlo, sampling noise, variance reduction, light
	509	transport, importance transport",
	510	who = "Havran Vlastimil: REN-0021",
	511	}
	512
	513	@TechReport{EVL-1997-19,
	514	author = "Dieter Schmalstieg",
	515	title = "A Survey of Advanced Interactive 3-{D} Graphics
	516	Techniques",
	517	type = "Research paper",
	518	institution = "Institute of Computer Graphics, Vienna University of
	519	Technology",
	520	year = "1997",
	521	abstract = "Interactive 3-D Graphics are a new emerging field
	522	enabled by powerful and cost-effective computer
	523	systems. The goal is to present a three-dimensional
	524	image of a scene stored in a computer to give a human
	525	user the impression that he or she is looking at a
	526	virtual world. In producing such an illusion, we would
	527	like to always be able to produce images that match or
	528	exceed the limits of human visual perception in all
	529	aspects. Unfortunately, limitations in the performance
	530	of the image generators we employ for this task defeat
	531	this goal. The ever-increasing demands of applications
	532	make it unlikely that this situation will ever change
	533	significantly. Working solutions require us to trade
	534	off image fidelity for graphical complexity and
	535	performance of the application. In doing so, it is
	536	vital to understand those human factors that dominate
	537	the perception of interactive 3-D computer graphics.",
	538	postscript-url = "ftp://ftp.cg.tuwien.ac.at/pub/TR/97/TR-186-2-97-05Paper.ps.gz",
	539	evlib-url = "http://infovis.zib.de:8000/Dienst/UI/2.0/Describe/evl.computergraphics%2FEVL-1997-19",
	540	evlib-revision = "1st",
	541	evlib-postscript-md5 = "7f854b51437fbc452dd968e6dfc5d18b",
	542	who = "Havran Vlastimil: REN-0022",
	543	}
	544
	545	@Article{Woo:1990:SSA,
	546	author = "Andrew Woo and Pierre Poulin and Alain Fournier",
	547	title = "A Survey of Shadow Algorithms",
	548	journal = "IEEE Computer Graphics and Applications",
	549	volume = "10",
	550	number = "6",
	551	pages = "13--32",
	552	month = nov,
	553	year = "1990",
	554	coden = "ICGADZ",
	555	ISSN = "0272-1716",
	556	bibdate = "Sat Jan 25 06:42:48 MST 1997",
	557	acknowledgement = ack-nhfb,
	558	affiliation = "Alias Research, Toronto, Ont, Canada",
	559	annote = "Essential to realistic and visually appealing images,
	560	shadows are difficult to compute in most display
	561	environments. This survey characterizes the various
	562	types of shadows. It also describes most existing
	563	shadow algorithms and discusses their complexities,
	564	advantages, and shortcomings. We examine hard shadows,
	565	soft shadows, shadows of transparent objects, and
	566	shadows for complex modeling primitives. For each type,
	567	we examine shadow algorithms within various rendering
	568	techniques. \\ This survey attempts to provide readers
	569	with enough background and insight on the various
	570	methods to allow them to choose the algorithm best
	571	suited to their needs. We also hope that our analysis
	572	will help identify the areas that need more research
	573	and point to possible solutions.",
	574	classification = "723; 741",
	575	journalabr = "IEEE Comput Graphics Appl",
	576	keywords = "Bidirectional Ray Tracing; Computer Graphics; Hard
	577	Shadow Generation; Image Processing; Image Rendering;
	578	Shadow Algorithms; Shadow Volumes; Soft Shadow
	579	Generation; survey",
	580	who = "Havran Vlastimil: REN-0023",
	581	}
	582
	583	@InProceedings{Greenberg:1997:FRI,
	584	author = "Donald P. Greenberg and Kenneth E. Torrance and Peter
	585	Shirley and James Arvo and James A. Ferwerda and
	586	Sumanta Pattanaik and Eric P. F. Lafortune and Bruce
	587	Walter and Sing-Choong Foo and Ben Trumbore",
	588	title = "A Framework for Realistic Image Synthesis",
	589	booktitle = "SIGGRAPH 97 Conference Proceedings",
	590	editor = "Turner Whitted",
	591	series = "Annual Conference Series",
	592	year = "1997",
	593	organization = "ACM SIGGRAPH",
	594	publisher = "Addison Wesley",
	595	month = aug,
	596	pages = "477--494",
	597	note = "ISBN 0-89791-896-7",
	598	keywords = "Realistic Image Synthesis, Light Reflection,
	599	Perception",
	600	annote = "Our goal is to develop physically based lighting
	601	models and perceptually based rendering procedures for
	602	computer graphics that will produce synthetic images
	603	that are visually and measurably indistinguishable from
	604	real-world images. Fidelity of the physical simulation
	605	is of primary concern. Our research framework is
	606	subdivided into three sub-sections: the local light
	607	reflection model, the energy transport simulation, and
	608	the visual display algorithms. The first two
	609	subsections are physically based, and the last is
	610	perceptually based. We emphasize the comparisons
	611	between simulations and actual measurements, the
	612	difficulties encountered, and the need to utilize the
	613	vast amount of psychophysical research already
	614	conducted. Future research directions are enumerated.
	615	We hope that results of this research will help
	616	establish a more fundamental, scientific approach for
	617	future rendering algorithms. This presentation
	618	describes a chronology of past research in global
	619	illumination and how parts of our new system are
	620	currently being developed.",
	621	who = "Havran Vlastimil: REN-0024",
	622	}
	623
	624
	625	@InProceedings{Stewart:1997:HVT,
	626	author = "A. James Stewart",
	627	title = "Hierarchical Visibility in Terrains",
	628	booktitle = "Proceedings of Eurographics Rendering Workshop '97",
	629	year = "1997",
	630	pages = "217--228",
	631	annote = "This paper describes a hierarchical visibility
	632	technique that significantly accelerates terrain
	633	rendering. With this technique, large parts of the
	634	terrain that are hidden from the viewpoint are culled,
	635	thus avoiding the expense of uselessly sending them
	636	down the graphics pipeline (only to find in the
	637	z-buffer step that they are hidden). The hierarchical
	638	visibility technique has been implemented in a
	639	multiresolution terrain rendering algorithm and
	640	experimental results show very large speedups in some
	641	situations.",
	642	who = "Havran Vlastimil: REN-0025",
	643	}
	644
	645	@Article{Sillion:1997:EIM,
	646	author = "Francois Sillion and George Drettakis and Benoit
	647	Bodelet",
	648	title = "Efficient Impostor Manipulation for Real-Time
	649	Visualization of Urban Scenery",
	650	journal = "Com{\-}pu{\-}ter Graphics Forum",
	651	volume = "16",
	652	number = "3",
	653	pages = "C207--C218",
	654	month = sep # " 4--8",
	655	year = "1997",
	656	coden = "CGFODY",
	657	ISSN = "0167-7055",
	658	bibdate = "Tue Mar 17 15:44:38 MST 1998",
	659	acknowledgement = ack-nhfb,
	660	affiliation = "INRIA",
	661	affiliationaddress = "Grenoble, Fr",
	662	classification = "722.4; 723; 723.2; 723.3; 723.5",
	663	journalabr = "Comput Graphics Forum",
	664	keywords = "Algorithms; Computer simulation; Database systems;
	665	Image segmentation; Interactive computer systems;
	666	Interactive visualization systems; Real time systems;
	667	Three dimensional computer graphics; Urban scenes;
	668	Virtual reality; Visualization",
	669	who = "Havran Vlastimil: REN-0026",
	670	}
	671
	672	@InProceedings{Schaufler:1997:NRP,
	673	author = "Gernot Schaufler",
	674	title = "Nailboards: {A} Rendering Primitive for Image Caching
	675	in Dynamic Scenes",
	676	booktitle = "Eurographics Rendering Workshop 1997",
	677	editor = "Julie Dorsey and Philipp Slusallek",
	678	year = "1997",
	679	organization = "Eurographics",
	680	publisher = "Springer Wein",
	681	address = "New York City, NY",
	682	month = jun,
	683	pages = "151--162",
	684	note = "ISBN 3-211-83001-4",
	685	annote = "This paper proposes a simple augmentation to texture
	686	mapping hardware which produces the correct depth
	687	buffer content and hence correct visibility when
	688	replacing complex objects by partially transparent
	689	textured polygons. Rendering such polygons exploits
	690	frame-to-frame coherence in image sequences of dynamic
	691	scenes. Correct depth values are obtained by keeping a
	692	small depth delta for every texel which represents the
	693	texel's deviation from the textured polygon. The
	694	polygon's depth values are modified at every pixel to
	695	match the depicted object's geometry.",
	696	who = "Havran Vlastimil: REN-0027",
	697	}
	698
	699	@InProceedings{Bishop:1994:FRD,
	700	author = "Gary Bishop and Henry Fuchs and Leonard Mc{M}illan and
	701	Ellen J. {Scher Zagier}",
	702	editor = "Andrew Glassner",
	703	booktitle = "Proceedings of SIGGRAPH '94 (Orlando, Florida, July
	704	24--29, 1994)",
	705	title = "Frameless Rendering: Double Buffering Considered
	706	Harmful",
	707	organization = "ACM SIGGRAPH",
	708	publisher = "ACM Press",
	709	pages = "175--176",
	710	month = jul,
	711	year = "1994",
	712	note = "ISBN 0-89791-667-0",
	713	series = "Computer Graphics Proceedings, Annual Conference
	714	Series",
	715	who = "Havran Vlastimil: REN-0028",
	716	}
	717
	718	@InProceedings{kajiya86a,
	719	author = "J. T. Kajiya",
	720	title = "The Rendering Equation",
	721	pages = "143--150",
	722	booktitle = "Computer Graphics (SIGGRAPH '86 Proceedings)",
	723	year = "1986",
	724	month = aug,
	725	conference = "held in Dallas, Texas, August 18--22, 1986",
	726	keywords = "I37 rendering, I37 ray tracing, I37 radiosity,
	727	shading, diffuse reflection, radiosity",
	728	annote = "We present an integral equation which generalizes a
	729	variety of known rendering algorithms. In the course of
	730	discussing a Monte Carlo solution a new form of
	731	variance reduction is presented, called hierarchical
	732	sampling, and a number of elaborations are given that
	733	show that it may be an efficient new technique for a
	734	wide variety of Monte Carlo procedures. The resulting
	735	rendering algorithm extends the range of optical
	736	phenomena which can be effectively simulated.",
	737	who = "Havran Vlastimil: REN-0029",
	738	}
	739
	740	@inproceedings{CDRLSS-gi96,
	741	title = "Fast rendering of complex environments using a spatial hierarchy",
	742	author = "Bradford Chamberlain and Tony DeRose and Dani Lischinski and
	743	David Salesin and John Snyder",
	744	booktitle = "Graphics Interface",
	745	year = "1996",
	746	month = "May",
	747	pages = "132--141",
	748	who = "Havran Vlastimil: REN-0030",
	749	}
	750
	751	@InProceedings{sillion89a,
	752	author = "Francois Sillion and Claude Puech",
	753	title = "A General Two-Pass Method Integrating Specular and
	754	Diffuse Reflection",
	755	pages = "335--344",
	756	booktitle = "Computer Graphics (SIGGRAPH '89 Proceedings)",
	757	volume = "23",
	758	number = "3",
	759	year = "1989",
	760	month = jul,
	761	editor = "Jeffrey Lane",
	762	conference = "held in Boston, Massachusetts; 31 July -- 4 August
	763	1989",
	764	keywords = "radiosity, interreflection, two-pass method, extended
	765	form factors, z-buffer, progressive refinement, global
	766	illumination, ray tracing",
	767	annote = "We analyze some recent approaches to the global
	768	illumination problem by introducing the corresponding
	769	{\em reflection operators}, and we demonstrate the
	770	advantages of a two-pass method. A generalization of
	771	this system introduced by Wallace {\em et al}.\ at
	772	Siggraph '87 to integrate diffuse as well as specular
	773	reflection is presented. It is based on the calculation
	774	of {\em extended form-factors}, which allows arbitrary
	775	geometries to be used in the scene description, as well
	776	as refraction effects. We also present a new sampling
	777	method for the calculation of form-factors, which is an
	778	alternative to the {\em hemi-cube} technique introduced
	779	by Cohen and Greenberg for radiosity calculations. This
	780	method is particularly well suited to the extended
	781	form-factors calculation. The problem of interactive
	782	display of the picture being created is also addressed
	783	by using hardware-assisted projections and image
	784	composition to recreate a complete specular view of the
	785	scene.",
	786	who = "Havran Vlastimil: REN-0031",
	787	}
	788
	789	@Article{Gibson:1996:EHR,
	790	author = "S. Gibson and R. J. Hubbold",
	791	title = "Efficient Hierarchical Refinement and Clustering for
	792	Radiosity in Complex Environments",
	793	journal = "Computer Graphics Forum",
	794	year = "1996",
	795	volume = "15",
	796	number = "5",
	797	pages = "297--310",
	798	note = "ISSN 0167-7055",
	799	keywords = "radiosity, hierarchical radiosity, error bounds,
	800	clustering",
	801	annote = "Generating accurate radiosity solutions of very
	802	complex environments is a time-consuming problem. We
	803	present a rapid hierarchical algorithm that enables
	804	such solutions to be computed quickly and efficiently.
	805	Firstly, a new technique for bouncing the error in the
	806	transfer of radiosity between surfaces is discussed,
	807	incorporating bounds on form factors, visibility,
	808	irradiance, and reflectance over textured surfaces.
	809	This technique is then applied to the problem of
	810	bounding radiosity transfer between clusters of
	811	surfaces, leading to a fast, practical clustering
	812	algorithm that builds on the previous work of Sillion.
	813	Volumes are used to represent clusters of small
	814	surfaces, but unlike previous algorithms, the
	815	orientations of surfaces inside each cluster are
	816	accounted for in both the error bound and radiosity
	817	transfer. This enables an accurate solution to be
	818	generated very efficiently, and results are presented
	819	demonstrating the performance of the algorithm on a
	820	variety of complex models, one containing almost a
	821	quarter of a million initial surfaces.",
	822	who = "Havran Vlastimil: REN-0032",
	823	}
	824
	825	@InProceedings{Smits:1994:CAR,
	826	author = "Brian Smits and James Arvo and Donald Greenberg",
	827	editor = "Andrew Glassner",
	828	booktitle = "Proceedings of SIGGRAPH '94 (Orlando, Florida, July
	829	24--29, 1994)",
	830	title = "A Clustering Algorithm for Radiosity in Complex
	831	Environments",
	832	organization = "ACM SIGGRAPH",
	833	publisher = "ACM Press",
	834	pages = "435--442",
	835	month = jul,
	836	year = "1994",
	837	note = "ISBN 0-89791-667-0",
	838	series = "Computer Graphics Proceedings, Annual Conference
	839	Series",
	840	who = "Havran Vlastimil: REN-0033",
	841	}
	842
	843	@InProceedings{Jensen95-EFSPM,
	844	author = "Henrik Wann Jensen and Niels J. Christensen",
	845	editor = "Harold P. Santo",
	846	month = dec # " 12,",
	847	year = "1995",
	848	title = "Efficiently {Rendering} {Shadows} {Using} the {Photon}
	849	{Map}",
	850	booktitle = "Edugraphics + Compugraphics Proceedings",
	851	pages = "285--291",
	852	publisher = "GRASP- Graphic Science Promotions \& Publications",
	853	address = "P.O. Box 4076, Massama, 2745 Queluz, Portugal",
	854	comments = "ISBN 972-8342-00-4",
	855	who = "Havran Vlastimil: REN-0034",
	856	}
	857
	858	@InProceedings{Huerta97,
	859	author = "Joaquin Huerta and Miguel Chover and Jose Ribelles
	860	and Ricardo Quiros",
	861	editor = "Harold P. Santo",
	862	month = dec # " 15,",
	863	year = "1997",
	864	title = "Constructing and Rendering of Multiresolution Binary Space
	865	Partitioning Trees",
	866	booktitle = "Edugraphics + Compugraphics Proceedings",
	867	pages = "212--221",
	868	publisher = "GRASP- Graphic Science Promotions \& Publications",
	869	address = "P.O. Box 4076, Massama, 2745 Queluz, Portugal",
	870	who = "Havran Vlastimil: REN-0035",
	871	}
	872
	873	@InProceedings{Teller:1994:POL,
	874	author = "Seth Teller and Celeste Fowler and Thomas Funkhouser
	875	and Pat Hanrahan",
	876	editor = "Andrew Glassner",
	877	booktitle = "Proceedings of SIGGRAPH '94 (Orlando, Florida, July
	878	24--29, 1994)",
	879	title = "Partitioning and Ordering Large Radiosity
	880	Computations",
	881	organization = "ACM SIGGRAPH",
	882	publisher = "ACM Press",
	883	pages = "443--450",
	884	month = jul,
	885	year = "1994",
	886	note = "ISBN 0-89791-667-0",
	887	series = "Computer Graphics Proceedings, Annual Conference
	888	Series",
	889	who = "Havran Vlastimil: REN-0036",
	890	}
	891
	892	@InProceedings{EVL-1997-128,
	893	author = "Eric Veach and Leonidas J. Guibas",
	894	editor = "Turner Whitted",
	895	title = "Metropolis Light Transport",
	896	booktitle = "SIGGRAPH 97 Conference Proceedings",
	897	series = "Annual Conference Series",
	898	pages = "65--76",
	899	publisher = "Addison Wesley",
	900	month = aug,
	901	year = "1997",
	902	keywords = "global illumination, lighting simulation, radiative
	903	heat transfer, physically-based rendering, Monte Carlo
	904	integration, variance reduction, Metropolis-Hastings
	905	algorithm, Markov Chain Monte Carlo (MCMC) methods",
	906	language = "en",
	907	abstract = "We present a new Monte Carlo method for solving the
	908	light transport problem, inspired by the Metropolis
	909	sampling method in computational physics. To render an
	910	image, we generate a sequence of light transport paths
	911	by randomly mutating a single current path (e.g. adding
	912	a new vertex to the path). Each mutation is accepted or
	913	rejected with a carefully chosen probability, to ensure
	914	that paths are sampled according to the contribution
	915	they make to the ideal image. We then estimate this
	916	image by sampling many paths, and recording their
	917	locations on the image plane. Our algorithm is
	918	unbiased, handles general geometric and scattering
	919	models, uses little storage, and can be orders of
	920	magnitude more efficient than previous unbiased
	921	approaches. It performs especially well on problems
	922	that are usually considered difficult, e.g. those
	923	involving bright indirect light, small geometric holes,
	924	or glossy surfaces. Furthermore, it is competitive with
	925	previous unbiased algorithms even for relatively simple
	926	scenes. The key advantage of the Metropolis approach is
	927	that the path space is explored locally, by favoring
	928	mutations that make small changes to the current path.
	929	This has several consequences. First, the average cost
	930	per sample is small (typically only one or two rays).
	931	Second, once an important path is found, the nearby
	932	paths are explored as well, thus amortizing the expense
	933	of finding such paths over many samples. Third, the
	934	mutation set is easily extended. By constructing
	935	mutations that preserve certain properties of the path
	936	(e.g. which light source is used) while changing
	937	others, we can exploit various kinds of coherence in
	938	the scene. It is often possible to handle difficult
	939	lighting problems efficiently by designing a
	940	specialized mutation in this way.",
	941	note = "ISBN 0-89791-896-7",
	942	evlib-url = "http://visinfo.zib.de:80/Dienst/UI/2.0/Describe/evl.computergraphics%2FEVL-1997-128",
	943	evlib-revision = "1st",
	944	organization = "ACM SIGGRAPH",
	945	who = "Havran Vlastimil: REN-0037",
	946	}
	947
	948	@InProceedings{Jensen:1996:GIU,
	949	author = "Henrik Wann Jensen",
	950	title = "Global Illumination using Photon Maps",
	951	booktitle = "Eurographics Rendering Workshop 1996",
	952	editor = "Xavier Pueyo and Peter Schr{\"{o}}der",
	953	year = "1996",
	954	organization = "Eurographics",
	955	publisher = "Springer Wein",
	956	address = "New York City, NY",
	957	month = jun,
	958	pages = "21--30",
	959	note = "ISBN 3-211-82883-4",
	960	keywords = "Global Illumination, Photon Maps, Filtering, Monte
	961	Carlo Ray Tracing",
	962	annote = "This paper presents a two pass global illumination
	963	method based on the concept of photon maps. It
	964	represents a significant improvement of a previously
	965	described approach both with respect to speed, accuracy
	966	and versatility. In the first pass two photon maps are
	967	created by emitting packets of energy (photons) from
	968	the light sources and storing these as they hit
	969	surfaces within the scene. We use one high resolution
	970	caustics photon map to render caustics that are
	971	visualized directly and one low resolution photon map
	972	that is used during the rendering step. The scene is
	973	rendered using a distribution ray tracing algorithm
	974	optimized by using the information in the photon maps.
	975	Shadow photons are used to render shadows more
	976	efficiently and the directional information in the
	977	photon map is used to generate more optimal sampling
	978	directions and to limit the recursion in the
	979	distribution ray tracer by providing an estimate of the
	980	radiance on all surfaces with the exception of specular
	981	and highly glossy surfaces. Noise and blur at
	982	discontinuities in the radiance estimate is reduced by
	983	using a cone filter. The results presented demonstrate
	984	global illumination in scenes containing procedural
	985	objects and surfaces with diffuse and glossy reflection
	986	models. The implementation is also compared with the
	987	Radiance program.",
	988	who = "Havran Vlastimil: REN-0038",
	989	}
	990
	991	@InProceedings{Jansen94a,
	992	author = "E. Reinhard and Lucas U. Tijssen and Frederik W. Jansen",
	993	title = "Environment Mapping for Efficient Sampling of the Diffuse Interreflection",
	994	year = 1994,
	995	booktitle = "Proc. of 5th Eurographics Workshop on Rendering 1994",
	996	pages = "401--404",
	997	who = "Havran Vlastimil: REN-0039",
	998	}
	999
	1000	@inproceedings{McCoolHarwood-gi97,
	1001	title = "Probability trees",
	1002	author = "Michael D. McCool and Peter K. Harwood",
	1003	booktitle = "Graphics Interface '97",
	1004	year = "1997",
	1005	month = "May",
	1006	pages = "37--46",
	1007	who = "Havran Vlastimil: REN-0040",
	1008	}
	1009
	1010	@inproceedings{MFC-gi97,
	1011	title = "Multiresolution rendering of complex botanical scenes",
	1012	author = "Dana Marshall and Donald S. Fussell and A.T. Campbell,~III",
	1013	booktitle = "Graphics Interface '97",
	1014	year = "1997",
	1015	month = "May",
	1016	pages = "97--104",
	1017	who = "Havran Vlastimil: REN-0041",
	1018	}
	1019
	1020	@Misc{Fortune,
	1021	author = "Steven Fortune",
	1022	title = "A Beam-Tracing Algorithm for Prediction of Indoor Radio Propagation",
	1023	year = "19??",
	1024	month = "??",
	1025	pages = "10",
	1026	who = "Havran Vlastimil: REN-0042",
	1027	}
	1028
	1029	@PhdThesis{Arvo95-AMSLT,
	1030	author = "James Arvo",
	1031	month = dec,
	1032	year = "1995",
	1033	title = "Analytic {Methods} for {Simulated} {Light}
	1034	{Transport}",
	1035	institution = "Yale University",
	1036	type = "Ph.{D}. thesis",
	1037	who = "Havran Vlastimil: REN-0043",
	1038	}
	1039
	1040
	1041	@Article{Wilhelms:1991:CPA,
	1042	author = "Jane Wilhelms and Allen Van Gelder",
	1043	editor = "Thomas W. Sederberg",
	1044	title = "A coherent projection approach for direct volume
	1045	rendering",
	1046	journal = "Computer Graphics",
	1047	volume = "25",
	1048	number = "4",
	1049	pages = "275--284",
	1050	month = jul,
	1051	year = "1991",
	1052	coden = "CGRADI, CPGPBZ",
	1053	ISSN = "0097-8930",
	1054	conference = "held in Las Vegas, Nevada; 28 July -- 2 August 1991",
	1055	who = "Havran Vlastimil: REN-0044",
	1056	}
	1057
	1058	@Article{Levoy:1990:VRA,
	1059	author = "Marc Levoy",
	1060	title = "Volume Rendering by Adaptive Refinement",
	1061	journal = "The Visual Computer",
	1062	pages = "2--7",
	1063	volume = "6",
	1064	number = "1",
	1065	month = feb,
	1066	year = "1990",
	1067	keywords = "volume rendering, voxel, adaptive refinement, adaptive
	1068	sampling, ray tracing",
	1069	annote = "{\em Volume rendering} is a technique for visualizing
	1070	sampled scalar functions of three spatial dimensions by
	1071	computing 2D projections of a colored semi-transparent
	1072	gel. This paper presents a volume-rendering algorithm,
	1073	in which imge quality is adaptively refined over time.
	1074	An initial image is generated by casting a small number
	1075	of rays into the data, less than one ray per pixel, and
	1076	interpolating between the resulting colors. Subsequent
	1077	images are generated by alternately casting more rays
	1078	and interpolating. The usefulness of these rays is
	1079	maximized by distributing them according to measures of
	1080	loal image complexity. Examples from two applications
	1081	are given: molecular graphics and medical imaging.",
	1082	who = "Havran Vlastimil: REN-0045",
	1083	}
	1084
	1085	@Article{Hsu:1995:SDA,
	1086	author = "Siu-Chi Hsu and Tien-Tsin Wong",
	1087	title = "Simulating Dust Accumulation",
	1088	journal = "IEEE Computer Graphics and Applications",
	1089	volume = "15",
	1090	number = "1",
	1091	pages = "18--22",
	1092	month = jan,
	1093	year = "1995",
	1094	coden = "ICGADZ",
	1095	ISSN = "0272-1716",
	1096	bibdate = "Sat Jan 25 06:42:48 MST 1997",
	1097	acknowledgement = ack-nhfb,
	1098	affiliation = "Chinese Univ. of Hong Kong, Shatin, Hong Kong",
	1099	classification = "451.1; 723.5; 921.6; 931.2",
	1100	journalabr = "IEEE Comput Graphics Appl",
	1101	keywords = "Approximation theory; Computer graphics; Computer
	1102	simulation; Dust; Dust accumulation; Image analysis;
	1103	Interpolation; Mathematical models; Natural sciences
	1104	computing; Ray tracing; Rendering; Scraping effects;
	1105	Surface exposure; Surface properties; Surfaces;
	1106	Textures",
	1107	who = "Havran Vlastimil: REN-0046",
	1108	}
	1109
	1110
	1111	@Article{Rushmeier:1995:VRP,
	1112	author = "Holly Rushmeier and Anthony Hamins and Mun Young
	1113	Choi",
	1114	title = "Volume rendering of pool fire data",
	1115	journal = "IEEE Computer Graphics and Applications",
	1116	volume = "15",
	1117	number = "4",
	1118	pages = "62--67",
	1119	month = jul,
	1120	year = "1995",
	1121	coden = "ICGADZ",
	1122	ISSN = "0272-1716",
	1123	bibdate = "Sat Jan 25 06:42:48 MST 1997",
	1124	acknowledgement = ack-nhfb,
	1125	affiliation = "Natl Inst of Standards and Technology",
	1126	affiliationaddress = "Gaithersburg, MD, USA",
	1127	classification = "723.5; 914.2; 921.2; 921.6",
	1128	journalabr = "IEEE Comput Graphics Appl",
	1129	keywords = "Calculations; Computer graphics; Fires; Imaging
	1130	techniques; Integration; Line integration; Mathematical
	1131	models; Pool fires; Radiation effects; Ray casting; Two
	1132	dimensional; Visualization; Volume rendering",
	1133	who = "Havran Vlastimil: REN-0047",
	1134	}
	1135
	1136
	1137	@Article{Woo:1996:IRR,
	1138	author = "Andrew Woo and Andrew Pearce and Marc Ouellette",
	1139	title = "It's really not a rendering bug, you see.",
	1140	journal = "IEEE Computer Graphics and Applications",
	1141	volume = "16",
	1142	number = "5",
	1143	pages = "21--25",
	1144	month = sep,
	1145	year = "1996",
	1146	coden = "ICGADZ",
	1147	ISSN = "0272-1716",
	1148	bibdate = "Sat Jan 25 06:42:48 MST 1997",
	1149	acknowledgement = ack-nhfb,
	1150	affiliation = "Alias-Wavefront, Toronto, Ont., Canada",
	1151	classification = "721.1; 723.1; 723.5; 741.1; 921.4; 921.6",
	1152	journalabr = "IEEE Comput Graphics Appl",
	1153	keywords = "Algorithms; Approximation theory; Color computer
	1154	graphics; Computational geometry; Computational
	1155	methods; Computer graphics; Convergence of numerical
	1156	methods; Digital arithmetic; Errors; Gouraud shading;
	1157	Image artifacts; Interpolation; Light reflection;
	1158	Lighting; Liner interpolation; Mirror reflection;
	1159	Mirrors; Numerical instability; Phong shading; Planar
	1160	equation; Polygons; Program debugging; Ray plane
	1161	intersection equation; Ray tracing; Rendering
	1162	artifacts; Shadowing; Texture mapping; Three
	1163	dimensional computer graphics; Visibility",
	1164	who = "Havran Vlastimil: REN-0048",
	1165	}
	1166
	1167	@InProceedings{Nechvile:1996:FFE,
	1168	author = "K. Nechvile and J. Sochor",
	1169	title = "Form-factor Evaluation with Regional {BSP} Trees",
	1170	booktitle = "Winter School of Computer Graphics 1996",
	1171	year = "1996",
	1172	month = feb,
	1173	note = "held at University of West Bohemia, Plzen, Czech
	1174	Republic, 12-16 February 1996",
	1175	who = "Havran Vlastimil: REN-0049",
	1176	}
	1177
	1178	@InProceedings{Campbell:1990:AMG,
	1179	author = "A. T. {Campbell, III} and Donald S. Fussell",
	1180	title = "Adaptive Mesh Generation for Global Diffuse
	1181	Illumination",
	1182	year = "1990",
	1183	month = aug,
	1184	volume = "24",
	1185	booktitle = "Computer Graphics (SIGGRAPH '90 Proceedings)",
	1186	pages = "155--164",
	1187	keywords = "BSP tree",
	1188	who = "Havran Vlastimil: REN-0050",
	1189	}
	1190
	1191	@Article{Noordmans:1997:FVR,
	1192	author = "H. J. Noordmans and A. W. M. Smeulders and H. T. M.
	1193	{van der Voort}",
	1194	title = "Fast volume render techniques for interactive
	1195	analysis",
	1196	journal = "The Visual Computer",
	1197	year = "1997",
	1198	volume = "13",
	1199	number = "8",
	1200	pages = "345--358",
	1201	publisher = "Springer-Verlag",
	1202	note = "ISSN 0178-2789",
	1203	keywords = "volume rendering, interaction, successive adaptive
	1204	refinement, confocal microscopy",
	1205	annote = "Without graphics hardware, interactive volume
	1206	rendering is almost impossible with the current
	1207	generation of computers and software. We describe the
	1208	implementation of a volume renderer for interactive
	1209	analysis of confocal images. We propose several
	1210	techniques to accelerate the rendering of grey-value
	1211	volumes. We propose to illuminate the volume
	1212	selectively with ray templates to get a proper shadow
	1213	cue in the shortest feasible time. In the viewing
	1214	phase, rendering is distinctively accelerated for four
	1215	user interactions: (1) a total change by successive
	1216	adaptive refinement, (2) an unknown change in the view
	1217	with this refinement strategy combined with suspended
	1218	interpolation, (3) a known change in the view by
	1219	recalculating only that part and (4) a view translation
	1220	by recalculating the uncovered part.",
	1221	who = "Havran Vlastimil: REN-0051",
	1222	}
	1223
	1224	@Article{lischinski92a,
	1225	author = "Dani Lischinski and Filippo Tampieri and Donald P.
	1226	Greenberg",
	1227	title = "Discontinuity meshing for accurate radiosity",
	1228	journal = "IEEE Computer Graphics and Applications",
	1229	pages = "25--39",
	1230	volume = "12",
	1231	number = "6",
	1232	month = nov,
	1233	year = "1992",
	1234	keywords = "shadow, illumination, bsp, adaptive subdivision",
	1235	annote = "This object-space algorithm accurately produces the
	1236	radiance across a surface. Used in
	1237	progressive-refinement radiosity system, it greatly
	1238	improves the photorealism of diffuse global
	1239	illumination solutions.",
	1240	who = "Havran Vlastimil: REN-0052",
	1241	}
	1242
	1243
	1244	@Article{tvcg-1995-19,
	1245	author = "Francois X. Sillion",
	1246	email = "francois.sillion@imag.fr",
	1247	title = "{A Unified Hierarchical Algorithm for Global
	1248	Illumination with Scattering Volumes and Object
	1249	Clusters}",
	1250	journal = "IEEE Transactions on Visualization and Computer
	1251	Graphics",
	1252	volume = "1",
	1253	number = "3",
	1254	month = sep,
	1255	year = "1995",
	1256	pages = "240--254",
	1257	abstract = "This paper presents a new radiosity algorithm that
	1258	allows the simultaneous computation of energy exchanges
	1259	between surface elements, scattering volume
	1260	distributions, and groups of surfaces, or object
	1261	clusters. The new technique is based on a hierarchical
	1262	formulation of the zonal method, and efficiently
	1263	integrates volumes and surfaces. In particular no
	1264	initial linking stage is needed, even for inhomogeneous
	1265	volumes, thanks to the construction of a global spatial
	1266	hierarchy. An analogy between object clusters and
	1267	scattering volumes results in a powerful clustering
	1268	radiosity algorithm, with no initial linking between
	1269	surfaces and fast computation of average visibility
	1270	information through a cluster. We show that the
	1271	accurate distribution of the energy emitted or received
	1272	at the cluster level can produce even better results
	1273	than isotropic clustering at a marginal cost. The
	1274	resulting algorithm is fast and, more importantly,
	1275	truly progressive as it allows the quick calculation of
	1276	approximate solutions with a smooth convergence towards
	1277	very accurate simulations.",
	1278	keywords = "Radiosity, hierarchical techniques, clustering,
	1279	visibility, volume scattering, lighting simulation,
	1280	realistic image synthesis",
	1281	tvcg-abstract-url = "http://www.computer.org/tvcg/tg1995/v0240abs.htm",
	1282	who = "Havran Vlastimil: REN-0053",
	1283	}
	1284
	1285	@Article{tvcg-1997-25,
	1286	author = "Paul Lalonde and Alain Fournier",
	1287	title = "{A Wavelet Representation of Reflectance Functions}",
	1288	journal = "IEEE Transactions on Visualization and Computer
	1289	Graphics",
	1290	volume = "3",
	1291	number = "4",
	1292	month = oct,
	1293	year = "1997",
	1294	pages = "329--336",
	1295	abstract = "Analytical models of light reflection are in common
	1296	use in computer graphics. However, models based on
	1297	measured reflectance data promise increased realism by
	1298	making it possible to simulate many more types of
	1299	surfaces to a greater level of accuracy than with
	1300	analytical models. They also require less expert
	1301	knowledge about the illumination models and their
	1302	parameters. There are a number of hurdles to using
	1303	measured reflectance functions, however. The data sets
	1304	are very large. A reflectance distribution function
	1305	sampled at five degrees angular resolution, arguably
	1306	sparse enough to miss highlights and other high
	1307	frequency effects, can easily require over a million
	1308	samples, which in turn amount to over four megabytes of
	1309	data. These data then also require some form of
	1310	interpolation and filtering to be used effectively. In
	1311	this paper, we examine issues of representation of
	1312	measured reflectance distribution functions. In
	1313	particular, we examine a wavelet basis representation
	1314	of reflectance functions, and the algorithms required
	1315	for efficient point-wise reconstruction of the BRDF. We
	1316	show that the nonstandard wavelet decomposition leads
	1317	to considerably more efficient algorithms than the
	1318	standard wavelet decomposition. We also show that
	1319	thresholding allows considerable improvement in running
	1320	times, without unduly sacrificing image quality.",
	1321	keywords = "reflectance models, bidirectional reflectance,
	1322	distribution functions, local shading, local
	1323	illumination, wavelets, compression",
	1324	tvcg-abstract-url = "http://www.computer.org/tvcg/tg1997/v0329abs.htm",
	1325	tvcg-pdf-url = "http://pdf.computer.org/tg/books/tg1997/pdf/v0329.pdf",
	1326	who = "Havran Vlastimil: REN-0054",
	1327	}
	1328
	1329	@InProceedings{Shade:1996:HIC,
	1330	author = "Jonathan Shade and Dani Lischinski and David Salesin
	1331	and Tony {DeRose} and John Snyder",
	1332	title = "Hierarchical Image Caching for Accelerated
	1333	Walkthroughs of Complex Environments",
	1334	pages = "75--82",
	1335	booktitle = "Computer Graphics (Proceedings of SIGGRAPH '96)",
	1336	year = "1996",
	1337	publisher = "ACM SIGGRAPH/Addison Wesley",
	1338	month = aug,
	1339	abstract = "We present a new method that utilizes path coherence
	1340	to accelerate walkthroughs of geometrically complex
	1341	static scenes. As a preprocessing step, our method
	1342	constructs a BSP-tree that hierarchically partitions
	1343	the geometric primitives in the scene. In the course of
	1344	a walkthrough, images of nodes at various levels of the
	1345	hierarchy are cached for reuse in subsequent frames. A
	1346	cached image is reused by texture-mapping it onto a
	1347	single quadrilateral that is drawn instead of the
	1348	geometry contained in the corresponding node. Visual
	1349	artifacts are kept under control by using an error
	1350	metric that quantifies the discrepancy between the
	1351	appearance of the geometry contained in a node and the
	1352	cached image. The new method is shown to achieve
	1353	speedups of an order of magnitude for walkthroughs of a
	1354	complex outdoor scene, with little or no loss in
	1355	rendering quality.",
	1356	who = "Havran Vlastimil: REN-0055",
	1357	}
	1358
	1359	@Article{tvcg-1996-22,
	1360	author = "Daniel Cohen-Or and Eran Rich and Uri Lerner and
	1361	Victor Shenkar",
	1362	email = "daniel@math.tau.ac.il and none and none and none",
	1363	title = "{A Real-Time Photo-Realistic Visual Flythrough}",
	1364	journal = "IEEE Transactions on Visualization and Computer
	1365	Graphics",
	1366	volume = "2",
	1367	number = "3",
	1368	month = sep,
	1369	year = "1996",
	1370	pages = "255--264",
	1371	abstract = "In this paper we present a comprehensive flythrough
	1372	system which generates photo-realistic images in true
	1373	real-time. The high performance is due to an innovative
	1374	rendering algorithm based on a discrete ray casting
	1375	approach, accelerated by ray coherence and
	1376	multiresolution traversal. The terrain as well as the
	1377	3D objects are represented by a textured mapped
	1378	voxel-based model. The system is based on a pure
	1379	software algorithm and is thus portable. It was first
	1380	implemented on a workstation and then ported to a
	1381	general-purpose parallel architecture to achieve
	1382	real-time performance.",
	1383	keywords = "Terrain visualization, parallel rendering, flight
	1384	simulator, visual simulations, voxel-based modeling,
	1385	ray casting",
	1386	tvcg-abstract-url = "http://www.computer.org/tvcg/tg1996/v0255abs.htm",
	1387	who = "Havran Vlastimil: REN-0056",
	1388	}
	1389
	1390	@InProceedings{hanrahan90b,
	1391	author = "Pat Hanrahan and Jim Lawson",
	1392	title = "A Language for Shading and Lighting Calculations",
	1393	pages = "289--298",
	1394	booktitle = "Computer Graphics (SIGGRAPH '90 Proceedings)",
	1395	volume = "24",
	1396	number = "4",
	1397	year = "1990",
	1398	month = aug,
	1399	editor = "Forest Baskett",
	1400	conference = "held in Dallas, Texas; 6-10 August 1990",
	1401	keywords = "shading language, little language, illumination,
	1402	lighting, rendering",
	1403	who = "Havran Vlastimil: REN-0057",
	1404	}
	1405
	1406	@InProceedings{Schroder:1993:FFB,
	1407	author = "Peter Schr{\"{o}}der and Pat Hanrahan",
	1408	booktitle = "Computer Graphics (Proceedings of SIGGRAPH '93)",
	1409	title = "On the Form Factor Between Two Polygons",
	1410	pages = "163--164",
	1411	year = "1993",
	1412	keywords = "Radiosity, Engineering, Closed form solution, form
	1413	factor, polygons",
	1414	annote = "Form factors are used in radiosity to describe the
	1415	fraction of diffusely re ected light leaving one
	1416	surface and arriving at another. They are a fundamental
	1417	geometric property used for computation. Many special
	1418	configurations admit closed form solutions. However,
	1419	the important case of the form factor between two
	1420	polygons in three space has had no known closed form
	1421	solution. We give such a solution for the case of
	1422	general (planar, convex or concave, possibly containing
	1423	holes) polygons.",
	1424	who = "Havran Vlastimil: REN-0058",
	1425	}
	1426
	1427
	1428	@Article{Kaufman:1993:VG,
	1429	author = "Arie Kaufman and Daniel Cohen and Roni Yagel",
	1430	title = "Volume Graphics",
	1431	journal = "Computer",
	1432	volume = "26",
	1433	number = "7",
	1434	pages = "51--64",
	1435	month = jul,
	1436	year = "1993",
	1437	coden = "CPTRB4",
	1438	ISSN = "0018-9162",
	1439	bibdate = "Sat Feb 1 16:21:14 MST 1997",
	1440	abstract = "Just as 2D raster graphics superseded vector graphics,
	1441	volume graphics has the potential to supersede surface
	1442	graphics for 3D geometric scene representation,
	1443	manipulation, and rendering.",
	1444	acknowledgement = ack-nhfb,
	1445	affiliation = "Dept. of Comput. Sci., State Univ. of New York, Stony
	1446	Brook, NY, USA",
	1447	classification = "723.2; C4260 (Computational geometry); C6130B
	1448	(Graphics techniques)",
	1449	journalabr = "Computer",
	1450	keywords = "3D scene representation; Block operations;
	1451	Constructive solid geometry modeling; Discreteness;
	1452	Geometric objects; Hierarchical representation; Imaging
	1453	techniques; Interactive computer graphics; Internal
	1454	structures; Irregular voxel sizes; Memory size;
	1455	Processing time; Sampled data sets; Simulated data
	1456	sets; Three dimensional computer graphics; Viewpoint
	1457	independence; Volume buffer; Volume data sets; Volume
	1458	graphics; Volume visualization",
	1459	thesaurus = "Computational geometry; Data visualisation; Solid
	1460	modelling",
	1461	who = "Havran Vlastimil: REN-0059",
	1462	}
	1463
	1464	@TechReport{Heckbert97shadow,
	1465	author = "Paul S. Heckbert and Michael Herf",
	1466	title = "Simulating Soft Shadows with Graphics Hardware",
	1467	institution = "CS Dept., Carnegie Mellon U.",
	1468	month = jan,
	1469	year = "1997",
	1470	note = "CMU-CS-97-104, http://www.cs.cmu.edu/~ph",
	1471	keywords = "penumbra, texture mapping, graphics workstation,
	1472	interaction, real-time, SGI Reality Engine",
	1473	who = "Havran Vlastimil: REN-0060",
	1474	}
	1475
	1476	@InProceedings{Novins:1990:EMV,
	1477	author = "Kevin L. Novins and Francois X. Sillion and Donald P.
	1478	Greenberg",
	1479	title = "An Efficient Method for Volume Rendering using
	1480	Perspective Projection",
	1481	pages = "95--102",
	1482	booktitle = "Computer Graphics (San Diego Workshop on Volume
	1483	Visualization)",
	1484	volume = "24",
	1485	number = "5",
	1486	year = "1990",
	1487	month = nov,
	1488	conference = "held in San Diego, California; 10-11 December 1990",
	1489	keywords = "volume visualization, volume rendering, scientific
	1490	visualization, ray tracing, perspective projection,
	1491	depth of field",
	1492	annote = "Use of the perspective projection adds important
	1493	perceptual cues for image comprehension. However, it
	1494	has not been widely used in volume rendering because of
	1495	the lack of efficient computational algorithms and
	1496	concern over the nonuniform sampling rate imposed by
	1497	perspective ray divergence. This paper introduces two
	1498	new techniques to help make perspective projection more
	1499	feasible in rendering volume data. First, a method is
	1500	presented for efficient slice-by-slice processing of
	1501	volume data, allowing high resolution data sets by
	1502	eliminating typical memory constraints. Second, an
	1503	adaptive ``ray splitting'' approach is described which
	1504	ensures that the entire volume is sampled within
	1505	user-specified limits. Additionally, we present results
	1506	using distributed ray tracing to achieve depth of field
	1507	effects.",
	1508	who = "Havran Vlastimil: REN-0061",
	1509	}
	1510
	1511	@InProceedings{shirley94cn,
	1512	author = "P. Shirley",
	1513	title = "Hybrid Radiosity/Monte Carlo Methods",
	1514	pages = "??-??",
	1515	booktitle = "SIGGRAPH'94 (Advanced Radiosity Course Notes)",
	1516	volume = "28",
	1517	year = "1994",
	1518	month = jul,
	1519	who = "Havran Vlastimil: REN-0062",
	1520	}
	1521
	1522	@InProceedings{Kok:1994:SSD,
	1523	author = "Arjan J. F. Kok and Frederik Jansen",
	1524	booktitle = "Photorealistic Rendering in Computer Graphics
	1525	(Proceedings of the Second Eurographics Workshop on
	1526	Rendering)",
	1527	title = "Source Selection for the Direct Lighting Computation
	1528	in Global Illumination",
	1529	publisher = "Springer-Verlag",
	1530	address = "New York",
	1531	pages = "75--82",
	1532	year = "1994",
	1533	keywords = "adaptive subdivision, ray tracing",
	1534	bibsource = "sig-11-1994",
	1535	who = "Havran Vlastimil: REN-0063",
	1536	}
	1537
	1538	@InProceedings{Wiley97,
	1539	author= "Wiley C and Campbell A and Szygenda S and Fussel D and Hudson F",
	1540	title = "Multiresolution BSP Trees",
	1541	booktitle = "Graphics Interface 97",
	1542	year = "1997",
	1543	pages = "??-??",
	1544	note = "University of Texas",
	1545	who = "Havran Vlastimil: REN-0064",
	1546	}
	1547
	1548	@InProceedings{shirley94pg,
	1549	author = "P. Shirley",
	1550	title = "Practitioners' Assessment of Light Reflection Models",
	1551	pages = "??-??",
	1552	booktitle = "Pacific Graphics'97",
	1553	volume = "??",
	1554	year = "1997",
	1555	month = oct,
	1556	who = "Havran Vlastimil: REN-0065",
	1557	}
	1558
	1559	@inproceedings{sbert:cgi:98,
	1560	author = "M. Sbert",
	1561	title = "Random Walk Radiosity with generalized absorption probabilities",
	1562	booktitle = "Proceedings of Computer Graphics International '98 (CGI'98)",
	1563	year = "1998",
	1564	month = jun,
	1565	pages = "658--665",
	1566	address = "Hannover, Germany",
	1567	publisher = "IEEE, NY",
	1568	who = "Havran Vlastimil: REN-0066",
	1569	}
	1570
	1571	@inproceedings{neumann:cgi:98,
	1572	author = "L. Neumann",
	1573	title = "Automatic Exposure in Computer Graphics Based on the Minimum
	1574	Information Loss Principle",
	1575	booktitle = "Proceedings of Computer Graphics International '98 (CGI'98)",
	1576	year = "1998",
	1577	month = jun,
	1578	pages = "666-677",
	1579	address = "Hannover, Germany",
	1580	publisher = "IEEE, NY",
	1581	who = "Havran Vlastimil: REN-0067",
	1582	}
	1583
	1584	@inproceedings{SS98,
	1585	author = "Cyril Soler and Fran\c{c}ois Sillion",
	1586	title = "Fast Calculation of Soft Shadow Textures Using Convolution",
	1587	booktitle = "Computer Graphics (Proceedings of SIGGRAPH~'98)",
	1588	year = 1998,
	1589	organization = "ACM SIGGRAPH",
	1590	month = jul,
	1591	who = "Havran Vlastimil: REN-0068",
	1592	}
	1593	% pages = "??-??",
	1594
	1595	@inproceedings{prikryl:eg:1998,
	1596	author = "J. Prikryl and W. Purgathofer",
	1597	title = "State of the Art in Perceptually Driven Radiosity",
	1598	booktitle = "STAR in {\em Eurographics~'98}",
	1599	pages = "??-??",
	1600	organization = "Eurographics Association",
	1601	year = "1998",
	1602	month = sep,
	1603	note = "held in Lisbon, Protugal, 02-04 September 1998",
	1604	who = "Havran Vlastimil: REN-0069",
	1605	}
	1606
	1607	@InProceedings{Garrett:1996:RTI,
	1608	title = "Real-Time Incremental Visualization of Dynamic
	1609	Ultrasound Volumes Using Parallel {BSP} Trees",
	1610	author = "William F. Garrett and Henry Fuchs and Mary C. Whitton
	1611	and Andrei State",
	1612	booktitle = "IEEE Visualization '96",
	1613	organization = "IEEE",
	1614	year = "1996",
	1615	month = oct,
	1616	note = "ISBN 0-89791-864-9",
	1617	who = "Havran Vlastimil: REN-0070",
	1618	}
	1619
	1620	@InProceedings{Mueller:1996:FPV,
	1621	title = "Fast Perspective Volume Rendering with Splatting by
	1622	Utilizing a Ray-Driven Approach",
	1623	author = "Klaus Mueller and Roni Yagel",
	1624	booktitle = "IEEE Visualization '96",
	1625	organization = "IEEE",
	1626	year = "1996",
	1627	month = oct,
	1628	note = "ISBN 0-89791-864-9",
	1629	who = "Havran Vlastimil: REN-0071",
	1630	}
	1631
	1632	@InProceedings{Levoy:1996:LFR,
	1633	author = "Marc Levoy and Pat Hanrahan",
	1634	title = "Light Field Rendering",
	1635	editor = "Holly Rushmeier",
	1636	series = "Annual Conference Series",
	1637	pages = "31--42",
	1638	booktitle = "SIGGRAPH 96 Conference Proceedings",
	1639	year = "1996",
	1640	organization = "ACM SIGGRAPH",
	1641	publisher = "Addison Wesley",
	1642	month = aug,
	1643	note = "held in New Orleans, Louisiana, 04-09 August 1996",
	1644	abstract = "A number of techniques have been proposed for flying
	1645	through scenes by redisplaying previously rendered or
	1646	digitized views. Techniques have also been proposed for
	1647	interpolating between views by warping input images,
	1648	using depth information or correspondences between
	1649	multiple images. In this paper, we describe a simple
	1650	and robust method for generating new views from
	1651	arbitrary camera positions without depth information or
	1652	feature matching, simply by combining and resampling
	1653	the available images. The key to this technique lies in
	1654	interpreting the input images as 2D slices of a 4D
	1655	function - the light field. This function completely
	1656	characterizes the flow of light through unobstructed
	1657	space in a static scene with fixed illumination. We
	1658	describe a sampled representation for light fields that
	1659	allows for both efficient creation and display of
	1660	inward and outward looking views. We have created light
	1661	fields from large arrays of both rendered and digitized
	1662	images. The latter are acquired using a video camera
	1663	mounted on a computer-controlled gantry. Once a light
	1664	field has been created, new views may be constructed in
	1665	real time by extracting slices in appropriate
	1666	directions. Since the success of the method depends on
	1667	having a high sample rate, we describe a compression
	1668	system that is able to compress the light fields we
	1669	have generated by more than a factor of 100:1 with very
	1670	little loss of fidelity. We also address the issues of
	1671	antialiasing during creation, and resampling during
	1672	slice extraction.",
	1673	who = "Havran Vlastimil: REN-0072",
	1674	}
	1675
	1676	@InProceedings{Wilhelms:1996:HPD,
	1677	title = "Hierarchical and Parallelizable Direct Volume
	1678	Rendering for Irregular and Multiple Grids",
	1679	author = "Jane P. Wilhelms and Allen {Van Gelder} and Paul
	1680	Tarantino and Jonathan Gibbs",
	1681	booktitle = "IEEE Visualization '96",
	1682	organization = "IEEE",
	1683	year = "1996",
	1684	month = oct,
	1685	note = "ISBN 0-89791-864-9",
	1686	who = "Havran Vlastimil: REN-0073",
	1687	}
	1688
	1689	@InProceedings{Paquette:1998:HVD,
	1690	author = "Eric Paquette and Pierre Poulin and George Drettakis",
	1691	title = "A Light Hierarchy for Fast Rendering of Scenes with
	1692	Many Lights",
	1693	editor = "TBD...",
	1694	pages = "TBD...",
	1695	booktitle = "Computer Graphics Forum (EuroGraphics '98 Conference
	1696	Proceedings",
	1697	year = "1998",
	1698	organization = "EuroGraphics",
	1699	month = sep,
	1700	note = "held in Lisbon, Protugal, 02-04 September 1998",
	1701	who = "Havran Vlastimil: REN-0074",
	1702	}
	1703
	1704	@Article{tvcg-1997-12,
	1705	author = "Claudio T. Silva and Joseph S. B. Mitchell",
	1706	email = "csilva@ams.sunysb.edu and jsbm@ams.sunysb.edu",
	1707	title = "The Lazy Sweep Ray Casting Algorithm for Rendering
	1708	Irregular Grids",
	1709	journal = "IEEE Transaction on Visualization and Computer
	1710	Graphics",
	1711	volume = "3",
	1712	number = "2",
	1713	month = apr,
	1714	year = "1997",
	1715	pages = "142--157",
	1716	abstract = "Lazy Sweep Ray Casting is a fast algorithm for
	1717	rendering general irregular grids. It is based on the
	1718	sweep-plane paradigm, and it is able to accelerate ray
	1719	casting for rendering irregular grids, including
	1720	disconnected and nonconvex (even with holes)
	1721	unstructured irregular grids with a rendering cost that
	1722	decreases as the ``disconnectedness'' decreases. The
	1723	algorithm is carefully tailored to exploit spatial
	1724	coherence even if the image resolution differs
	1725	substantially from the object space resolution. Lazy
	1726	Sweep Ray Casting has several desirable properties,
	1727	including its generality, (depth-sorting) accuracy, low
	1728	memory consumption, speed, simplicity of
	1729	implementation, and portability (e.g., no hardware
	1730	dependencies). We establish the practicality of our
	1731	method through experimental results based on our
	1732	implementation, which is shown to be substantially
	1733	faster (by up to two orders of magnitude) than other
	1734	algorithms implemented in software. We also provide
	1735	theoretical results, both lower and upper bounds, on
	1736	the complexity of ray casting of irregular grids.",
	1737	keywords = "volumetric data, irregular grids, volume rendering,
	1738	sweep algorithms, ray tracing, computational geometry,
	1739	scientific visualization",
	1740	tvcg-abstract-url = "http://www.computer.org/pubs/tvcg/1997/v0142abs.htm",
	1741	who = "Havran Vlastimil: REN-0075",
	1742	}
	1743
	1744	@InProceedings{EVL-1997-33,
	1745	author = "W. Heidrich and Ph. Slusallek and H.-P. Seidel",
	1746	editor = "V. Klassen M. Mantei",
	1747	title = "An Image-Based Model for Realistic Lens Systems in
	1748	Interactive Computer Graphics",
	1749	booktitle = "Proceedings of Graphics Interface '97",
	1750	year = "1997",
	1751	note = "accepted for publication",
	1752	abstract = "Many applications, such as realistic rendering,
	1753	virtual and augmented reality, and virtual studios,
	1754	require an accurate simulation of real lens and camera
	1755	systems at interactive rates, including depth of field
	1756	and geometric aberrations, in particular distortions.
	1757	Unfortunately, camera models used in Computer Graphics
	1758	are either too simple to describe these effects or too
	1759	expensive to simulate for interactive use. In this
	1760	paper, we introduce an image-based lens model that is
	1761	powerful enough to simulate sophisticated properties of
	1762	real lens systems, yet fast enough for interactive
	1763	graphics. By exploiting coherence, common graphics
	1764	hardware can be used to yield high frame rates.",
	1765	keywords = "Lens Systems, Image-Based Rendering, Hardware
	1766	Acceleration, Interactive Computer Graphics",
	1767	postscript-url = "ftp://faui90.informatik.uni-erlangen.de/pub/Publications/1997/Publ.1997.4.ps.gz",
	1768	evlib-url = "http://infovis.zib.de:8000/Dienst/UI/2.0/Describe/evl.computergraphics%2FEVL-1997-33",
	1769	evlib-revision = "1st",
	1770	who = "Havran Vlastimil: REN-0076",
	1771	}
	1772
	1773	@InProceedings{schilling91a,
	1774	author = "Andreas Schilling",
	1775	title = "A new simple and efficient antialiasing with subpixel
	1776	masks",
	1777	pages = "133--141",
	1778	booktitle = "Computer Graphics (SIGGRAPH '91 Proceedings)",
	1779	volume = "25",
	1780	number = "4",
	1781	year = "1991",
	1782	month = jul,
	1783	editor = "Thomas W. Sederberg",
	1784	conference = "held in Las Vegas, Nevada; 28 July - 2 August 1991",
	1785	keywords = "antialiasing, exact area subpixel algorithm",
	1786	who = "Havran Vlastimil: REN-0077",
	1787	}
	1788
	1789
	1790	@InProceedings{Ward:1994:RLS,
	1791	author = "Gregory J. Ward",
	1792	editor = "Andrew Glassner",
	1793	booktitle = "Proceedings of SIGGRAPH '94 (Orlando, Florida, July
	1794	24--29, 1994)",
	1795	title = "The {RADIANCE} Lighting Simulation and Rendering
	1796	System",
	1797	organization = "ACM SIGGRAPH",
	1798	publisher = "ACM Press",
	1799	pages = "459--472",
	1800	month = jul,
	1801	year = "1994",
	1802	note = "ISBN 0-89791-667-0",
	1803	series = "Computer Graphics Proceedings, Annual Conference
	1804	Series",
	1805	who = "Havran Vlastimil: REN-0078",
	1806	}
	1807
	1808
	1809
	1810	@InProceedings{Chui96-LVARC,
	1811	author = "Ken Chui and Kurt Zimmerman and Peter Shirley",
	1812	year = "1996",
	1813	title = "The {Light} {Volume}: {An} {Aid} to {Rendering}
	1814	{Complex} {Environments}",
	1815	booktitle = "Rendering Techniques '96 (Proceedings of the Seventh
	1816	Eurographics Workshop on Rendering)",
	1817	pages = "1--10",
	1818	publisher = "Springer-Verlag/Wien",
	1819	address = "New York, NY",
	1820	comments = "ISBN 3-211-82883-4",
	1821	who = "Havran Vlastimil: REN-0080",
	1822	}
	1823
	1824	@Article{Shirley:1992:TCM,
	1825	author = "Peter Shirley",
	1826	title = "Time complexity of {Monte Carlo} radiosity",
	1827	journal = "Computers and Graphics",
	1828	volume = "16",
	1829	number = "1",
	1830	pages = "117--120",
	1831	year = "1992",
	1832	coden = "COGRD2",
	1833	ISSN = "0097-8493",
	1834	bibdate = "Wed Feb 5 07:22:58 MST 1997",
	1835	acknowledgement = ack-nhfb,
	1836	affiliation = "Indiana Univ",
	1837	affiliationaddress = "Bloomington, IN, USA",
	1838	classification = "723; 922",
	1839	journalabr = "Comput Graphics (Pergamon)",
	1840	keywords = "Computer Metatheory--Computational Complexity;
	1841	Mathematical Statistics; Monte Carlo Methods; Time
	1842	Complexity",
	1843	who = "Havran Vlastimil: REN-0081",
	1844	}
	1845
	1846
	1847
	1848	@Article{Nishita85,
	1849	author = "Tomoyuki Nishita and Eihachiro Nakamae",
	1850	title = "Continuous Tone Representation of 3-{D} Objects Taking
	1851	Account of Shadows and Interreflection",
	1852	journal = "Computer Graphics (SIGGRAPH '85 Proceedings)",
	1853	volume = "19",
	1854	number = "3",
	1855	month = jul,
	1856	year = "1985",
	1857	pages = "23--30",
	1858	keywords = "shading, penumbra, radiosity",
	1859	who = "Havran Vlastimil: REN-0082",
	1860	}
	1861
	1862
	1863	@Article{Christensen:1997:CGG,
	1864	author = "Per H. Christensen and Dani Lischinski and Eric J.
	1865	Stollnitz and David H. Salesin",
	1866	title = "Clustering for Glossy Global Illumination",
	1867	journal = "ACM Transactions on Graphics",
	1868	year = "1997",
	1869	volume = "16",
	1870	number = "1",
	1871	month = jan,
	1872	pages = "3--33",
	1873	note = "ISSN 0730-0301",
	1874	keywords = "clustering, error bounds, global illumination, glossy
	1875	reflectors, hierarchy, importance, radiance,
	1876	rendering",
	1877	annote = "We present a new clustering algorithm for global
	1878	illumination in complex environments. The new algorithm
	1879	extends previous work on clustering for radiosity to
	1880	allow for nondiffuse (glossy) reflectors. We represent
	1881	clusters as points with directional distributions of
	1882	outgoing and incoming radiance and importance, and we
	1883	derive an error bound for transfers between these
	1884	clusters. The algorithm groups input surfaces into a
	1885	hierarchy of clusters, and then permits clusters to
	1886	interact only if the error bound is below an acceptable
	1887	tolerance. We show that the algorithm is asymptotically
	1888	more efficient than previous clustering algorithms even
	1889	when restricted to ideally diffuse environments.
	1890	Finally, we demonstrate the performance of our method
	1891	on two complex glossy environments.",
	1892	who = "Havran Vlastimil: REN-0083",
	1893	}
	1894
	1895	@InCollection{Zimmerman95twopass,
	1896	author = "Kurt Zimmerman and Peter Shirley",
	1897	title = "A Two-Pass Realistic Image Synthesis Method for
	1898	Complex Scenes",
	1899	booktitle = "Rendering Techniques '95 (Proceedings of the Sixth
	1900	Eurographics Workshop on Rendering)",
	1901	publisher = "Springer-Verlag",
	1902	address = "NY",
	1903	pages = "284--295",
	1904	year = "1995",
	1905	note = "Also ftp://ftp.cs.indiana.edu/pub/techreports/TR434.ps.Z",
	1906	keywords = "shadow",
	1907	who = "Havran Vlastimil: REN-0084",
	1908	}
	1909
	1910	@Article{Asensio:1992:HRC,
	1911	author = "Frederic Asensio",
	1912	title = "A Hierarchical Ray-Casting Algorithm for Radiosity
	1913	Shadows",
	1914	year = "1992",
	1915	month = may,
	1916	journal = "Third Eurographics Workshop on Rendering",
	1917	pages = "179--188",
	1918	address = "Bristol, UK",
	1919	keywords = "radiosity",
	1920	who = "Havran Vlastimil: REN-0085",
	1921	}
	1922
	1923
	1924	@InProceedings{Gu:1997:PGT,
	1925	author = "Xianfeng Gu and Steven J. Gortier and Michael F.
	1926	Cohen",
	1927	title = "Polyhedral Geometry and the Two-Plane
	1928	Parameterization",
	1929	booktitle = "Eurographics Rendering Workshop 1997",
	1930	editor = "Julie Dorsey and Philipp Slusallek",
	1931	year = "1997",
	1932	organization = "Eurographics",
	1933	publisher = "Springer Wein",
	1934	address = "New York City, NY",
	1935	month = jun,
	1936	pages = "1--12",
	1937	note = "ISBN 3-211-83001-4",
	1938	annote = "Recently the light-field and lumigraph systems have
	1939	been proposed as general methods of representing the
	1940	visual information present in a scene. These methods
	1941	represent this information as a 4D function of light
	1942	over the domain of directed lines. These systems use
	1943	the intersection points of the lines on two planes to
	1944	parameterize the lines in space. This paper explores
	1945	the structure of the two-plane parameterization in
	1946	detail. In particular we analyze the association
	1947	between the geometry of the scene and subsets of the 4D
	1948	data. The answers to these questions are essential to
	1949	understanding the relationship between a lumigraph, and
	1950	the geometry that it attempts to represent. This
	1951	knowledge is potentially important for a variety of
	1952	applications such as extracting shape from lumigraph
	1953	data, and lumigraph compression.",
	1954	who = "Havran Vlastimil: REN-0086",
	1955	}
	1956
	1957	@Article{Schaufler:1996:TDI,
	1958	author = "Germot Schaufler and Wolfgang Sturzlinger",
	1959	title = "A Three-Dimensional Image Cache for Virtual Reality",
	1960	journal = "Com{\-}pu{\-}ter Graphics Forum",
	1961	volume = "15",
	1962	number = "3",
	1963	pages = "C227--C235, C471--C472",
	1964	month = sep,
	1965	year = "1996",
	1966	coden = "CGFODY",
	1967	ISSN = "0167-7055",
	1968	bibdate = "Tue Mar 17 15:44:38 MST 1998",
	1969	acknowledgement = ack-nhfb,
	1970	affiliation = "Johannes Kepler Universit{\"a}t Linz",
	1971	affiliationaddress = "Linz, Austria",
	1972	affiliationaddress = "Austria",
	1973	classification = "722.1; 722.4; 723.1; 723.2; 723.5; 921.5; C6120
	1974	(File organisation); C6130B (Graphics techniques)",
	1975	conference = "Proceedings of the 1996 17th Annual Conference and
	1976	Exhibition of the European Association for Computer
	1977	Graphics, EUROGRAPHICS'96",
	1978	conflocation = "Poitiers, France; 26-30 Aug. 1996",
	1979	conftitle = "European Association for Computer Graphics 17th Annual
	1980	Conference and Exhibition. EUROGRAPHICS '96",
	1981	corpsource = "Johannes Kepler Univ., Linz, Austria",
	1982	journalabr = "Comput Graphics Forum",
	1983	keywords = "Algorithms; Buffer storage; Computational geometry;
	1984	Computer hardware; Computer software; Image processing;
	1985	Object hierarchies; Optimization; Real time systems;
	1986	Three dimensional computer graphics; Three dimensional
	1987	image cache; Virtual reality",
	1988	keywords = "Algorithms; Buffer storage; cache storage; coherence;
	1989	complex virtual; Computational geometry; computer
	1990	displays; Computer hardware; Computer software; detail;
	1991	environment display; frame rate; hardware; hierarchical
	1992	scene subdivision; Image processing; impostors; large
	1993	virtual environment display; levels; Object
	1994	hierarchies; optimisation; Optimization; Real time
	1995	systems; real-time; real-time rendering; rendering;
	1996	rendering (computer graphics); rendering load; smooth
	1997	frame sequence; software accelerated; software
	1998	optimization; systems; Three dimensional computer
	1999	graphics; three dimensional image cache; Three
	2000	dimensional image cache; three dimensional image cache;
	2001	virtual reality; Virtual reality; virtual reality",
	2002	meetingaddress = "Poitiers, Fr",
	2003	meetingdate = "Aug 26--30 1996",
	2004	meetingdate2 = "08/26--30/96",
	2005	sponsor = "CNRS; ERCIM; BARCO; EDF; SUN; et al",
	2006	sponsororg = "CNRS; BARCO; Electr. France; et al",
	2007	treatment = "P Practical",
	2008	who = "Havran Vlastimil: REN-0087",
	2009	}
	2010
	2011	@Article{Sbert:1993:IGB,
	2012	author = "M. Sbert",
	2013	title = "An integral geometry based method for fast form-factor
	2014	computation",
	2015	journal = "Com{\-}pu{\-}ter Graphics Forum",
	2016	volume = "12",
	2017	number = "3",
	2018	pages = "C409--C420",
	2019	month = "????",
	2020	year = "1993",
	2021	coden = "CGFODY",
	2022	ISSN = "0167-7055",
	2023	bibdate = "Mon Apr 14 10:23:20 MDT 1997",
	2024	acknowledgement = ack-nhfb,
	2025	classification = "C1140G (Monte Carlo methods); C4260 (Computational
	2026	geometry); C6130B (Graphics techniques)",
	2027	conflocation = "Barcelona, Spain; 6-10 Sept. 1993",
	2028	conftitle = "European Association for Computer Graphics 14th Annual
	2029	Conference and Exhibition. EUROGRAPHICS '93",
	2030	corpsource = "Dept. d'Inf. i Matematica Aplicada, Univ. Politecnica
	2031	de Catalunya, Barcelona, Spain",
	2032	keywords = "complexity; Complexity; complexity; computational
	2033	geometry; computer graphics; form-factor computation;
	2034	Form-factor computation; integral geometry based
	2035	method; Integral geometry based method; integration;
	2036	local; Local integration; luminance; Luminance;
	2037	methods; Monte Carlo; Monte Carlo techniques; ray
	2038	tracing; rendering algorithms; Rendering algorithms",
	2039	thesaurus = "Computational geometry; Computer graphics; Monte Carlo
	2040	methods; Ray tracing",
	2041	treatment = "P Practical; T Theoretical or Mathematical",
	2042	who = "Havran Vlastimil: REN-0088",
	2043	}
	2044
	2045	@TechReport{Shade:1996: ,
	2046	author = "Jonathan Shade and Dani Lischinski and David Salesin
	2047	and Tony {DeRose} and John Snyder",
	2048	title = "Hierarchical Image Caching for Accelerated
	2049	Walkthroughs of Complex Environments",
	2050	institution = "University of Washington",
	2051	pages = "1--22",
	2052	year = "1996",
	2053	month = jan,
	2054	who = "Havran Vlastimil: REN-0089",
	2055	}
	2056
	2057	@InProceedings{Sbert95-GMCPS,
	2058	author = "Mateu Sbert and Frederic Perez and Xavier Pueyo",
	2059	editor = "P. M. Hanrahan and W. Purgathofer",
	2060	year = "1995",
	2061	title = "Global {Monte} {Carlo}: {A} {Progressive} {Solution}",
	2062	booktitle = "Rendering Techniques '95 (Proceedings of the Sixth
	2063	Eurographics Workshop on Rendering)",
	2064	pages = "231--239",
	2065	publisher = "Springer-Verlag",
	2066	address = "New York, NY",
	2067	comments = "ISBN 3-211-82733-1",
	2068	who = "Havran Vlastimil: REN-0090",
	2069	}
	2070
	2071	@TechReport{Szirmay-Kalos98,
	2072	author = "Laszlo Szirmay-Kalos and Werner Purgathofer",
	2073	title = "Global Ray-bundle Tracing with Hardware Acceleration",
	2074	institution = " Technical University of Budapest",
	2075	number = "TR-186-2-98-18",
	2076	month = jun,
	2077	year = "1998",
	2078	keywords = "rendering equation, global radiance, Monte-Carlo and
	2079	quasi Monte Carlo integration, Importance Sampling,
	2080	Metropolis Method, z-buffer",
	2081	who = "Havran Vlastimil: REN-0091",
	2082	}
	2083
	2084	@InProceedings{Braun:1995:ADS,
	2085	author = "M. Braun and A. Formella",
	2086	title = "Anigraph - {A} Data Structure for Computer Animation",
	2087	booktitle = "Computer Animation '95",
	2088	year = "1995",
	2089	month = apr,
	2090	who = "Havran Vlastimil: REN-0092",
	2091	}
	2092
	2093	@InProceedings{EVL-1997-108,
	2094	author = "Jarkko Oikarinen",
	2095	title = "Using 3-Dimensional Seed Filling in View Space to
	2096	Accelerate Volume Rendering",
	2097	booktitle = "IEEE Visualization '97",
	2098	organization = "IEEE",
	2099	month = oct,
	2100	year = "1997",
	2101	language = "en",
	2102	postscript-url = "http://rieska.oulu.fi/~jto/papers/ieeevis97.ps",
	2103	postscript-url-md5 = "f2b002cd5c384fffe63cac6826e09ed3",
	2104	evlib-url = "http://visinfo.zib.de:80/Dienst/UI/2.0/Describe/evl.volumerendering%2FEVL-1997-108",
	2105	evlib-revision = "1st",
	2106	who = "Havran Vlastimil: REN-0093",
	2107	}
	2108
	2109	InProceedings{Bouatouch:1995:IWT,
	2110	author = "Kadi Bouatouch and Sumant Pattanaik",
	2111	title = "Interactive Walk-Through Using Particle Tracing",
	2112	booktitle = "Computer Graphics International '95",
	2113	year = "1995",
	2114	month = jun,
	2115	who = "Havran Vlastimil: REN-0094",
	2116	}
	2117
	2118	@Article{Pattanaik:1993:PEI,
	2119	author = "S. N. Pattanaik and S. P. Mudur",
	2120	title = "The potential equation and importance in illumination
	2121	computations",
	2122	journal = "Com{\-}pu{\-}ter Graphics Forum",
	2123	volume = "12",
	2124	number = "2",
	2125	pages = "131--136",
	2126	month = jun,
	2127	year = "1993",
	2128	coden = "CGFODY",
	2129	ISSN = "0167-7055",
	2130	bibdate = "Mon Apr 14 10:23:20 MDT 1997",
	2131	acknowledgement = ack-nhfb,
	2132	classification = "A0230 (Function theory, analysis); A4210
	2133	(Propagation and transmission in homogeneous media);
	2134	C4180 (Integral equations); C6130B (Graphics
	2135	techniques)",
	2136	corpsource = "Graphics and CAD Div., Nat. Centre for Software
	2137	Technol., Bombay, India",
	2138	keywords = "adjoint; Adjoint linear equations; adjoint linear
	2139	equations; Adjoint radiosity equation; brightness;
	2140	computer graphics; discrete; Discrete formulations;
	2141	equation; formulations; Global illumination; global
	2142	illumination; illumination computations; Illumination
	2143	computations; illumination computations;
	2144	importance-driven radiosity algorithm;
	2145	Importance-driven radiosity algorithm;
	2146	importance-driven radiosity algorithm; integral
	2147	equations; Integral equations; lighting; Linear
	2148	operators; linear operators; luminance; Luminance
	2149	equation; patch; Patch; potential equation; Potential
	2150	equation; potential equation; radiosity equation;
	2151	Surface potential; surface potential; transposes;
	2152	Transposes; transposes",
	2153	thesaurus = "Brightness; Computer graphics; Integral equations;
	2154	Lighting; Surface potential",
	2155	treatment = "T Theoretical or Mathematical",
	2156	who = "Havran Vlastimil: REN-0095",
	2157	}
	2158
	2159	@InProceedings{Fuchs:1983:NRT,
	2160	author = "H. Fuchs and G. D. Abram and E. D. Grant",
	2161	title = "Near real-time shaded display of rigid objects",
	2162	pages = "65--72",
	2163	journal = "Computer Graphics (SIGGRAPH '83 Proceedings)",
	2164	year = "1983",
	2165	month = jul,
	2166	conference = "held in Detroit, Michigan; 25--29 July 1983",
	2167	keywords = "I35 object data base, I37 shading, I37 visible surface
	2168	algorithm",
	2169	who = "Havran Vlastimil: REN-0096",
	2170	}
	2171
	2172	@InProceedings{Atherton:1983:SHS,
	2173	author = "Peter R. Atherton",
	2174	title = "A Scanline Hidden Surface Removal Procedure for
	2175	Constructive Solid Geometry",
	2176	pages = "73--82",
	2177	booktitle = "Computer Graphics (SIGGRAPH '83 Proceedings)",
	2178	volume = "17",
	2179	number = "3",
	2180	year = "1983",
	2181	month = jul,
	2182	conference = "held in Detroit, Michigan; 25--29 July 1983",
	2183	keywords = "CSG, I35 constructive solid geometry, I37 hidden
	2184	surface removal",
	2185	who = "Havran Vlastimil: REN-0097",
	2186	}
	2187
	2188	@Article{tvcg-1996-25,
	2189	author = "George Drettakis and Eugene L. Fiume",
	2190	email = "George.Drettakis@imag.fr",
	2191	title = "{Structured Penumbral Irradiance Computation}",
	2192	journal = "IEEE Transactions on Visualization and Computer
	2193	Graphics",
	2194	volume = "2",
	2195	number = "4",
	2196	month = dec,
	2197	year = "1996",
	2198	pages = "299--312",
	2199	abstract = "A definitive understanding of irradiance behavior in
	2200	penumbral regions has been hard to come by, mainly due
	2201	to the computational expense of determining the visible
	2202	parts of an area light source. Consequently, sampling
	2203	strategies have been mostly ad hoc, and evaluation of
	2204	the resulting approximations has been difficult. In
	2205	this paper, the structure of penumbral irradiance is
	2206	investigated empirically and numerically. This study
	2207	has been made feasible by the use of the discontinuity
	2208	mesh and the backprojection, an efficient data
	2209	structure representing visibility in regions of partial
	2210	occlusion. Regions of penumbrae in which irradiance
	2211	varies nonmonotonically are characterized empirically,
	2212	and numerical tests are performed to determine the
	2213	frequency of their occurrence. This study inspired the
	2214	development of two algorithms for the construction of
	2215	interpolating approximations to irradiance: One
	2216	algorithm reduces the number of edges in the mesh
	2217	defining the interpolant domain, and the other
	2218	algorithm chooses among linear, quadratic, and mixed
	2219	interpolants based on irradiance monotonicity. Results
	2220	from numerical tests and images are presented that
	2221	demonstrate good performance of the new algorithms for
	2222	various realistic test configurations.",
	2223	keywords = "Rendering, primary and global illumination, sampling,
	2224	interpolation, structure, penumbra, experimental study,
	2225	irradiance, radiosity, discontinuity meshing,
	2226	backprojection, mesh simplification, interpolant degree
	2227	reduction",
	2228	tvcg-abstract-url = "http://www.computer.org/tvcg/tg1996/v0299abs.htm",
	2229	who = "Havran Vlastimil: REN-0098",
	2230	}
	2231
	2232	@Article{tvcg-1996-24,
	2233	author = "Jeffry Nimeroff and Julie Dorsey and Holly Rushmeier",
	2234	email = "jnimerof@graphics.cis.upenn.edu and
	2235	dorsey@graphics.lcs.mit.edu and holly@watson.ibm.com",
	2236	title = "{Implementation and Analysis of an Image-Based Global
	2237	Illumination Framework for Animated Environments}",
	2238	journal = "IEEE Transactions on Visualization and Computer
	2239	Graphics",
	2240	volume = "2",
	2241	number = "4",
	2242	month = dec,
	2243	year = "1996",
	2244	pages = "283--298",
	2245	abstract = "We describe a new framework for efficiently computing
	2246	and storing global illumination effects for complex,
	2247	animated environments. The new framework allows the
	2248	rapid generation of sequences representing any
	2249	arbitrary path in a ``view space'' within an
	2250	environment in which both the viewer and objects move.
	2251	The global illumination is stored as time sequences of
	2252	range-images at base locations that span the view
	2253	space. We present algorithms for determining locations
	2254	for these base images, and the time steps required to
	2255	adequately capture the effects of object motion. We
	2256	also present algorithms for computing the global
	2257	illumination in the base images that exploit spatial
	2258	and temporal coherence by considering direct and
	2259	indirect illumination separately. We discuss an initial
	2260	implementation using the new framework. Results and
	2261	analysis of our implementation demonstrate the
	2262	effectiveness of the individual phases of the approach;
	2263	we conclude with an application of the complete
	2264	framework to a complex environment that includes object
	2265	motion.",
	2266	keywords = "Animation, global illumination, image-based rendering,
	2267	radiosity, ray tracing, walk-throughs",
	2268	tvcg-abstract-url = "http://www.computer.org/tvcg/tg1996/v0283abs.htm",
	2269	who = "Havran Vlastimil: REN-0099",
	2270	}
	2271
	2272	@Article{Danskin:1992:FAV,
	2273	author = "John Danskin and Pat Hanrahan",
	2274	title = "Fast Algorithms for Volume Ray Tracing",
	2275	year = "1992",
	2276	journal = "1992 Workshop on Volume Visualization",
	2277	institution = "ACM",
	2278	pages = "91--98",
	2279	annote = "We examine various simple algorithms that exploit
	2280	homogeneity and accumulated opacity for tracing rays
	2281	through shaded volumes. Most of these meth- ods have
	2282	error criteria which allow them to trade quality for
	2283	speed. The time vs. quality tradeoff for these adaptive
	2284	methods is compared to fixed step multiresolution
	2285	methods. These methods are also useful for general
	2286	light transport in volumes.",
	2287	who = "Havran Vlastimil: REN-0100",
	2288	}
	2289
	2290	@InProceedings{Aupperle:1993:HIA,
	2291	author = "L. Aupperle and Pat Hanrahan",
	2292	booktitle = "Computer Graphics Proceedings, Annual Conference
	2293	Series, 1993",
	2294	title = "A Hierarchical Illumination Algorithm for Surfaces
	2295	with Glossy Reflection",
	2296	pages = "155--162",
	2297	year = "1993",
	2298	keywords = "adaptive meshing, global illumination, radiosity, ray
	2299	tracing",
	2300	annote = "We develop a radiance formulation for discrete three
	2301	point transport, and a new measure and description of
	2302	reflectance:area reflectance. This formulation and
	2303	associated reflectance allow an estimate of error in
	2304	the computation of radiance across triples of surface
	2305	elements, and lead directly to a hierarchical
	2306	refinement algorithm for global illumination. We have
	2307	implemented and analyzed this algorithm over surfaces
	2308	exhibiting glossy specular and diffuse reflection.
	2309	Theoretical growth in light transport computation is
	2310	shown to be O ( n + k 3 ) for sufficient refinement,
	2311	where n is the number of elements at the finest level
	2312	of subdivision over an environment consisting of k
	2313	input polygonal patches Ñ this growth is exhibited in
	2314	experimental trials. Naive application of three point
	2315	transport would require computation over O ( n 3 )
	2316	element-triple interactions.",
	2317	keywords = "adaptive meshing, global illumination, radiosity, ray
	2318	tracing",
	2319	who = "Havran Vlastimil: REN-0101",
	2320	}
	2321
	2322	@Article{Cohen-Or:1998:TDD,
	2323	author = "Daniel Cohen-Or and Amira Solomovic and David Levin",
	2324	title = "Three-dimensional distance field metamorphosis",
	2325	journal = "ACM Transactions on Graphics",
	2326	volume = "17",
	2327	number = "2",
	2328	pages = "116--141",
	2329	month = apr,
	2330	year = "1998",
	2331	coden = "ATGRDF",
	2332	ISSN = "0730-0301",
	2333	bibdate = "Sat May 16 07:25:59 MDT 1998",
	2334	url = "http://www.acm.org:80/pubs/citations/journals/tog/1998-17-2/p116-cohen-or/",
	2335	abstract = "Given two or more objects of general topology,
	2336	intermediate objects are constructed by a distance
	2337	field metamorphosis. In the presented method the
	2338	interpolation of the distance field is guided by a warp
	2339	function controlled by a set of corresponding anchor
	2340	points. Some rules for defining a smooth
	2341	least-distorting warp function are given. To reduce the
	2342	distortion of the intermediate shapes, the warp
	2343	function is decomposed into a rigid rotational part and
	2344	an elastic part. The distance field interpolation
	2345	method is modified so that the interpolation is done in
	2346	correlation with the warp function. The method provides
	2347	the animator with a technique that can be used to
	2348	create a set of models forming a smooth transition
	2349	between pairs of a given sequence of keyframe models.
	2350	The advantage of the new approach is that it is capable
	2351	of morphing between objects having a different
	2352	topological genus where no correspondence between the
	2353	geometric primitives of the models needs to be
	2354	established. The desired correspondence is defined by
	2355	an animator in terms of a relatively small number of
	2356	anchor points",
	2357	acknowledgement = ack-nhfb,
	2358	keywords = "algorithms",
	2359	subject = "{\bf I.3.7} Computing Methodologies, COMPUTER
	2360	GRAPHICS, Three-Dimensional Graphics and Realism,
	2361	Animation. {\bf I.3.5} Computing Methodologies,
	2362	COMPUTER GRAPHICS, Computational Geometry and Object
	2363	Modeling, Curve, surface, solid, and object
	2364	representations. {\bf I.3.6} Computing Methodologies,
	2365	COMPUTER GRAPHICS, Methodology and Techniques,
	2366	Interaction techniques.",
	2367	who = "Havran Vlastimil: REN-0102",
	2368	}
	2369
	2370
	2371	@INPROCEEDINGS{IMMD9:39:1997,
	2372	author = {Ph. Slusallek},
	2373	title = {Photo-Realistic Rendering -- Recent Trends and Developments},
	2374	booktitle = {EUROGRAPHICS '97 State-of-the-Art-Report},
	2375	year = {1997},
	2376	organization = {Eurographics Association},
	2377	who = "Havran Vlastimil: REN-0103",
	2378	}
	2379
	2380	@TECHREPORT{IMMD9:TR5:1998,
	2381	author = {C. Teitzel AND M. Hopf AND R. Grosso AND T. Ertl},
	2382	title = {Volume Ray Casting on Sparse Grids},
	2383	number = {5},
	2384	year = {1998},
	2385	institution = {Universität Erlangen-Nürnberg},
	2386	who = "Havran Vlastimil: REN-0104",
	2387	}
	2388

Note: See TracBrowser for help on using the repository browser.

Context Navigation

source: trunk/VUT/doc/SciReport/Bib/renmame.bib @ 243

Download in other formats: