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

Revision 243, 35.9 KB checked in by bittner, 19 years ago (diff)

SciReport? template
Line 
1% wanted
2
3@TechReport{fussell88a,
4        author =       "Donald Fussell and K. R. Subramanian",
5        title =        "Fast Ray Tracing Using {K}-{D} Trees",
6        institution =  "U. of Texas, Austin, Dept. Of Computer Science",
7        type =         "Technical Report",
8        number =       "TR-88-07",
9        month =        mar,
10        year =         "1988",
11        keywords =     "hierarchies",
12}
13
14@INPROCEEDINGS{Heckbert92discon,
15AUTHOR={Paul S. Heckbert},
16TITLE={Discontinuity Meshing for Radiosity},
17BOOKTITLE={Third Eurographics Workshop on Rendering},
18MONTH={May},
19YEAR={1992},
20ADDRESS={Bristol, UK},
21PAGES={203-216},
22KEYWORDS={radiosity, adaptive mesh, visibility},
23}
24
25@InProceedings{kaplan85a,
26        author =       "M. Kaplan",
27        title =        "Space-Tracing: {A} Constant Time Ray-Tracer",
28        pages =        "149--158",
29        booktitle =    "SIGGRAPH '85 State of the Art in Image Synthesis seminar
30 notes",
31        year =         "1985",
32        month =        jul,
33        publisher =    "Addison Wesley",
34        keywords =     "ray tracing cull",
35}
36
37
38% collected
39
40@InProceedings{Greene93a,
41  author =       "N. Greene and M. Kass and G. Miller",
42  title =        "Hierarchical {Z}-Buffer Visibility",
43  booktitle =    "Computer Graphics (Proceedings of SIGGRAPH '93)",
44  year =         "1993",
45  pages =        "231--238"
46}
47
48@InProceedings{thibault87a,
49author =       "William C. Thibault and Bruce F. Naylor",
50title =        "Set Operations on Polyhedra Using Binary Space
51Partitioning Trees",
52pages =        "153--162",
53booktitle =      "Proceedings of SIGGRAPH '87",
54volume =       "21",
55year =         "1987",
56month =        jul,
57keywords =     "polyhedra, set operations, geometric modeling,
58geometric search, point location",
59}
60
61@InProceedings{Coorg96b
62, author =      "Coorg, Satyan and Teller, Seth"
63, title =       "Temporally Coherent Conservative Visibility"
64, booktitle =   "Proceedings of the Twelfth Annual ACM Symposium on Computational Geometry"
65, year =        1996
66, optaddress =  "Philadelphia, PA"
67, month =       may
68, documentURL = "http://graphics.lcs.mit.edu/~satyan/pubs/temporalvis-cg96.ps.Z"
69, pages = "78--87"
70}
71
72@InProceedings{Coorg97,
73  author =       "Satyan Coorg and Seth Teller",
74  title =        "Real-Time Occlusion Culling for Models with Large
75                 Occluders",
76  pages =        "83--90",
77  ISBN =         "0-89791-884-3",
78  booktitle =    "Proceedings of the Symposium on Interactive 3{D}
79                 Graphics",
80  optmonth =        apr # "27--30~",
81  publisher =    "ACM Press",
82  optaddress =      "New York",
83  year =         "1997",
84}
85
86@InProceedings{Rohlf:1994:IPH,
87  author =       "John Rohlf and James Helman",
88  booktitle =    "Proceedings of SIGGRAPH '94",
89  title =        "{IRIS} Performer: {A} High Performance Multiprocessing
90                 Toolkit for Real--{T}ime 3{D} Graphics",
91  pages =        "381--395",
92  month =        jul,
93  year =         "1994",
94}
95
96@InProceedings{Airey90,
97  author =       "Airey, John M. and Rohlf, John H. and {Brooks, Jr.}, Frederick P.",
98  title =        "Towards Image Realism with Interactive Update Rates in
99                 Complex Virtual Building Environments",
100  pages =        "41--50",
101  booktitle =    "1990 Symposium on Interactive 3D Graphics",
102  organization = "ACM SIGGRAPH",
103  year =         "1990",
104  optmonth =        mar,
105  keywords =     "model-space subdivision, potentially visible,
106                 radiosity, adaptive refinement",
107}
108
109@inproceedings{Teller93a
110, author =      "Teller, S. and Hanrahan, P."
111, title =       "Global visibility algorithms for illumination computations"
112, booktitle =   "Proceedings of SIGGRAPH '93"
113, year =        1993
114, pages =       "239--246"
115, keywords =    "hidden surface removal, visibility space, radiosity,
116                 global illumination, algorithmic triage"
117, documentURL = "http://www.cs.princeton.edu/staff/seth/visglobillum.ps.Z"
118, abstractURL = "http://www.cs.princeton.edu/gfx/papers/visglob"
119}
120
121@InProceedings{Teller91a
122, author =      "S. J. Teller and C. H. S{\'e}quin"
123, title =       "Visibility Preprocessing For Interactive Walkthroughs"
124, booktitle =   "Proceedings of SIGGRAPH '91"
125, month =       jul
126, year =        1991
127, pages =       "61--69"
128, keywords =     "architectural simulation, linear programming, superset visibility"
129}
130
131@phdthesis{Teller92b
132, author =       "Teller, Seth Jared"
133, title =       "Visibility Computations in Densely Occluded Polyhedral Environments"
134, school =      "Dept. of Computer Science, University of California"
135, address =     "Berkeley"
136, year =        1992
137, keywords =    "graphics, visibility preprocessing, linear programming, spatial decomposition, visibility graphs, Plucker coordinates"
138, documentURL =  "ftp://tr-ftp.cs.berkeley.edu/pub/tech-reports/csd/csd-92-708/all.ps"
139, note =         "Also available as Technical Report UCB//CSD-92-708"
140}
141
142@article{Yagel95a
143, author =      "Yagel, R. and Ray, W."
144, year =        1995
145, title =       "Visibility Computation for Efficient Walkthrough of Complex Environments"
146, journal =     "Presence: Teleoperators and Virtual Environments"
147, volume =      5
148, number =      1
149, page =        "45-60"
150, documentURL = "http://www.cis.ohio-state.edu/volviz/Papers/1995/presence.ps.gz"
151}
152
153@techreport{Georges95a
154, author        = "Georges, Chris"
155, title         = "Obscuration Culling on Parallel Graphics Architectures"
156, institution = "Department of Computer Science, University of N. Carolina, Chapel Hill"
157, number        = "TR95-017"
158, year          = 1995
159, documentURL   = "ftp://ftp.cs.unc.edu/pub/publications/techreports/95-017.ps.Z"
160}
161
162@InProceedings{Chin:1992:FOP,
163  author =       "Norman Chin and Steven Feiner",
164  title =        "Fast object-precision shadow generation for areal
165                 light sources using {BSP} trees",
166  pages =        "21--30",
167  booktitle =    "Computer Graphics (1992 Symposium on Interactive 3D
168                 Graphics)",
169  volume =       "25",
170  number =       "2",
171  year =         "1992",
172  month =        mar,
173  editor =       "David Zeltzer",
174  conference =   "held in Boston; 29 March - 1 April 1992",
175  keywords =     "shadow volume, area light source, penumbra, umbra",
176  annote =       "",
177}
178
179@Article{Moravec:1981:GWT,
180  author =       "Hans P. Moravec",
181  title =        "{3D} Graphics and the Wave Theory",
182  journal =      "Computer Graphics",
183  volume =       "15",
184  number =       "3",
185  pages =        "289--296",
186  month =        aug,
187  year =         "1981",
188  coden =        "CGRADI, CPGPBZ",
189  ISSN =         "0097-8930",
190  annote =       "A general overview of a new way of viewing light for
191                 computer graphics. He suggests using waves as the
192                 basis, and discusses the computational requirements and
193                 new capabilities. illumination by wave fronts, rather
194                 than light rays \\ A continuing trend in computer
195                 representation of three dimensional synthetic scenes is
196                 the ever more accurate modelling of complex
197                 illumination effects. Such effects provide cues
198                 necessary for a convincing illusion of reality. The
199                 best current methods simulate multiple specular
200                 reflections and refractions, but handle at most one
201                 scattering bounce per light ray. They cannot accurately
202                 simulate diffuse light sources, nor indirect lighting
203                 via scattering media, without prohibitive increases in
204                 the already very large computing costs. \\ Conventional
205                 methods depend implicitly on a {\em particle} model;
206                 light propagates in straight and conceptually
207                 infinitely thin rays. This paper argues that a {\em
208                 wave} model has important computational advantages for
209                 the complex situations. In this approach, light is
210                 represented by wave fronts which are stored as two
211                 dimensional arrays of complex numbers. \\ The
212                 propagation of such a front can be simulated by a
213                 linear transform. Several advantages accrue.
214                 Propagations in a direction orthogonal to the plane of
215                 a front are convolutions which can be done by FFT in
216                 $O(n \log n)$ time rather than the $n^{2}$ time for a
217                 similar operation using rays. A typical speedup is
218                 about 10,000. The wavelength of the illumination sets a
219                 resolution limit which prevents unnecessary computation
220                 of elements smaller than will be visible. The generated
221                 wavefronts contain multiplicities of views of the
222                 scene, which can be individually extracted by passing
223                 them through different simulated lenses. Lastly the
224                 wavefront calculations are ideally suited for
225                 implementation on available array processors, which
226                 provide more cost effective calculation for this task
227                 than general purpose computers. \\ The wave method
228                 eliminates the aliasing problem; the wavefronts are
229                 inherently spatially filtered, but substitutes
230                 diffraction effects and depth of focus limitations in
231                 its stead.",
232  conference =   "held in Dallas, Texas; July 1981",
233  keywords =     "I30 wave theory, effects, parallel processing",
234}
235
236
237@Article{Rajkumar:1996:RFBSP,
238  author =       {A. Rajkumar and B.F. Naylor and F. Feisullin and L. Rogers},
239  title =        {Predicting RF coverage in large environments using
240ray--beam tracing and partitioning tree represented geometry},
241  journal =      {Wireless Netwoks},
242  year =         {1996},
243  volume =       {2},
244  pages =        {143--154},
245}
246
247@TechReport{Teller:1998:FC,
248  author =       {Seth Teller and John Alex},
249  title =        {Frustum casting for progressive, interactive rendering},
250  institution =  {MIT},
251  year =         {1998},
252  number =       {MIT LCS TR--740},
253  month =        {January},
254}
255
256@InProceedings{Lukaszewski98,
257  author =       "A. Lukaszewski and A. Formella",
258  title =        "Fast Penumbra Calculation in Ray Tracing",
259  booktitle =    "Proceedings of WSCG'98, the 6th International
260                 Conference in Central Europe on Computer Graphics and
261                 Visualization '98",
262  pages =        "238--245",
263  month =        feb,
264  year =         "1998",
265  keywords =     "shadow computation, stochastic ray tracing, bounding
266                 volumes",
267}
268
269
270
271@TechReport{Havran97:rep,
272  author = {Havran, V.},
273  title = {Spatial Data Structures for Visibility Computation},
274  institution = {CTU--FEE Prague},
275  number = {DC-PSR-97-05},
276  month = {May},
277  year = {1997},
278  note = {Postgraduate Study Report, 34 pages, also available as
279          ftp://www.cgg.cvut.cz/{}outgoing/havran/minimum/{}dc-psr-97-04.ps.gz},
280}
281
282@PhdThesis{Grant92,
283  author =       "Charles W. Grant",
284  title =        "Visibility Algorithms in Image Synthesis",
285  school =       "U. of California, Davis",
286  year =         "1992",
287  keywords =     "z buffer, ray tracing, shadow, taxonomy",
288  annote =       "partial electronic version available from
289                 grant1@llnl.gov, A successor to
290                 Sutherland-Sproull-Schumacker, Comput. Surv. 74",
291}
292
293@InProceedings{Berg93,
294  author =       "M. de Berg",
295  title =        "Generalized hidden surface removal",
296  pages =        "1--10",
297  ISBN =         "0-89791-582-8",
298  editor =       "ACM-SIGACT ACM-SIGGRAPH",
299  booktitle =    "Proceedings of the 9th Annual Symposium on
300                 Computational Geometry ({SCG} '93)",
301  address =      "San Diego, CA, USA",
302  month =        may,
303  year =         "1993",
304  publisher =    "ACM Press",
305}
306
307@Article{Franklin:1990:POH,
308  author =       "W. Randolph Franklin and Mohan S. Kankanhalli",
309  editor =       "Forest Baskett",
310  title =        "Parallel Object-Space Hidden Surface Removal",
311  journal =      "Computer Graphics",
312  volume =       "24",
313  number =       "4",
314  pages =        "87--94",
315  month =        aug,
316  year =         "1990",
317  coden =        "CGRADI, CPGPBZ",
318  ISSN =         "0097-8930",
319  conference =   "held in Dallas, Texas; 6--10 August 1990",
320}
321
322@Book{Foley90,
323  author =       "James D. Foley and Andries van Dam and Steven K.
324                 Feiner and John F. Hughes",
325  title =        "Computer Graphics: Principles and Practice",
326  edition =      "2nd",
327  pages =        "1174",
328  publisher =    "Addison-Wesley Publishing Co.",
329  address =      "Reading, MA",
330  year =         "1990",
331  mrnumber =     "B.Foley.90",
332  ISBN =         "0-201-12110-7",
333  contents =     "(not listed)",
334}
335
336@InProceedings{Zhang:1997:FBC,
337  author =       "Hansong Zhang and Kenneth E. {Hoff III}",
338  title =        "Fast Backface Culling Using Normal Masks",
339  booktitle =    "1997 Symposium on Interactive {3D} Graphics",
340  pages =        "103--106",
341  year =         "1997",
342  editor =       "Michael Cohen and David Zeltzer",
343  month =        apr,
344  organization = "ACM SIGGRAPH",
345  note =         "ISBN 0-89791-884-3",
346}
347
348@Article{tvcg-1997-21,
349  author =       "Kalpathi R. Subramanian and Bruce F. Naylor",
350  title =        "{Converting Discrete Images to Partitioning Trees}",
351  journal =      "IEEE Transactions on Visualization and Computer
352                 Graphics",
353  volume =       "3",
354  number =       "3",
355  month =        jul,
356  year =         "1997",
357  pages =        "273--?",
358  abstract =     "The discrete space representation of most scientific
359                 datasets (pixels, voxels, etc.), generated through
360                 instruments or by sampling continuously defined fields,
361                 while being simple, is also verbose and structureless.
362                 We propose the use of a particular spatial structure,
363                 the {\em binary space partitioning tree}, or, simply,
364                 {\em partitioning tree}, as a new representation to
365                 perform efficient geometric computation in discretely
366                 defined domains. The ease of performing affine
367                 transformations, set operations between objects, and
368                 correct implementation of transparency (exploiting the
369                 visibility ordering inherent to the representation)
370                 makes the partitioning tree a good candidate for
371                 probing and analyzing medical reconstructions, in such
372                 applications as surgery planning and prostheses design.
373                 The multiresolution characteristics of the
374                 representation can be exploited to perform such
375                 operations at interactive rates by smooth variation of
376                 the amount of geometry. Application to ultrasound data
377                 segmentation and visualization is proposed. The paper
378                 describes methods for constructing partitioning trees
379                 from a discrete image/volume data set. Discrete space
380                 operators developed for edge detection are used to
381                 locate discontinuities in the image from which
382                 lines/planes containing the discontinuities are fitted
383                 by using either the Hough transform or a hyperplane
384                 sort. A multiresolution representation can be generated
385                 by ordering the choice of hyperplanes by the magnitude
386                 of the discontinuities. Various approximations can be
387                 obtained by pruning the tree according to an error
388                 metric. The segmentation of the image into edgeless
389                 regions can yield significant data compression. A
390                 hierarchical encoding schema for both lossless and
391                 lossy encodings is described.",
392  keywords =     "-Partitioning trees, BSP trees, space partitioning,
393                 miltiresolution representations, image reconstruction,
394                 image coding, scientific visualization, MRI
395                 visualization",
396  tvcg-abstract-url = "http://www.computer.org/tvcg/tg1997/v0273abs.htm",
397  tvcg-pdf-url = "http://pdf.computer.org/tg/books/tg1997/pdf/v0273.pdf",
398}
399
400@InProceedings{Murali:1997:CSB,
401  author =       "T. M. Murali and Thomas A. Funkhouser",
402  title =        "Consistent Solid and Boundary Representations from
403                 Arbitrary Polygonal Data",
404  booktitle =    "1997 Symposium on Interactive {3D} Graphics",
405  pages =        "155--162",
406  year =         "1997",
407  editor =       "Michael Cohen and David Zeltzer",
408  month =        apr,
409  organization = "ACM SIGGRAPH",
410  note =         "ISBN 0-89791-884-3",
411}
412
413
414
415@InProceedings{Stewart:1998:AVM,
416  author =       {A. J. Stewart and T. Karkanis},
417  title =        {Computing the approximate visibility map, with applications to form factors and discontinuity meshing},
418  booktitle =    "Proceedings of the Ninth
419                 Eurographics Workshop on Rendering",
420  pages =        "57--68",
421  year  =        "1998",
422}
423
424
425@Article{Bishop:1998:DPG,
426  author =       "Lars Bishop and Dave Eberly and Turner Whitted and
427                 Mark Finch and Michael Shantz",
428  title =        "Designing a {PC} Game Engine",
429  journal =      "IEEE Computer Graphics and Applications",
430  volume =       "18",
431  number =       "1",
432  pages =        "46--53",
433  month =        jan # "\slash " # feb,
434  year =         "1998",
435  coden =        "ICGADZ",
436  ISSN =         "0272-1716",
437  bibdate =      "Thu Feb 26 12:06:17 MST 1998",
438  url =          "http://computer.org/cga/cg1998/g1046abs.htm;
439                 http://dlib.computer.org/cg/books/cg1998/pdf/g1046.pdf",
440  acknowledgement = ack-nhfb,
441}
442
443
444@TechReport{Wimmer:1998:FWIC,
445  author =       {M. Wimmer and M. Giegl and D. Schmalstieg},
446  title =        {Fast Walkthroughs with Image Caches and Ray Casting},
447  institution =  {Institut f\"ur Computergraphik, TU Wien},
448  year =         {1998},
449  number =       {TR-186-2-98-30},
450  month =        {December},
451}
452
453@TechReport{Wonka:1999:OSFW,
454  author =       {P. Wonka and D. Schmalstieg},
455  title =        {Occluder Shadows for Fast Walkthroughs of
456                  Urban Environments},
457
458  institution =  {Institut f\"ur Computergraphik, TU Wien},
459  year =         {1999},
460  number =       {TR-186-2-99-03},
461  month =        {January},
462}
463
464@TechReport{Szirmay-Kalos98a,
465  author =       "Laszlo Szirmay-Kalos",
466  title =        "Global Ray-bundle Tracing",
467  institution =  "Vienna University of Technology",
468  type =         "Technical Report,",
469  number =       "TR-186-2-98-18",
470  address =      "Vienna",
471  year =         "1998",
472}
473
474@InProceedings{Szirmay-Kalos98b,
475  author =       "Laszlo Szirmay-Kalos and Werner Purgathofer",
476  title =        "Global Ray-bundle Tracing with Hardware Acceleration",
477  booktitle =    "Ninth Eurographics Workshop on Rendering",
478  address =      "Vienna, Austria",
479  month =        jun,
480  year =         "1998",
481  keywords =     "hardware",
482}
483
484@InProceedings{Snyder:1998:VSC,
485  author =       "John Snyder and Jed Lengyel",
486  title =        "Visibility Sorting and Compositing Without Splitting
487                 for Image Layer Decomposition",
488  booktitle =    "SIGGRAPH 98 Conference Proceedings",
489  editor =       "Michael Cohen",
490  series =       "Annual Conference Series",
491  year =         "1998",
492  organization = "ACM SIGGRAPH",
493  publisher =    "Addison Wesley",
494  month =        jul,
495  pages =        "219--230",
496  note =         "ISBN 0-89791-999-8",
497  keywords =     "visibility sorting, compositing, nonsplitting layered
498                 decomposition, occlusion cycle, occlusion graph,
499                 sprite, kd-tree",
500  annote =       "We present an efficient algorithm for visibility
501                 sorting a set of moving geometric objects into a
502                 sequence of image layers which are composited to
503                 produce the final image. Instead of splitting the
504                 geometry as in previous visibility approaches, we
505                 detect mutual occluders and resolve them using an
506                 appropriate image compositing expression or merge them
507                 into a single layer. Such an algorithm has many
508                 applications in computer graphics; we demonstrate two:
509                 rendering acceleration using image interpolation and
510                 visibility-correct depth of field using image blurring.
511                 We propose a new, incremental method for identifying
512                 mutually occluding sets of objects and computing a
513                 visibility sort among these sets. Occlusion queries are
514                 accelerated by testing on convex bounding hulls; less
515                 conservative tests are also discussed. Kd-trees formed
516                 by combinations of directions in object or image space
517                 provide an initial cull on potential occluders, and
518                 incremental collision detection algorithms are adapted
519                 to resolve pairwise occlusions, when necessary. Mutual
520                 occluders are further analyzed to generate an image
521                 compositing expression; in the case of nonbinary
522                 occlusion cycles, an expression can always be generated
523                 without merging the objects into a single layer.
524                 Results demonstrate that the algorithm is practical for
525                 real-time animation of scenes involving hundreds of
526                 objects each comprising hundreds or thousands of
527                 polygons.",
528}
529
530@InProceedings{Plantinga:1990:RTH,
531  author =       "Harry Plantinga and Charles R. Dyer and W. Brent
532                 Seales",
533  title =        "Real-Time Hidden-Line Elimination for a Rotating
534                 Polyhedral Scene Using the Aspect Representation",
535  pages =        "9--16",
536  booktitle =    "Proceedings of Graphics Interface '90",
537  year =         "1990",
538  month =        may,
539  conference =   "held in Halifax, Nova Scotia; 14-18 May 1990",
540}
541
542@PhdThesis{Chrysantho1996a,
543  author =       "Yiorgos Chrysanthou",
544  school =       "QMW, Dept of Computer Science",
545  title =        "Shadow Computation for 3{D} Interaction and
546                 Animation",
547  year =         "1996",
548  keywords =     "Technical Report No. 715",
549  month =        jan,
550  scope =        "ace",
551}
552
553
554
555@PhdThesis{Campbell91,
556  author =       "A. T. {Campbell, III}",
557  title =        "Modeling Global Diffuse Illumination for Image
558                 Synthesis",
559  school =       "CS Dept, University of Texas at Austin",
560  year =         "1991",
561  month =        dec,
562  note =         "Tech. Report TR-91-39",
563  keywords =     "mesh generation, radiosity, penumbra, shadow",
564  pages =        "155",
565  abstract =     "Rapid developments in the design of algorithms for
566                 rendering globally illuminated scenes have taken place
567                 in the past five years. Net energy methods such as
568                 radiosity algorithms have become effective at computing
569                 the energy balance for scenes containing diffusely
570                 reflecting objects. Such methods first break up a scene
571                 description into a large set of elements, or possibly
572                 several levels of elements. Energy transfers among
573                 these elements are then determined using a variety of
574                 means. While much progress has been made in the design
575                 of energy transfer algorithms, little or no attention
576                 has been paid to the proper generation of the mesh of
577                 surface elements. This dissertation presents a
578                 technique for adaptively creating a mesh of surface
579                 elements as the energy transfers are computed. The
580                 method allows large numbers of small elements to be
581                 placed at parts of the scene where the most active
582                 energy transfers occur without requiring that other
583                 parts of the scene be subdivided needlessly to the same
584                 degree. As a result, the computational effort in the
585                 energy transfer computations can be concentrated where
586                 it has the most effect. Since the sources of direct and
587                 indirect illumination in the scene are polygonal
588                 elements, the effects of light sources with finite area
589                 must be computed. Most methods simplify the problem by
590                 approximating the area source with a collection of
591                 point sources. We present an object space algorithm to
592                 model illumination from polygonal light sources
593                 analytically. The result is a collection of
594                 smooth-shaded polygonal facets that may be rendered
595                 from any viewing position. Binary Space Partitioning
596                 trees are used to compute umbra and penumbra boundaries
597                 efficiently. Fast analytic techniques are developed for
598                 illumination calculations. Numerical optimization
599                 methods ensure that the shading function is sampled
600                 finely enough to find all significant illumination
601                 gradations. Illumination calculations are optimized to
602                 concentrate computational effort on parts of the scene
603                 where they are most needed.",
604}
605
606@PhdThesis{Drettakis94-SSRII,
607  author =       "George Drettakis",
608  month =        jan,
609  year =         "1994",
610  title =        "Structured {Sampling} and {Reconstruction} of
611                 {Illumination} for {Image} {Synthesis}",
612  number =       "293",
613  address =      "Toronto, Ontario",
614  school  =  "Department of Computer Science, University of
615                 Toronto",
616  type =         "{CSRI} {Technical} {Report}",
617  comments =     "available via anonymous ftp as:
618                 ftp.csri.toronto.edu:csri-technical-reports/293 and via
619                 the World Wide Web at:
620                 http://safran.imag.fr/Membres/George.Drettakis/pub.html",
621}
622
623@Article{Schroeder:1993:FFB,
624  author =       "P. Schroeder and P. Hanrahan",
625  title =        "On the Form Factor between Two Polygons",
626  journal =      "Computer Graphics",
627  volume =       "27",
628  number =       "{Annual Conference Series}",
629  pages =        "163--164",
630  year =         "1993",
631  bibdate =      "Thu Feb 6 10:16:14 MST 1997",
632  acknowledgement = ack-nhfb,
633  keywords =     "ACM; computer graphics; SIGGRAPH",
634}
635
636@PhdThesis{Funkhouser93phd,
637  author =       "Thomas A. Funkhouser",
638  title =        "Database and Display Algorithms for Interactive
639                 Visualization of Architectural Models",
640  school =       "CS Division, UC Berkeley",
641  year =         "1993",
642  keywords =     "multiresolution, architectural walkthrough",
643}
644
645@Book{Boissonnat98,
646  author =       {J.-D. Boissonnat and M. Yvinec},
647  title =        {Algorithmic Geometry},
648  publisher =    {cambridge University Press},
649  year =         1998,
650  where =        {A19}
651}
652
653
654
655
656@Misc{Chrysanthou:1998:VP,
657  author =       {Y. Chrysanthou and D. Cohen-Or and E. Zadicario},
658  title =        {Viewspace Partitioning of Densely Occluded Scenes},
659  howpublished = {Abstract of a video presentation,
660at the 13th Annual ACM Symposium on Computational Geometry, Minnesota, pages 413--414},
661  month =        {June},
662  year =         {1998},
663}
664
665
666@Unpublished{Sagadic,
667  author =       {Amela Sagadic},
668  title =        {An Algorithm for Invariant Polygon Visibility Orderings},
669  note =         {Downloaded from the WWW}
670}
671
672@Unpublished{Teichmann:WV,
673  author =       {Marek Teichmann and Seth Teller},
674  title =        {A Weak Visibility Algorithm with an Application to an Interactive Walkthrough},
675  note =         {Downloaded from the WWW}
676}
677
678@inproceedings{Tanaka91,
679       author =       "Toshimitsu Tanaka and Tokiichiro Takahashi",
680       title =        "Shading with Area Light Sources",
681       booktitle =    "Eurographics '91",
682       publisher =    "North-Holland",
683       pages =        "235--246, 535--537",
684       month =        sep,
685       year =         "1991",
686       annote = "no shadows",
687     }
688
689@InProceedings{Wang98,
690  author =       {Yigang Wang and Hujun Bao and Qunsheng Peng},
691  title =        {Accelerated Walkthroughs of Virtual Environments Based on
692Visibility Preprocessing and Simplification},
693  booktitle =    {Eurographics '98},
694  volume =       {17},
695  number =       {3},
696  year =         {1998},
697  pages =        {187--194},
698}
699
700@InProceedings{Nechvile99,
701  author =       {Karel Nechv\'\i{}le and Petr Tobola},
702  title =        {Local Approach to Dynamic Visibility in a Plane},
703  booktitle =    {Proceedings of WSCG'99, the 7th International
704                 Conference in Central Europe on Computer Graphics and
705                 Visualization '99},
706  year =         {1999},
707  pages =        {202--208},
708}
709@InProceedings{Tobola99,
710  author =       {Petr Tobola and Karel Nechv\'\i{}le},
711  title =        {Linear Size BSP trees for Scenes with Low Directional Density},
712  booktitle =    {Proceedings of WSCG'99, the 7th International
713                 Conference in Central Europe on Computer Graphics and
714                 Visualization '99},
715  year =         {1999},
716  pages =        {297--304},
717}
718
719@InProceedings{grant85a,
720  author =       "C. W. Grant",
721  title =        "Integrated Analytic Spatial and Temporal Anti-Aliasing
722                 for Polyhedra in 4-Space",
723  pages =        "79--84",
724  booktitle =      "Computer Graphics (SIGGRAPH '85 Proceedings)",
725  volume =       "19",
726  number =       "3",
727  year =         "1985",
728  month =        jul,
729  editor =       "B. A. Barsky",
730  conference =   "held in San Francisco, CA; 22--26 July 1985",
731  keywords =     "I37 anti-aliasing, temporal, I37 anti-aliasing, I37
732                 visible surface algorithms",
733}
734
735@InProceedings{Schilling:1997:TRT,
736  author =       "Andreas Schilling",
737  title =        "Toward Real-Time Photorealistic Rendering: Challenges
738                 and Solutions",
739  booktitle =    "1997 SIGGRAPH / Eurographics Workshop on Graphics
740                 Hardware",
741  editor =       "Steven Molnar and Bengt-Olaf Schneider",
742  year =         "1997",
743  organization = "ACM SIGGRAPH / Eurographics",
744  publisher =    "ACM Press",
745  address =      "New York City, NY",
746  month =        aug,
747  pages =        "7--16",
748  note =         "ISBN 0-89791-961-0",
749  keywords =     "antialiasing, bump mapping, environment mapping,
750                 anisotropic filtering",
751  annote =       "A growing number of real-time applications need
752                 graphics with photorealistic quality, especially in the
753                 field of training (virtual operation, driving and
754                 flight simulation), but also in the areas of design or
755                 ergonomic research. We take a closer look at main
756                 deficiencies of today's real time graphics hardware and
757                 present solutions for several of the identified
758                 problems in the areas of antialiasing and texture-,
759                 bump- and reflection mapping. In the second part of the
760                 paper, a new method for antialiasing bump maps is
761                 explained in more detail.",
762}
763
764@Article{Greene:1994:EAR,
765  author =       "N. Greene and M. Kass",
766  title =        "Error-Bounded Antialiased Rendering of Complex
767                 Environments",
768  journal =      "Computer Graphics",
769  volume =       "28",
770  number =       "{Annual Conference Series}",
771  pages =        "59--66",
772  month =        jul,
773  year =         "1994",
774  coden =        "CGRADI",
775  ISSN =         "0097-8930",
776  bibdate =      "Thu Feb 6 08:30:20 MST 1997",
777  acknowledgement = ack-nhfb,
778  keywords =     "ACM; computer graphics; SIGGRAPH",
779}
780
781@InProceedings{Bartz98,
782  author =       {Dirk Bartz and Michael Meissner and Tobias H\"uttner},
783  title =        {Extending Graphics Hardware for Occlusion Queries in OpenGL},
784  booktitle =    {Proceedings of the 1998 Workshop on Graphics Hardware},
785  pages =        {97--104},
786  year  =        {1998},
787}
788
789
790@Article{Clark:1976:HGM,
791  author =       "James H. Clark",
792  title =        "Hierarchical Geometric Models for Visible Surface
793                 Algorithms",
794  journal =      "Communications of the ACM",
795  volume =       "19",
796  number =       "10",
797  pages =        "547--554",
798  month =        oct,
799  year =         "1976",
800  coden =        "CACMA2",
801  ISSN =         "0001-0782",
802  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
803  abstract =     "By using an extension of traditional structure
804                 information, or a geometric hierarchy, five significant
805                 improvements to current techniques of computer picture
806                 production are possible. First, the range of complexity
807                 of an environment is greatly increased while the
808                 visible complexity of any given scene is kept within a
809                 fixed upper limit. Second, a meaningful way is provided
810                 to vary the amount of detail presented in a scene.
811                 Third, ``clipping'' becomes a very fast logarithmic
812                 search for the resolvable parts of the environment
813                 within the field of view. Fourth, frame to frame
814                 coherence and clipping define a graphical ``working
815                 set,'' or fraction of the total structure that should
816                 be present in primary store for immediate access by the
817                 visible surface algorithm. Finally, the geometric
818                 structure suggests a recursive descent, visible surface
819                 algorithm in which the computation time potentially
820                 grows linearly with the visible complexity of the
821                 scene.",
822  acknowledgement = ack-nhfb,
823  classcodes =   "C5540 (Terminals and graphic displays); C6130B
824                 (Graphics techniques)",
825  classification = "723; 921",
826  corpsource =   "Univ. of California, Santa Cruz, CA, USA",
827  journalabr =   "Commun ACM",
828  keywords =     "algorithms; computer graphics; geometric models;
829                 hidden surface; hierarchical data structures; image
830                 processing; mathematical techniques --- Combinatorial
831                 Mathematics; model; visible surface algorithms",
832  treatment =    "A Application; P Practical; T Theoretical or
833                 Mathematical",
834}
835
836@Book{Skiena:1998:ADM,
837  author =       "Steven S. Skiena",
838  title =        "The Algorithm Design Manual",
839  publisher =    "Spring{\-}er-Ver{\-}lag",
840  address =      "Berlin, Germany~/ Heidelberg, Germany~/ London, UK~/
841                 etc.",
842  pages =        "xvi + 486",
843  year =         "1998",
844  ISBN =         "0-387-94860-0",
845  LCCN =         "QA76.9.A43S55 1997",
846  bibdate =      "Tue Feb 10 10:51:27 1998",
847  price =        "US\$54.95",
848  acknowledgement = ack-nhfb,
849}
850
851
852@Book{Blinn:1996:JBC,
853  author =       "Jim Blinn",
854  title =        "{Jim Blinn}'s Corner: {A} Trip Down the Graphics
855                 Pipeline",
856  publisher =    "Morgan Kaufmann Publishers",
857  address =      "Los Altos, CA 94022, USA",
858  pages =        "vii + 214",
859  year =         "1996",
860  ISBN =         "1-55860-387-5",
861  LCCN =         "T385.B585 1996",
862  bibdate =      "Tue Jan 28 14:26:03 1997",
863  note =         "This book is a collection of columns from the journal
864                 IEEE Computer Graphics and Applications.",
865  acknowledgement = ack-nhfb,
866}
867
868@Book{Blinn:1998:JBC,
869  author =       "Jim Blinn",
870  title =        "{Jim Blinn}'s Corner: Dirty Pixels",
871  publisher =    "Morgan Kaufmann Publishers",
872  address =      "Los Altos, CA 94022, USA",
873  pages =        "256",
874  year =         "1998",
875  ISBN =         "1-55860-455-3",
876  LCCN =         "T385.B586 1998",
877  bibdate =      "Tue Jan 28 14:26:03 1997",
878  note =         "This book is a collection of columns from the journal
879                 IEEE Computer Graphics and Applications.",
880  acknowledgement = ack-nhfb,
881}
882
883
884@Book{Prep85,
885  author =       "F. P. Preparata and M. I. Shamos",
886  title =        "Computational Geometry~: An Introduction",
887  publisher =    "Springer-Verlag",
888  year =         "1985",
889}
890
891@ARTICLE{Gigus90,
892    AUTHOR    = "Ziv Gigus and Jitendra Malik",
893    TITLE     = "Computing the aspect graph for line drawings of polyhedral objects",
894    JOURNAL   = "IEEE Transactions on Pattern Analysis and Machine Intelligence",
895    VOLUME    = 12,
896    NUMBER    = 2,
897    MONTH     = Feb,
898    YEAR      = 1990,
899    PAGES     = "113--122"
900}
901
902@Article{Blinn:1998:JBCc,
903  author =       "Jim Blinn",
904  title =        "Jim Blinn's Corner: Ten More Unsolved Problems in
905                 Computer Graphics",
906  journal =      "IEEE Computer Graphics \& Applications",
907  year =         "1998",
908  volume =       "18",
909  number =       "5",
910  month =        sep # " -- " # oct,
911  note =         "ISSN 0272-1716",
912}
Note: See TracBrowser for help on using the repository browser.