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

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

SciReport? template

RevLine 
[243]1
2@TechReport{EVL-1998-675,
3  author =       "Andr{\'e} Hinkenjann and Heinrich M{\"u}ller",
4  title =        "Determining Visibility between Extended Objects",
5  number =       "675/1998",
6  type =         "Research Report",
7  institution =  "University of Dortmund",
8  address =      "Universit{\"a}t Dortmund, 44221 Dortmund, Germany",
9  month =        aug,
10  year =         "1998",
11  who  = "Havran Vlastimil: VIS-0090",
12}
13
14@TechReport{EVL-1996-10,
15  author =       "Andr{\'e} Hinkenjann and Heinrich M{\"u}ller",
16  title =        "Hierarchical Blocker Trees for Global Visibility
17                 Calculation",
18  number =       "621/1996",
19  type =         "Research Report",
20  institution =  "University of Dortmund",
21  month =        aug,
22  year =         "1996",
23  abstract =     "We present a technique to determine visibility within
24                 geometric scenes, as required for more advanced
25                 rendering approaches in computer graphics. Visibility
26                 types considered are completely visible, completely
27                 blocked and partially blocked. In a preprocessing step,
28                 the given scene is recursively subdivided into a
29                 hierarchy of subscenes. For each resulting subscene, a
30                 so called blocker tree is calculated which holds
31                 information about the visibility type of viewing lines
32                 passing through a bounding box enclosing the scene. The
33                 resulting hierarchical blocker tree is used to answer
34                 queries for the visibility between two subscenes. This
35                 approach is implemented in flatland based on quadtrees,
36                 and analyzed experimentally.",
37  postscript-url = "ftp://euklid.informatik.uni-dortmund.de/pub/reports/ls7/rr-6
3821.ps.gz",
39  evlib-url =    "http://infovis.zib.de:8000/Dienst/UI/2.0/Describe/evl.computat
40ionalgeometry%2FEVL-1996-10",
41  evlib-revision = "1st",
42  evlib-postscript-md5 = "2abfecb868f469b0af855c1167f7dd14",
43  who  = "Havran Vlastimil: VIS-0089",
44}
45
46@inproceedings{addpp-vr-95,
47 author =      "Boris Aronov and Alan R. Davis and Tamal K. Dey and
48                Sudebkumar P. Pal and D. Chithra Prasad",
49 title =       "Visibility with Reflection",
50 booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom.",
51 year =        1995,
52 pages =       "316--325",
53 keywords =    "mirrors",
54 cites =       "addpp-vmr-95, ak-frtrc-87, bo-arcgi-79, dpp-agpvr-95,
55                ea-lacvp-81, fkn-vsgpt-80, ghlst-ltavs-87, g-bp-86,
56                hv-splsp-49,  k-ealdp-89, kw-onupp-91, l-vsp-83, ll-ccagp-86,
57                lpsssstwy-clcsp-88, o-agta-87, rty-ccrt-94, s-rrag-92,
58                s-mlppr-87, s-sldps-90, ZZZ",
59 update =      "98.03 bibrelex, 95.09 mitchell",
60 who  = "Havran Vlastimil: VIS-0088",
61}
62
63@Article{Sharir:1992:SOS,
64  author =       "Micha Sharir and Mark H. Overmars",
65  title =        "A Simple Output-Sensitive Algorithm for Hidden Surface
66                 Removal",
67  journal =      "ACM Transactions on Graphics",
68  volume =       "11",
69  number =       "1",
70  pages =        "1--11",
71  month =        jan,
72  year =         "1992",
73  coden =        "ATGRDF",
74  ISSN =         "0730-0301",
75  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
76  url =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/112141.html",
77  abstract =     "We derive a simple output-sensitive algorithm for
78                 hidden surface removal in a collection of n triangles
79                 in space for which a (partial) depth order is known. If
80                 $k$ is the combinatorial complexity of the output
81                 visibility map, the method runs in time $O(n\sqrt{k}
82                 \log n)$. The method is extended to work for other
83                 classes of objects as well, sometimes with even
84                 improved time bounds. For example, we obtain an
85                 algorithm that performs hidden surface removal for n
86                 (nonintersecting) balls in time $O(n^{3/2}\log n+k)$",
87  acknowledgement = ack-nhfb,
88  keywords =     "algorithms; hidden surface removal; theory",
89  subject =      "{\bf I.3.7}: Computing Methodologies, COMPUTER
90                 GRAPHICS, Three-Dimensional Graphics and Realism,
91                 Hidden line/surface removal. {\bf F.2.2}: Theory of
92                 Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
93                 COMPLEXITY, Nonnumerical Algorithms and Problems,
94                 Geometrical problems and computations. {\bf I.3.5}:
95                 Computing Methodologies, COMPUTER GRAPHICS,
96                 Computational Geometry and Object Modeling, Geometric
97                 algorithms, languages, and systems.",
98  who  = "Havran Vlastimil: VIS-0087",
99}
100
101@InProceedings{Westermann:1997:VVO,
102  author =       "R{\"{u}}diger Westermann and Thomas Ertl",
103  title =        "The {VSBUFFER}: Visibility Ordering of Unstructured
104                 Volume Primitives by Polygon Drawing",
105  booktitle =    "IEEE Visualization \'97",
106  editor =       "Roni Yagel and Hans Hagen",
107  year =         "1997",
108  organization = "IEEE",
109  month =        nov,
110  pages =        "35--42",
111  who  = "Havran Vlastimil: VIS-0086",
112}
113
114@InProceedings{COZ-gi98,
115  title =        "Visibility Streaming for Network-based Walkthroughs",
116  author =       "Daniel Cohen-Or and Eyal Zadicario",
117  booktitle =    "Graphics Interface",
118  year =         "1998",
119  month =        jun,
120  pages =        "1--7",
121  who  = "Havran Vlastimil: VIS-0085",
122}
123
124@InProceedings{Soler:1996:AEB,
125  author =       "Cyril Soler and Fran{\c{c}}ois Sillion",
126  title =        "Accurate Error Bounds for Multi-Resolution
127                 Visibility",
128  booktitle =    "Eurographics Rendering Workshop 1996",
129  editor =       "Xavier Pueyo and Peter Schr{\"{o}}der",
130  year =         "1996",
131  organization = "Eurographics",
132  publisher =    "Springer Wein",
133  address =      "New York City, NY",
134  month =        jun,
135  pages =        "133--142",
136  note =         "ISBN 3-211-82883-4",
137  keywords =     "error bounds, hierarchical radiosity, multi-resolution
138                 visibility, error-driven refinement, visibility
139                 correlation",
140  annote =       "We propose a general error-driven algorithm to compute
141                 form factors in complex scenes equipped with a suitable
142                 cluster hierarchy. This opens the way for the efficient
143                 approximation of form factors in a controlled manner,
144                 with guaranteed error bounds at every stage of the
145                 calculation. In particular we discuss the issues of
146                 bounding the error in the form factor approximation
147                 using average cluster transmittance, combining
148                 subcluster calculations with proper treatment of
149                 visibility correlation, and the calculation and storage
150                 of the necessary information in the hierarchy. We
151                 present results from a 2D implementation, that
152                 demonstrate the validity of the approach; the form
153                 factor approximations are efficiently bounded by the
154                 user-supplied threshold.",
155  who  = "Havran Vlastimil: VIS-0084",
156}
157
158@Article{Pueyo:1996:OAT,
159  author =       "Xavier Pueyo and Frederic P{\'e}rez and Toni
160                 Sellar{\`e}s and Josep Suy",
161  title =        "An object-oriented approach for teaching visibility
162                 computation algorithms",
163  journal =      "Computers and Graphics",
164  volume =       "20",
165  number =       "4",
166  pages =        "605--610",
167  month =        jul # "--" # aug,
168  year =         "1996",
169  coden =        "COGRD2",
170  ISSN =         "0097-8493",
171  bibdate =      "Wed Feb 5 07:22:58 MST 1997",
172  acknowledgement = ack-nhfb,
173  affiliation =  "Universitat de Girona",
174  affiliationaddress = "Spain",
175  classification = "721.1; 723; 723.5; 921.4",
176  journalabr =   "Comput Graphics (Pergamon)",
177  keywords =     "Abstraction; Algorithms; Computational complexity;
178                 Computational geometry; Computer graphics; Object
179                 recognition; Ray casting; Scan line; Visibility
180                 computation algorithms; Visualization",
181  who  = "Havran Vlastimil: VIS-0083",
182}
183
184@InProceedings{james-cgf-98,
185   author =       "A. James and A.M. Day",
186   title =        "The Priority Face Determination Tree for Hidden Surface
187                  Removal",
188   pages =        "55-71",
189   booktitle =      "Computer Graphics Forum",
190   volume =       "17",
191   number =       "1",
192   year =         "1998",
193   month =        "march",
194   who  = "Havran Vlastimil: VIS-0082",
195}
196
197@inproceedings{james-eguk-98,
198  author = "A. James and A.M. Day",
199  title = "Conflict Neutralization on Binary Space Partitioning
200           (extended abstract)",
201  booktitle = "Eurographics UK Proceedings",
202  year = 1998,
203  month = "march",
204  volume = 16,
205  pages = "225 - 229",
206  who = "Havran Vlastimil: VIS-0081",
207}
208
209@inproceedings{james-eguk-97,
210  author = "A. James and A.M. Day",
211  title = "The Priority Face Determination Tree",
212  booktitle = "Eurographics UK Proceedings",
213  year = 1997,
214  month = "march",
215  volume = 15,
216  pages = "21 - 46",
217  who = "Havran Vlastimil: VIS-0080",
218}
219
220@inproceedings{cohen-egc-98,
221  author = "D. Cohen-Or and G. Fibich and D. Halperin and E. Zadicario",
222  title = "Conservative Visibility and Strong Occlusion for Viewspace
223           Partitioning of Densely Occluded Scenes",
224  booktitle = "EUROGRAPHICS'98",
225  year = "1998",
226  who = "Havran Vlastimil: VIS-0079",
227}
228
229@InCollection{deb93,
230  author =       "M. De Berg",
231  title =        "Ray shooting, Depth Orders and Hidden Surface
232                 Removal",
233  year =         "1993",
234  booktitle =    "Lecture Notes in Computer Science",
235  volume =       "703",
236  publisher =    "Springer Verlag, New York",
237  topic =        "visibility",
238  who = "Havran Vlastimil: VIS-0078",
239}
240
241@InProceedings{Funkhouser98,
242  author =       "Thomas Funkhouser and Ingrid Carlbom and Gary Elko and
243                 Gopal Pingali and Mohan Sondhi and Jim West",
244  title =        "A Beam Tracing Approach to Acoustic Modeling for
245                 Interactive Virtual Environments",
246  booktitle =    "Computer Graphics (Proceedings of SIGGRAPH '98)",
247  pages =        "21--32",
248  month =        jul,
249  year =         "1998",
250  who = "Havran Vlastimil: VIS-0077",
251}
252
253@PhdThesis{Teller92phd,
254  author =       "Seth J. Teller",
255  title =        "Visibility Computations in Densely Occluded Polyhedral
256                 Environments",
257  school =       "CS Division, UC Berkeley",
258  month =        oct,
259  year =         "1992",
260  note =         "Tech. Report UCB/CSD-92-708",
261  keywords =     "computational geometry, architectural walkthrough",
262  who = "Havran Vlastimil: VIS-0076",
263}
264
265@InProceedings{Aliaga:1997:AWU,
266  author =       "Daniel G. Aliaga and Anselmo A. Lastra",
267  title =        "Architectural Walkthroughs Using Portal Textures",
268  booktitle =    "IEEE Visualization \'97",
269  editor =       "Roni Yagel and Hans Hagen",
270  year =         "1997",
271  organization = "IEEE",
272  month =        nov,
273  pages =        "355--362",
274  who = "Havran Vlastimil: VIS-0075",
275}
276
277@InProceedings{Stewart93-OSACS,
278  author =       "A. James Stewart and Sherif Ghali",
279  month =        aug,
280  year =         "1993",
281  title =        "An {Output} {Sensitive} {Algorithm} for the
282                 {Computation} of {Shadow} {Boundaries}",
283  booktitle =    "Canadian Conference on Computational Geometry",
284  pages =        "291--296",
285  who = "Havran Vlastimil: VIS-0074",
286}
287
288@InProceedings{Kumar:1996:HBF,
289  author =       "Subodh Kumar and Dinesh Manocha and William Garrett
290                 and Ming Lin",
291  title =        "Hierarchical Back-Face Computation",
292  booktitle =    "Eurographics Rendering Workshop 1996",
293  editor =       "Xavier Pueyo and Peter Schr{\"{o}}der",
294  year =         "1996",
295  organization = "Eurographics",
296  publisher =    "Springer Wein",
297  address =      "New York City, NY",
298  month =        jun,
299  pages =        "235--244",
300  note =         "ISBN 3-211-82883-4",
301  annote =       "We present a sub-linear algorithm to compute the set
302                 of back-facing polygons in a polyhedral model. The
303                 algorithm partitions the model into hierarchical
304                 clusters based on the orientations and positions of the
305                 polygons. As a pre-processing step, the algorithm
306                 constructs spatial decompositions with respect to each
307                 cluster. For a sequence of back-face computations, the
308                 algorithm exploits the coherence in view-point movement
309                 to efficiently determine if it is in front of or behind
310                 a cluster. Due to coherence, the algorithm's
311                 performance is linear in the number of clusters on
312                 average. We have applied this algorithm to speed up the
313                 rendering of polyhedral models. On average, we are able
314                 to cull almost half the polygons. The algorithm
315                 accounts for 5 - 10% of the total CPU time per frame on
316                 an SGI Indigo2 Extreme. The overall frame rate is
317                 improved by 40 - 75% as compared to the standard
318                 back-face culilng implemented in hardware.",
319    who = "Havran Vlastimil: VIS-0073",
320}
321
322@InProceedings{Zhang97a,
323  author =       "Hansong Zhang and Kenneth E. Hoff III",
324  month =        "???",
325  year =         "1997",
326  title =        "Accelerated Walkthrough of Large Spline Models",
327  booktitle =    "Symposium on Interactive 3D Graphics, 1997",
328  who  = "Havran Vlastimil: VIS-0072",
329}
330
331@Article{Orti:1996:RDS,
332  author =       "Rachel Orti and Stephane Riviere and Fredo Durand and
333                 Claude Puech",
334  title =        "Radiosity for Dynamic Scenes in Flatland with the
335                 Visibility Complex",
336  journal =      "Com{\-}pu{\-}ter Graphics Forum",
337  volume =       "15",
338  number =       "3",
339  pages =        "C237--C248",
340  month =        sep,
341  year =         "1996",
342  coden =        "CGFODY",
343  ISSN =         "0167-7055",
344  bibdate =      "Tue Mar 17 15:44:38 MST 1998",
345  acknowledgement = ack-nhfb,
346  affiliation =  "iMAGIS\slash GRAVIR - IMAG",
347  affiliationaddress = "Grenoble, Fr",
348  affiliationaddress = "Fr",
349  classification = "723.2; 723.5; 741.1; 741.2; 921.4; C4260
350                 (Computational geometry); C6130B (Graphics
351                 techniques)",
352  conference =   "Proceedings of the 1996 17th Annual Conference and
353                 Exhibition of the European Association for Computer
354                 Graphics, EUROGRAPHICS'96",
355  conflocation = "Poitiers, France; 26-30 Aug. 1996",
356  conftitle =    "European Association for Computer Graphics 17th Annual
357                 Conference and Exhibition. EUROGRAPHICS '96",
358  corpsource =   "IMAG, Grenoble, France",
359  journalabr =   "Comput Graphics Forum",
360  keywords =     "Algorithms; Architectural simulation; Calculations;
361                 Computational geometry; Computer graphics; Computer
362                 simulation; Data structures; Discontinuity mesh; Form
363                 factor; Global illumination; Image synthesis; Lighting;
364                 Lighting design; Radiosity; Static environment; Three
365                 dimensional; Two dimensional; Visibility; Visibility
366                 complex; Visualization",
367  keywords =     "2D method; algorithm; Algorithms; Architectural
368                 simulation; brightness; Calculations; computational
369                 geometry; Computational geometry; computational
370                 geometry; computer graphics; Computer graphics;
371                 Computer simulation; data structure; Data structures;
372                 discontinuity mesh; Discontinuity mesh; discontinuity
373                 mesh; dynamic environments; dynamic scenes; factors;
374                 flatland; form; Form factor; global; Global
375                 illumination; illumination; Image synthesis; image
376                 synthesis; Lighting; lighting; Lighting design;
377                 polygonal scenes; Radiosity; radiosity method; Static
378                 environment; static scenes; Three dimensional; Two
379                 dimensional; visibility; Visibility; visibility;
380                 Visibility complex; visibility complex; Visualization",
381  meetingaddress = "Poitiers, Fr",
382  meetingdate =  "Aug 26--30 1996",
383  meetingdate2 = "08/26--30/96",
384  sponsor =      "CNRS; ERCIM; BARCO; EDF; SUN; et al",
385  sponsororg =   "CNRS; BARCO; Electr. France; et al",
386  treatment =    "T Theoretical or Mathematical",
387  who = "Havran Vlastimil: VIS-0071",
388}
389
390@InProceedings{Kumar97,
391  author =       "Subodh Kumar and  Dinesh Manocha and  Kenneth E. Hoff III and                  Hansong Zhang",
392  month =        "???",
393  year =         "1997",
394  title =        "Accelerated Walkthrough of Large Spline Models",
395  booktitle =    "Symposium on Interactive 3D Graphics, 1997",
396  who  = "Havran Vlastimil: VIS-0070",
397}
398
399@InProceedings{Orti96-UVCRC,
400  author =       "Rachel Orti and Stephane Riviere and Fredo Durand and
401                 Claude Puech",
402  month =        may,
403  year =         "1996",
404  title =        "Using the {Visibility} {Complex} for {Radiosity}
405                 {Computation}",
406  booktitle =    "Lecture Notes in Computer Science (Applied
407                 Computational Geometry: Towards Geometric
408                 Engineering)",
409  volume =       "1148",
410  pages =        "177--190",
411  publisher =    "Springer-Verlag",
412  address =      "Berlin, Germany",
413  who  = "Havran Vlastimil: VIS-0069",
414}
415
416@Article{EVL-1996-194,
417  author =       "R. Yagel and W. Ray",
418  title =        "Visibility Computation for Efficient Walkthrough
419                 Complex Environments",
420  journal =      "PRESENCE",
421  volume =       "5",
422  number =       "1",
423  pages =        "1--16",
424  year =         "1996",
425  language =     "en",
426  abstract =     "In many virtual reality applications as well as
427                 general computer graphics we need to consider large
428                 numbers of objects in order to render one image. In
429                 many cases rendering can be preceded by a culling phase
430                 which employs simple mechanisms to reject most of the
431                 objects. As a result, only a very small portion of the
432                 model has to go through the time consuming process of
433                 hidden object removal. We report on such a culling
434                 mechanism that is based on regular space subdivision
435                 into cells followed by cell classification into
436                 interior, exterior, and wall cells. A special
437                 cell-to-cell visibility algorithm is then activated
438                 between every two non-exterior cells. Only the objects
439                 in the potentially visible set of cells are actually
440                 submitted to the hidden object removal algorithm. We
441                 report on the implementation of the algorithm and its
442                 performance for walkthrough of various environments.",
443  postscript-url = "http://www.cis.ohio-state.edu/volviz/Papers/1995/presence.ps.gz",
444  evlib-url =    "http://visinfo.zib.de:80/Dienst/UI/2.0/Describe/evl.volumerendering%2FEVL-1996-194",
445  postscript-url-md5 = "614ddffe140b1fb6e4b238c7923097aa",
446  evlib-revision = "1st",
447  who = "Havran Vlastimil: VIS-0068",
448}
449
450@TechReport{Krishnan:TR94063:1994,
451  author = "S. Krishnan and D. Manocha",
452  number = "TR94-063",
453  title = "Global Visibility and Hidden Surface Algorithms for Free Form Surfaces",
454  institution = "University of North Carolina, Chapel Hill, NC 27599-3175",
455  year = 1994,
456  month = nov,
457  documentURL = "ftp://ftp.cs.unc.edu/pub/users/manocha/papers/visibility/visib.ps.Z",
458  who = "Havran Vlastimil: VIS-0067",
459}
460
461@Misc{Hoff98,
462  author = "Kenneth E. Hoff III",
463  title = "Faster 3D Game Graphics by Not Drawing What Is Not Seen",
464  documentURL = "http://www.acm.org/crossroads/xrds3-4/faster3d.html",
465  who  = "Havran Vlastimil: VIS-0066",
466}
467
468@InProceedings{Luebke:1995:PMS,
469  author =       "David Luebke and Chris Georges",
470  title =        "Portals and Mirrors: Simple, Fast Evaluation of
471                 Potentially Visible Sets",
472  editor =       "Pat Hanrahan and Jim Winget",
473  pages =        "105--106",
474  booktitle =    "1995 Symposium on Interactive {3D} Graphics",
475  year =         "1995",
476  organization = "ACM SIGGRAPH",
477  month =        apr,
478  who  = "Havran Vlastimil: VIS-0065",
479}
480
481@Misc{Holmes96,
482  author = "John Holmes",
483  title = "Binary Space Partitioning (BSP) Trees",
484  documentURL = "http://www.cis.ufl.edu/~jch/is-final.ps",
485  who  = "Havran Vlastimil: VIS-0064",
486}
487
488@Misc{BSPFAQ,
489  author = "et al",
490  title = "BSP Tree Frequently Asked Questions (FAQ)",
491  documentURL = "http://reality.sgi.com/bspfaq/",
492  who  = "Havran Vlastimil: VIS-0063",
493}
494
495@Misc{Campbel96,
496  author = "A.T. Campbell, III",
497  title = "BSP Trees: An Introduction and an Implementation",
498  year = 1996,
499  month = mar,
500  pages = "8",
501  who  = "Havran Vlastimil: VIS-0062",
502}
503
504@InProceedings{Martinka95a,
505  author =       "Josef Martinka and Ludovit Niepel and Andrej Ferko",
506  title =        "Sweeping Algorithm for Scene Visibility Graph",
507  pages =        "11--16",
508  booktitle =    "Summer school in computer graphics in Bratislava (SCCG95)",
509  year =         "1995",
510  month =        jun,
511  keywords =     "ray tracing",
512  who  = "Havran Vlastimil: VIS-0061",
513}
514
515@InProceedings{Sojka92,
516  author =       "E. Sojka",
517  title =        "Potencial viditelnosti a jeho vypocet",
518  booktitle =    "Winter School of Computer Graphics 1992",
519  year =         "1992",
520  month =        "feb",
521  pages =        "36--46",
522  note =         "held at University of West Bohemia, Plzen, Czech
523                 Republic, February 1992",
524  who = "Havran Vlastimil: VIS-0060",
525}
526
527@InProceedings{Fuchs80a,
528  author =       "Fuchs, H. and Kedem, Z. M. and Naylor, B. F.",
529  title =        "On Visible Surface Generation by a Priori Tree Structures",
530  pages =        "124--133",
531  booktitle =      "Computer Graphics (SIGGRAPH '80 Proceedings)",
532  volume =       "14",
533  number =       "3",
534  year =         "1980",
535  month =        jul,
536  keywords =     "graphical data/base/structures, Algorithmic Aspects hidden line/surface removal, surface generation, Three-Dimensional Graphics realism, Applications of Computer Graphics electrical engineering power engineering, Painter's Algorithm",
537  who = "Havran Vlastimil: VIS-0059",
538}
539
540@TechReport{Cazals:3204:1997,
541  author = "F. Cazals and M. Sbert",
542  number = "RR-3204",
543  title = "Some integral geometry tools to estimate the complexity of
544           3D scenes",
545  institution = "The French National Institue for Research in
546                 Computer Science and Control (INRIA)",
547  year = 1997,
548  month = jul,
549  documentURL = "ftp://ftp.inria.fr/INRIA/publication/RR/RR-3204.ps.gz",
550  keywords = "Average case analysis, Stochastic geometry, Computer Graphics",
551  who = "Havran Vlastimil: VIS-0058",
552}
553
554@inproceedings{pv-cvgpt-95,
555  author =      "M. Pocchiola and G. Vegter",
556  title =       "Computing the Visibility Graph via Pseudo-Triangulations",
557  booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom.",
558  year =        1995,
559  pages =       "248--257",
560  keywords =    "topological sweep, visibility complex",
561  cites =       "ce-oails-92, eg-tsa-89, gt-ltasc-85, gm-osacv-91,
562                 hmrt-sjslt-86, ow-nmcvg-88, pv-vc-93, s-ec-86,
563                 w-cvgnl-85, ZZZ",
564  update =      "98.03 bibrelex, 96.05 pocchiola, 95.09 mitchell",
565  who = "Havran Vlastimil: VIS-0057",
566}
567
568@inproceedings{pv-vc-93,
569  author =      "M. Pocchiola and G. Vegter",
570  title =       "The visibility complex",
571  booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom.",
572  year =        1993,
573  pages =       "328--337",
574  precedes =    "pv-vc-96",
575  cites =       "cg-vippg-89, gm-osacv-91, hm-oacvp-91, p-gfr-90, v-vddsv-90,
576                 v-dmvg-91, w-cvgnl-85, ZZZ",
577 update =      "98.03 bibrelex, 97.03 devillers, 93.09 jones",
578 who = "Havran Vlastimil: VIS-0056",
579}
580
581@TechReport{Mount:TR9771,
582  author = "David M. Mount and Fan-Tao Pu",
583  number = "UMIACS-TR-96-71",
584  title = "Stabbing Orthogonal Objects in 3-Space",
585  institution = "University of Maryland Institute for Advanced Computer
586                Studies~Dept. of Computer Science, Univ. of Maryland",
587  year = 1996,
588  month = oct,
589  documentURL = "ftp://ftp.cs.umd.edu/pub/papers/papers/3701/3701.ps.Z",
590  keywords = "Lines in 3-space, Plucker coordinates, approximation algorithms,
591              orthogonal polygons, computer graphics",
592  who = "Havran Vlastimil: VIS-0055",
593}
594
595@TechReport{Miller:CS9615,
596 author =      "Timothy Miller",
597 title =       "Hidden-Surfaces: Combining BSP Trees with Graph-Based Algorithms",
598  institution = "Department of Computer Graphics, Brown University",
599  number =      "CS-96-15",
600  month =       apr,
601  year =        1996,
602  documentURL = "http://www.cs.brown.edu/publications/techreports/reports/CS-96-15.html",
603  who = "Havran Vlastimil: VIS-0054",
604}
605
606@inproceedings{chrysanthou:1996:five,
607   author = "Yiorgos Chrysanthou",
608   title = "A Fast and Accurate Shadow Algorithm for Dynamic Scenes",
609   booktitle = "A symposium of the Framework for Immersive Virtual
610                Environments Working Group",
611  year = "1996",
612  month = oct,
613  pages = "??--??",
614  address = "Geneva, Switzerland",
615  who = "Havran Vlastimil: VIS-0053",
616}
617
618@inproceedings{sadagic:1996:five,
619   author = "Amela Sadagic",
620   title = "Fast Approximate Quantitative Visibility for Complex Scenes",
621   booktitle = "A symposium of the Framework for Immersive Virtual
622                Environments Working Group",
623  year = "1996",
624  month = oct,
625  pages = "??--??",
626  address = "Geneva, Switzerland",
627  who = "Havran Vlastimil: VIS-0052",
628}
629
630@inproceedings{chrysanthou:cgi:98,
631  author = "Chrysanthou, Y. and Cohen-Or, D. and Lischinski, D.",
632  title = "Fast Approximate Quantitative Visibility for Complex Scenes",
633  booktitle = "Proceedings of Computer Graphics International '98 (CGI'98)",
634  year = "1998",
635  month = jun,
636  pages = "23--31",
637  address = "Hannover, Germany",
638  publisher = "IEEE, NY",
639  who = "Havran Vlastimil: VIS-0051",
640}
641
642@inproceedings{barelber:cgi:98,
643  author = "Bar-Lev, A. and Elber, G.",
644  title = "Visibility as an Intrinsic Property of Geometric Models",
645  booktitle = "Proceedings of Computer Graphics International '98 (CGI'98)",
646  year = "1998",
647  month = jun,
648  pages = "198--206",
649  address = "Hannover, Germany",
650  publisher = "IEEE, NY",
651  who = "Havran Vlastimil: VIS-0050",
652}
653
654@inproceedings{hinkenjann:cgi:98,
655  author = "Hinkenjann, A. and Muller, H.",
656  title = "Determining Visibility between Extended Objects",
657  booktitle = "Proceedings of Computer Graphics International '98 (CGI'98)",
658  year = "1998",
659  month = jun,
660  pages = "23--31",
661  address = "Hannover, Germany",
662  publisher = "IEEE, NY",
663  who = "Havran Vlastimil: VIS-0049",
664}
665
666@inproceedings{iones:cgi:98,
667  author = "Iones, A. and Zhukov, S. and Krupkin, A.",
668  title = "On Optimality of OBBs for Visibility Tests for Frustrum Culling,
669           Ray Shooting and Collision Detection",
670  booktitle = "Proceedings of Computer Graphics International '98 (CGI'98)",
671  year = "1998",
672  month = jun,
673  pages = "256--263",
674  address = "Hannover, Germany",
675  publisher = "IEEE, NY",
676  who = "Havran Vlastimil: VIS-0048",
677}
678
679
680@inproceedings{bb12590,
681  AUTHOR = "Shimshoni, I. and Ponce, J.",
682  TITLE = "Finite Resolution Aspect Graphs of Polyhedral Objects",
683  BOOKTITLE = "WQV93",
684  YEAR = "1993",
685  PAGES = "140-150",
686  who = "Havran Vlastimil: VIS-0046",
687}
688
689@inproceedings{devai-star-97,
690  author = "F. D\`{e}vai",
691  title = "On the Computational Requirements of Virtual Reality Systems",
692  booktitle = "State of Art, Eurographics'97",
693  year = 1997,
694  who = "Havran Vlastimil: VIS-0045",
695}
696
697
698@article{bb12595,
699        AUTHOR = "Eggert, D.W. and Bowyer, K.W. and Dyer, C.R. and Christensen, H.I. and Goldgof, D.B.",
700        TITLE = "The Scale Space Aspect Graph",
701        JOURNAL = "PAMI",
702        VOLUME = "15",
703        YEAR = "1993",
704        NUMBER = "11",
705        MONTH = "November",
706        PAGES = "1114-1130",
707  who = "Havran Vlastimil: VIS-0044",
708}
709
710@inproceedings{r-tsvcp-95,
711  author =      "St\'{e}phane Rivi\`{e}re",
712  title =       "Topologically Sweeping the Visibility Complex of
713                 Polygonal Scenes",
714  booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom.",
715  year =        1995,
716  pages =       "C36--C37",
717  keywords =    "visibility graph optimal algorithm, experimental",
718  cites =       "eg-tsa-86, gm-osacv-87, ow-nmcvg-88, pv-savgc-93, pv-vc-93,
719                 pv-cvgpt-95, r-ectac-93, ZZZ",
720  update =      "98.03 bibrelex, 95.09 mitchell",
721  who = "Havran Vlastimil: VIS-0043",
722}
723
724@inproceedings{r-wvcav-97,
725  author =      "St\'ephane Rivi\`ere",
726  title =       "Walking in the Visibility Complex with Applications
727                 to Visibility Polygons and Dynamic Visibility",
728  booktitle =   "Proc. 9th Canad. Conf. Comput. Geom.",
729  year =        1997,
730  pages =       "147--152",
731  update =      "97.11 jones",
732  who = "Havran Vlastimil: VIS-0042",
733}
734
735@inproceedings{r-dvpsv-97,
736 author = "S. Rivi{\`e}re",
737 title = "Dynamic visibility in polygonal scenes with the visibility complex",
738 booktitle = "Proc. 13th Annu. ACM Sympos. Comput. Geom.",
739 year = 1997,
740 pages = "421--423",
741 who = "Havran Vlastimil: VIS-0041",
742}
743
744@Article{Slater:1992a,
745  author =       "M. Slater",
746  title =        "A Comparison of Three Shadow Volume Algorithms",
747  journal =      "The Visual Computer",
748  volume =       "9",
749  number =       "1",
750  pages =        "25--38",
751  year =         "1992",
752  who = "Havran Vlastimil: VIS-0040",
753}
754
755@inproceedings{slater97a,
756 author =      "M. Slater and Y. Chrysanthou",
757 title =       "View Volume Culling Using a Probabilistic Caching
758Scheme",
759 booktitle =   "ACM Virtual Reality Software and Technology VRST'97",
760 year =        1997,
761 month = sep,
762 address =      "Lausanne, Switzerland",
763 pages =       "??-??",
764 who = "Havran Vlastimil: VIS-0039",
765}
766
767@TechReport{Coorg96a,
768 author =      "Coorg, Satyan and Teller, Seth",
769 title =       "A Spatially and Temporally Coherent Object Space Visibility Algorithm",
770  institution = "Department of Computer Graphics, MIT",
771  number =      "TM-546",
772  month =       feb,
773  year =        1996,
774  documentURL = "http://graphics.lcs.mit.edu/~satyan/pubs/mit-lcs-tm-546.ps.Z",
775  who = "Havran Vlastimil: VIS-0038",
776}
777
778@inproceedings{blais98a,
779 author =      "M. Blais and P. Poulin",
780 title =       "Sampling Visibility in Three-Space",
781 booktitle =   "Proc. of the 1998 Western Computer Graphics Symposium",
782 year =        1998,
783 month = apr,
784 pages =       "45--52",
785 who = "Havran Vlastimil: VIS-0037",
786}
787
788@Article{Sudarsky:1996:OVA,
789  author =       "Oded Sudarsky and Craig Gotsman",
790  title =        "Output-Sensitive Visibility Algorithms for Dynamic
791                 Scenes with Applications to Virtual Reality",
792  journal =      "Com{\-}pu{\-}ter Graphics Forum",
793  volume =       "15",
794  number =       "3",
795  pages =        "C249--C258",
796  month =        sep,
797  year =         "1996",
798  coden =        "CGFODY",
799  ISSN =         "0167-7055",
800  bibdate =      "Tue Mar 17 15:44:38 MST 1998",
801  acknowledgement = ack-nhfb,
802  affiliation =  "Technion - Israel Inst of Technology",
803  affiliationaddress = "Haifa, Isr",
804  affiliationaddress = "Isr",
805  classification = "722.4; 723.1; 723.2; 723.5; 741.2; 921.4; C6120
806                 (File organisation); C6130B (Graphics techniques);
807                 C6150N (Distributed systems software)",
808  conference =   "Proceedings of the 1996 17th Annual Conference and
809                 Exhibition of the European Association for Computer
810                 Graphics, EUROGRAPHICS'96",
811  conflocation = "Poitiers, France; 26-30 Aug. 1996",
812  conftitle =    "European Association for Computer Graphics 17th Annual
813                 Conference and Exhibition. EUROGRAPHICS '96",
814  corpsource =   "Dept. of Comput. Sci., Israel Inst. of Technol.,
815                 Haifa, Israel",
816  journalabr =   "Comput Graphics Forum",
817  keywords =     "Algorithms; Client server design; Computational
818                 geometry; Computer graphics; Computer simulation; Data
819                 structures; Distributed computer systems; Distributed
820                 multi user virtual environment; Dynamic scenes; Output
821                 sensitive visibility algorithm; Temporal bounding
822                 volumes; Virtual reality; Visibility",
823  keywords =     "Algorithms; auxiliary data structure; Client server
824                 design; client-server systems; communications;
825                 Computational geometry; Computer graphics; Computer
826                 simulation; current position; Data structures;
827                 Distributed computer systems; Distributed multi user
828                 virtual environment; distributed virtual; dynamic
829                 object; dynamic objects; dynamic scenes; Dynamic
830                 scenes; environments; hidden feature removal; model;
831                 multiple; Output sensitive visibility algorithm;
832                 output-sensitive visibility algorithms; overhead;
833                 runtime; scene; spatial data; structures; temporal
834                 bounding volumes; Temporal bounding volumes; temporal
835                 bounding volumes; updated spatial data structure;
836                 virtual reality; Virtual reality; Visibility;
837                 visibility; visible graphic primitives",
838  meetingaddress = "Poitiers, Fr",
839  meetingdate =  "Aug 26--30 1996",
840  meetingdate2 = "08/26--30/96",
841  sponsor =      "CNRS; ERCIM; BARCO; EDF; SUN; et al",
842  sponsororg =   "CNRS; BARCO; Electr. France; et al",
843  treatment =    "T Theoretical or Mathematical",
844  who = "Havran Vlastimil: VIS-0036",
845}
846
847@inproceedings{hmclhz-aocus-97,
848 author =      "T. Hudson and D. Manocha and J. Cohen and M. Lin
849                 and K. Hoff and H. Zhang",
850 title =       "Accelerated Occlusion Culling Using Shadow Frustra",
851 booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom.",
852 year =        1997,
853 pages =       "1--10",
854 update =      "97.07 efrat",
855 who = "Havran Vlastimil: VIS-0035",
856}
857
858@InProceedings{Durand:1996:VCN,
859  author =       "Fr{\'{e}}do Durand and George Drettakis and Claude
860                 Puech",
861  title =        "The {3D} Visibility Complex: {A} New Approach to the
862                 Problems of Accurate Visibility",
863  booktitle =    "Proceedings of Eurographics Rendering Workshop '96",
864  year =         "1996",
865  publisher =    "Springer",
866  month =        jun,
867  pages =        "245--256",
868  keywords =     "visibility, visibility complex, spatial coherence,
869                 discontinuity meshing, form factor",
870  annote =       "Visibility computations are central in any computer
871                 graphics application. The most common way to reduce
872                 this expense is the use of approximate approaches using
873                 spatial subdivision. More recently analytic approaches
874                 efficently encoding visibility have appeared for 2D
875                 (the visibility complex) and for certain limited cases
876                 in 3D (aspect graph, discontinuity meshes). In this
877                 paper we propose a new way of describing and studying
878                 the visibility of 3D space by a dual space of the 3D
879                 lines, such that all the visibility events are
880                 described. A new data-structure is defined, called the
881                 3D visibility complex, which encapsulates all
882                 visibility events. This structure is global and
883                 complete since it encodes all visibility relations in
884                 3D, and is spatially coherent allowing efficient
885                 visibility queries such as view extraction, aspect
886                 graph, discontinuity mesh, or form factor computation.
887                 A construction algorithm and suitable data structures
888                 are sketched.",
889 who = "Havran Vlastimil: VIS-0034",
890}
891
892@InProceedings{Teller:1991:VPI,
893  author =       "Seth J. Teller and Carlo H. S{\'e}quin",
894  title =        "Visibility preprocessing for interactive
895                 walkthroughs",
896  pages =        "61--69",
897  booktitle =    "Computer Graphics (Proceedings of SIGGRAPH '91)",
898  year =         "1991",
899  keywords =     "architectural simulation, linear programming, superset
900                 visibility",
901  who = "Havran Vlastimil: VIS-0033",
902}
903
904@InProceedings{EVL-1997-163,
905  author =       "Hansong Zhang and Dinesh Manocha and Thomas Hudson and
906                 Kenneth E. {Hoff III}",
907  title =        "Visibility Culling Using Hierarchical Occlusion Maps",
908  booktitle =    "Computer Graphics (Proceedings of SIGGRAPH '97)",
909  pages =        "77--88",
910  year =         "1997",
911  keywords =     "visibility culling, interactive display, image
912                 pyramid, occlusion culling, hierarchical data
913                 structures",
914  language =     "en",
915  abstract =     "We present hierarchical occlusion maps (HOM) for
916                 visibility culling on complex models with high depth
917                 complexity. The culling algorithm uses an object space
918                 bounding volume hierarchy and a hierarchy of image
919                 space occlusion maps. Occlusion maps represent the
920                 aggregate of projections of the occluders onto the
921                 image plane. For each frame, the algorithm selects a
922                 small set of objects from the model as occluders and
923                 renders them to form an initial occlusion map, from
924                 which a hierarchy of occlusion maps is built. The
925                 occlusion maps are used to cull away a portion of the
926                 model not visible from the current viewpoint. The
927                 algorithm is applicable to all models and makes no
928                 assumptions about the size, shape, or type of
929                 occluders. It supports approximate culling in which
930                 small holes in or among occluders can be ignored. The
931                 algorithm has been implemented on current graphics
932                 systems and has been applied to large models composed
933                 of hundreds of thousands of polygons. In practice, it
934                 achieves significant speedup in interactive
935                 walkthroughs of models with high depth complexity.",
936  evlib-url =    "http://visinfo.zib.de:80/Dienst/UI/2.0/Describe/evl.computergraphics%2FEVL-1997-163",
937  evlib-revision = "1st",
938  who = "Havran Vlastimil: VIS-0032",
939}
940
941@InProceedings{Kumar:1996:HVC,
942  author =       "Subodh Kumar and Dinesh Manocha",
943  title =        "Hierarcical Visibility Culling for Spline Models",
944  booktitle =    "Graphics Interface '96",
945  editor =       "Wayne A. Davis and Richard Bartels",
946  year =         "1996",
947  organization = "Canadian Information Processing Society",
948  publisher =    "Canadian Human-Computer Communications Society",
949  month =        may,
950  pages =        "142--150",
951  note =         "ISBN 0-9695338-5-3",
952  keywords =     "NURBS rendering, visibility, backpatch, CAGD,
953                 ONE-tree",
954  annote =       "We present hierarchical algorithms for visibilit
955                 culling of spline models. This includes back-patch
956                 culling, a generalization of back-face culling for
957                 polygons to splines. These algorithms are extended to
958                 trimmed surfaces as well. We propose different spatial
959                 approximations for enclosing the normals of spline
960                 surface and compare them for efficiency and
961                 effectiveness on different graphics systems. We extend
962                 the culling algorithms using hierarchical techniques to
963                 collection of surface patches and combine them with
964                 view-frustum culling to formulate a ONE (Object-Normal
965                 Exclusion)-tree for a given model. The algorithm
966                 traverses the ONE-tree at run time and culls away
967                 portions of the model not visible from the current
968                 viewpoint. These algorithms have been implemented and
969                 applied to a number of large models. In practice, we
970                 are able to speed-up the overall spline rendering
971                 algorithms by about 20 - 30% based on back-patch
972                 culling only and by more than 50% using ONE-trees.",
973  who = "Havran Vlastimil: VIS-0031",
974}       
975
976@InProceedings{SOJKA:1995:FMG,
977  author =       "Eduard SOJKA",
978  title =        "Fields, Maps and Graphs of Properties of a Scene",
979  booktitle =    "Compugraphics '95",
980  pages =        "234--245",
981  year =         "1995",
982  month =        dec,
983  editor =       "Harold P. Santo",
984  note =         "ISBN 972-8342-00-4",
985  who = "Havran Vlastimil: VIS-0030",
986}
987
988@InProceedings{Sojka:1994:GPV,
989  author =       "Eduard Sojka",
990  title =        "Graf potencialu viditelnosti",
991  booktitle =    "Winter School of Computer Graphics 1994",
992  year =         "1994",
993  month =        jan,
994  note =         "held at University of West Bohemia, Plzen, Czech
995                 Republic, 19-20 January 1994",
996  keywords =     "graf potencialu viditelnosti, graf aspektu,
997                 viditelnost.",
998  pages = "168--173",
999  annote =       "Clanek podava novy pohled na teorii potencialu
1000                 viditelnosti. Tento pohled predpoklada, ze na mnozine
1001                 obrazu dane sceny lze zavest relaci ekvivalence. Tato
1002                 relace pak indukuje rozklad mnoziny obrazu, ktera je
1003                 nekonecna, na konecny pocet trid. Take prostor
1004                 obklopujici scenu je dekomponovan na tridy. Ze vsech
1005                 bodu jedne tridy vnima pozorovatel ekvivalentni obrazy.
1006                 Graf potencialu viditelnosti zachycuje informaci o
1007                 techto tridach a vztazich mezi nimi. Predkladana teorie
1008                 umoznuje zasadit publikovane pristupy do jednotneho
1009                 ramce. Pouziti teorie je ilustrovano na nekolika
1010                 prikladech. Graf potencialu viditelnosti muze byt puzit
1011                 jako alternativni nebo doplnkovy model sceny a muze byt
1012                 uzitecny pri reseni ruznych problemu jako je napriklad
1013                 problem viditelnosti, problem navigace ve scene a
1014                 problem rozpoznani trojrozmernych objektu.",
1015  who = "Havran Vlastimil: VIS-0029",
1016}
1017
1018@InProceedings{Sojka:1995:AGT,
1019  author =       "E. Sojka",
1020  title =        "Aspect Graphs of Three Dimensional Scenes",
1021  booktitle =    "Winter School of Computer Graphics 1995",
1022  year =         "1995",
1023  month =        feb,
1024  pages =        "289--299",
1025  note =         "held at University of West Bohemia, Plzen, Czech
1026                 Republic, 14-18 February 1995",
1027  who = "Havran Vlastimil: VIS-0028",
1028}
1029
1030@Article{Mulmuley:1989:EAH,
1031  author =       "Ketan Mulmuley",
1032  editor =       "Jeffrey Lane",
1033  title =        "An Efficient Algorithm for Hidden Surface Removal",
1034  journal =      "Computer Graphics",
1035  volume =       "23",
1036  number =       "3",
1037  pages =        "379--388",
1038  month =        jul,
1039  year =         "1989",
1040  bibsource =    "Graphics/imager/imager.89.bib",
1041  conference =   "held in Boston, Massachusetts; 31 July -- 4 August
1042                 1989",
1043  who = "Havran Vlastimil: VIS-0027",
1044}
1045
1046@InProceedings{Sillion:1995:FBC,
1047  author =       "Fran\c{c}ois Sillion and George Drettakis",
1048  title =        "Feature-based Control of Visibility Error: {A}
1049                 Multi-Resolution Clustering Algorithm for Global
1050                 Illumination",
1051  pages =        "145--152",
1052  booktitle =    "Computer Graphics (Proceedings of SIGGRAPH '95)",
1053  year =         "1995",
1054  publisher =    "ACM SIGGRAPH/Addison Wesley",
1055  month =        aug,
1056  who = "Havran Vlastimil: VIS-0026",
1057}
1058
1059@InProceedings{Drettakis:1997:IUG,
1060  author =       "George Drettakis and Fran{\c{c}}ois Sillion",
1061  title =        "Interactive Update of Global Illumination Using {A}
1062                 Line-Space Hierarchy",
1063  booktitle =    "SIGGRAPH 97 Conference Proceedings",
1064  editor =       "Turner Whitted",
1065  series =       "Annual Conference Series",
1066  year =         "1997",
1067  organization = "ACM SIGGRAPH",
1068  publisher =    "Addison Wesley",
1069  month =        aug,
1070  pages =        "57--64",
1071  note =         "ISBN 0-89791-896-7",
1072  keywords =     "global illumination, dynamic environments,
1073                 hierarchical radiosity, form-factors, interactivity,
1074                 frame rate control",
1075  annote =       "Interactively manipulating the geometry of complex,
1076                 globally illuminated scenes has to date proven an
1077                 elusive goal. Previous attempts have failed to provide
1078                 interactive updates of global illumination and have not
1079                 been able to offer well-adapted algorithms controlling
1080                 the frame rate. The need for such interactive updates
1081                 of global illumination is becoming increasingly
1082                 important as the field of application of radiosity
1083                 algorithms widens. To address this need, we present a
1084                 novel algorithm which provides interactive update rates
1085                 of global illumination for complex scenes with moving
1086                 objects. In the context of clustering for hierarchical
1087                 radiosity, we introduce the idea of an implicit
1088                 line-space hierarchy. This hierarchy is realized by
1089                 augmenting the links between hierarchical elements
1090                 (clusters or surfaces) with shafts, representing the
1091                 set of lines passing through the two linked elements.
1092                 We show how line-space traversal allows rapid
1093                 identification of modified links, and simultaneous
1094                 cleanup of subdivision no longer required after a
1095                 geometry move. The traversal of line-space also limits
1096                 the amount of work required to update and solve the new
1097                 hierarchical system after a move, by identifying the
1098                 modified paths in the scene hierarchy. The
1099                 implementation of our new algorithm allows interactive
1100                 updates of illumination after object motion for scenes
1101                 containing several thousand polygons, including global
1102                 illumination effects. Finally, the line-space hierarchy
1103                 traversal provides a natural control mechanism allowing
1104                 the regulation of the tradeoff between image quality
1105                 and frame rate.",
1106  who = "Havran Vlastimil: VIS-0025",
1107}
1108
1109
1110@TechReport{deBerg96traverse,
1111  author =       "Mark de Berg and Marc van Kreveld and Rene van Oostrum and Mark Overmars",
1112  title =        "Simple traversal of a subdivision without extra storage",
1113  institution =  "CS Dept, Utrecht U.",
1114  year =         "1996",
1115  note =         "UU-CS-1996-17 URL: http:/www.cs.ruu.nl/docs/research/publication/TechList2.",
1116  keywords =     "contour map, computational geometry, interval tree, cartography",
1117  annote =       "traversing a planar subdivision without mark bits",
1118  who = "Havran Vlastimil: VIS-0024",
1119}
1120
1121
1122@InProceedings{chrysanthou92a,
1123   author =       "Y. Chrysanthou and M. Slater",
1124   title =        "Computing dynamic changes to BSP trees",
1125   pages =        "321--332",
1126   booktitle =      "Computer Graphics Forum (EUROGRAPHICS '92 Proceedings)",
1127   volume =       "11",
1128   number =       "3",
1129   year =         "1992",
1130   month =        sep,
1131   editor =       "A. Kilgour and L. Kjelldahl",
1132   conference =   "held in Cambridge, UK; 7-11 September 1992",
1133   keywords =     "binary space partition trees, svbsp, shadows",
1134  who  = "Havran Vlastimil: VIS-0023",
1135}
1136
1137@InProceedings{navazo87a,
1138        author =       "Isabel Navazo and Josep Fontdecaba and Pere Brunet",
1139        title =        "Extended octtrees, between {CSG} trees and boundary
1140                       representations",
1141        pages =        "239--247",
1142        booktitle =    "Eurographics '87",
1143        year =         "1987",
1144        month =        aug,
1145        editor =       "G. Marechal",
1146        publisher =    "North-Holland",
1147        conference =   "European Computer Graphics Conference and Exhibition;
1148                       held in Amsterdam, The Netherlands; 24 -- 28 August
1149                       1987",
1150        keywords =     "octree",
1151  who  = "Havran Vlastimil: VIS-0022",
1152}
1153
1154@InProceedings{Torres:1990:OBS,
1155  author =       "Enric Torres",
1156  title =        "Optimization of the Binary Space Partition Algorithm
1157                 ({BSP}) for the Visualization of Dynamic Scenes",
1158  pages =        "507--518",
1159  booktitle =    "Eurographics '90",
1160  year =         "1990",
1161  month =        sep,   
1162  editor =       "C. E. Vandoni and D. A. Duce",
1163  publisher =    "North-Holland",
1164  conference =   "European Computer Graphics Conference and Exhibition;
1165                 held in Montreux, Switzerland; 3 -- 7 September 1990",
1166  keywords =     "",
1167  annote =       "",
1168  who  = "Havran Vlastimil: VIS-0021",
1169}
1170
1171@InProceedings{Chin:1989:NRT,
1172  author =       "Norman Chin and Steven Feiner",
1173  title =        "Near Real-Time Shadow Generation Using {BSP} Trees",
1174  pages =        "99--106", 
1175  booktitle =    "Computer Graphics (Proceedings of SIGGRAPH '89)",
1176  year =         "1989", 
1177  conference =   "held in Boston, Massachusetts; 31 July -- 4 August
1178                 1989",
1179  keywords =     "shadows, shadow volumes, BSP, binary space
1180                 partitioning",
1181  annote =       "",
1182  who  = "Havran Vlastimil: VIS-0020",
1183}
1184
1185@Article{Morer:1995:OPL,
1186  author =       "P. Morer and A. M. Garcia-Alonso and J. Flaquer",
1187  title =        "Optimization of a Priority List Algorithm for {3-D}
1188                 Rendering of Buildings",
1189  journal =      "Com{\-}pu{\-}ter Graphics Forum",
1190  volume =       "14",
1191  number =       "4",
1192  pages =        "217--227",
1193  month =        oct,
1194  year =         "1995",
1195  coden =        "CGFODY",
1196  ISSN =         "0167-7055",
1197  bibdate =      "Fri Sep 13 06:22:32 MDT 1996",
1198  acknowledgement = ack-nhfb,
1199  classification = "C7440 (Civil and mechanical engineering computing);
1200                 C6130B (Graphics techniques); C1180 (Optimisation
1201                 techniques)",
1202  keywords =     "Priority list algorithm; 3D rendering; 3-D rendering;
1203                 Buildings; Architectural scenes; Parallel surfaces;
1204                 Instantiation; Visualization algorithms; Hidden surface
1205                 removal problem; Implementation policies; Binary space
1206                 partition algorithm; Memory space; Optimization
1207                 TECHNIQUES",
1208  pubcountry =   "UK",
1209  thesaurus =    "Architectural CAD; Data visualisation; Engineering
1210                 graphics; Hidden feature removal; Optimisation;
1211                 Rendering [computer graphics]",
1212 who  = "Havran Vlastimil: VIS-0019",
1213}
1214
1215@Article{Gordon:1991:FDB,
1216  author =       "Dan Gordon and Shuhong Chen",
1217  title =        "Front-to-back display of {BSP} trees",
1218  journal =      "IEEE Computer Graphics and Applications",
1219  volume =       "11",
1220  number =       "5",
1221  pages =        "79--85",
1222  month =        sep,
1223  year =         "1991",
1224  coden =        "ICGADZ",
1225  ISSN =         "0272-1716",
1226  bibdate =      "Sat Jan 25 06:42:48 MST 1997",
1227  acknowledgement = ack-nhfb,
1228  affiliation =  "Texas A\&M Univ, USA",
1229  annote =       "For each scanline, keeps a list of unlit segments. By
1230                 displaying front-to-back instead of the traditional
1231                 back-to-front, save on the unnecessary display/shading
1232                 of hidden polygons. The savings are negligible for
1233                 small polygons but increase with the size of the
1234                 polygons. Using hardware polygon rendering (instead of
1235                 the scanline algorithm) would not make this technique
1236                 as interesting.",
1237  classification = "723; 921",
1238  journalabr =   "IEEE Comput Graphics Appl",
1239  keywords =     "Back-to-Front Display; Binary Space Partitioning
1240                 Trees; bsp, dynamic screen data structure; Computer
1241                 Graphics; Data Structures; Front-to-Back Display; Image
1242                 Processing; Interpolation Shading",
1243  who = "Havran Vlastimil: VIS-0018",
1244}
1245
1246@InProceedings{Chen:1996:FPA,
1247  author =       "{Han-Ming} Chen and {Wen-Teng} Wang",
1248  title =        "The Feudal Priority Algorithm on Hidden-Surface
1249                 Removal",
1250  editor =       "Holly Rushmeier",
1251  series =       "Annual Conference Series",
1252  pages =        "55--64",
1253  booktitle =    "SIGGRAPH 96 Conference Proceedings",
1254  year =         "1996",
1255  organization = "ACM SIGGRAPH",
1256  publisher =    "Addison Wesley",
1257  month =        aug,
1258  note =         "held in New Orleans, Louisiana, 04-09 August 1996",
1259  annote =       "Development of a real-time shaded rendering approach
1260                 for a frequently changing viewpoint or view vector is
1261                 very important in the simulation of 3-D objects in
1262                 Computer-Aided Design. A new approach is proposed in
1263                 this paper to meet this demand in a very efficient
1264                 manner. A pre-processing phase, in which a feudal
1265                 priority tree is established for all polygons of an
1266                 object, and a post-processing phase, in which a
1267                 rendering priority list is searched for from the feudal
1268                 priority tree for a new viewpoint or view vector, are
1269                 included in our approach. The most time-consuming work
1270                 is finished in the pre-processing phase which only has
1271                 to be executed once for an object, and the relatively
1272                 simple task is left to the post-processing phase, which
1273                 is repeated when the viewpoint or view vector is
1274                 changed. For the pre-processing phase, a static version
1275                 and a dynamic version are proposed in this paper. The
1276                 one-way priority relations of all polygons are computed
1277                 in the former part of the dynamic pre-processing in a
1278                 more efficient way than that in the static
1279                 pre-processing, but the latter part of the dynamic
1280                 pre-processing is still based on the static
1281                 pre-processing. A new concept of ``absolute priority''
1282                 is introduced to systematically reduce the polygons in
1283                 which a separating plane is to be searched for so the
1284                 probability of finding the separating plane is much
1285                 increased. This is the basis to implement another
1286                 important concept of ``separating before splitting'' by
1287                 which the polygon splittings are much reduced. Hence
1288                 the efficiency in the pre-processing and the
1289                 post-processing phases is highly increased.",
1290  who = "Havran Vlastimil: VIS-0017",
1291}
1292
1293@Article{Loscos:1997:IHS,
1294  author =       "Celine Loscos and George Drettakis",
1295  title =        "Interactive High-Quality Soft Shadows in Scenes with
1296                 Moving Objects",
1297  journal =      "Com{\-}pu{\-}ter Graphics Forum",
1298  volume =       "16",
1299  number =       "3",
1300  pages =        "C219--C230",
1301  month =        sep # " 4--8",
1302  year =         "1997",
1303  coden =        "CGFODY",
1304  ISSN =         "0167-7055",
1305  bibdate =      "Tue Mar 17 15:44:38 MST 1998",
1306  acknowledgement = ack-nhfb,
1307  affiliation =  "INRIA",
1308  affiliationaddress = "Grenoble, Fr",
1309  classification = "723.2; 723.5; 741.2",
1310  journalabr =   "Comput Graphics Forum",
1311  keywords =     "Algorithms; Backprojection structures; Computational
1312                 geometry; Discontinuity mesh; Dynamic scenes; Image
1313                 quality; Interactive computer graphics; Lighting; Soft
1314                 shadows; Three dimensional computer graphics;
1315                 Visibility",
1316  who = "Havran Vlastimil: VIS-0016",
1317}
1318
1319@InProceedings{Teller:1992:CAA,
1320  author =       "Seth J. Teller",
1321  title =        "Computing the antipenumbra of an area light source",
1322  booktitle =      "Computer Graphics (Proceedings of SIGGRAPH '92)",
1323  pages =        "139--148",
1324  month =        jul,
1325  year =         "1992",
1326  conference =   "held in Chicago, Illinois; 26--31 July 1992",
1327  keywords =     "radiosity, aspect graph, discontinuity meshing,
1328                 stabbing lines, plucker coordinates",
1329  who = "Havran Vlastimil: VIS-0015",
1330}
1331
1332@Article{Naylor:1990:MBT,
1333  author =       "Bruce Naylor and John Amanatides and William
1334                 Thibault",
1335  editor =       "Forest Baskett",
1336  title =        "Merging {BSP} Trees Yields Polyhedral Set Operations",
1337  journal =      "Computer Graphics",
1338  volume =       "24",
1339  number =       "4",
1340  pages =        "115--124",
1341  month =        aug,
1342  year =         "1990",
1343  coden =        "CGRADI, CPGPBZ",
1344  ISSN =         "0097-8930",
1345  conference =   "held in Dallas, Texas; 6--10 August 1990",
1346  who = "Havran Vlastimil: VIS-0014",
1347}
1348
1349@InProceedings{Chrysanthou:1997:IUS,
1350  author =       "Yiorgos Chrysanthou and Mel Slater",
1351  title =        "Incremental Updates to Scenes Illuminated by Area
1352                 Light Sources",
1353  booktitle =    "Proceedings of Eurographics Workshop on Rendering",
1354  year =         "1997",
1355  publisher =    "Springer Verlag",
1356  month =        jun,
1357  pages =        "103--114",
1358  annote =       "An object space algorithm for computing shadows in
1359                 dynamic scenes illuminated by area light sources is
1360                 presented. A mesh with the shadow boundaries as well as
1361                 other discontinuities in the illumination function, is
1362                 built in a pre-processing stage and updated on-line
1363                 after any interaction resulting in a change in the
1364                 scene geometry. The mesh on each polygon is a 2D BSP
1365                 tree stored in a winged edge data structure. To
1366                 accelerate the mesh construction a number of new ideas
1367                 are employed: sorting of the polygons in respect to the
1368                 area source, the shadow overlap cube, BSP tree merging
1369                 of the shadows. In addition a method for dynamically
1370                 changing the BSP representation of the mesh and quickly
1371                 identifying the vertices requiring intensity
1372                 computations was developed. Preliminary experimental
1373                 results indicate the strength and the potential of this
1374                 method.",
1375  who = "Havran Vlastimil: VIS-0013",
1376}
1377
1378@InProceedings{Daubert:1997:HLS,
1379  author =       "Katja Daubert and Hartmut Schirmacher and
1380                 Fran{\c{c}}ois X. Sillion and George Drettakis",
1381  title =        "Hierarchical Lighting Simulation for Outdoor Scenes",
1382  booktitle =    "Eurographics Rendering Workshop 1997",
1383  editor =       "Julie Dorsey and Philipp Slusallek",
1384  year =         "1997",
1385  organization = "Eurographics",
1386  publisher =    "Springer Wein",
1387  address =      "New York City, NY",
1388  month =        jun,
1389  pages =        "229--238",
1390  note =         "ISBN 3-211-83001-4",
1391  annote =       "Lighting algorithms for outdoor scenes suffer from the
1392                 sheer geometric and lighting complexity of such
1393                 environments. In this paper we introduce an efficient,
1394                 hierarchical solution to the problem of outdoor
1395                 illumination. Data structures and sampling algorithms
1396                 are presented, permitting the integration of complex
1397                 and natural objects in a hierarchical radiosity
1398                 simulation system. This new approach allows the
1399                 hierarchical simulation of radiant energy exchanges in
1400                 outdoor scenes for the first time, including terrain
1401                 and botanical models as well as sunlight and skylight.
1402                 This is accomplished by providing the necessary tools
1403                 to treat terrain meshes as a hierarchy of
1404                 light-exchanging objects, as well as an efficient
1405                 hierarchical representation for the sky dome. In
1406                 addition, refinement criteria are adapted to the
1407                 particular characteristics of natural lighting. Results
1408                 of our implementation are presented including
1409                 naturally-lit images of terrain-maps, trees and
1410                 buildings.",
1411  who = "Havran Vlastimil: VIS-0012",
1412}
1413
1414@InProceedings{Drettakis:1996:AVM,
1415  author =       "George Drettakis and Fran{\c{c}}ois Sillion",
1416  title =        "Accurate Visibility and Meshing Calculations for
1417                 Hierarchical Radiosity",
1418  booktitle =    "Eurographics Rendering Workshop 1996",
1419  editor =       "Xavier Pueyo and Peter Schr{\"{o}}der",
1420  year =         "1996",
1421  organization = "Eurographics",
1422  publisher =    "Springer Wein",
1423  address =      "New York City, NY",
1424  month =        jun,
1425  pages =        "269--278",
1426  note =         "ISBN 3-211-82883-4",
1427  annote =       "Precise quality control for hierarchical lighting
1428                 simulations is still a hard problem, due in part to the
1429                 difficulty of analysing the source of error and to the
1430                 close interactions between different components of the
1431                 algorithm. In this paper we attempt to address this
1432                 issue by examining two of the most central components
1433                 of these algorithms: visibility computation and the
1434                 mesh. We first present an investigation tool in the
1435                 form of a new hierarchical algorithm: this algorithmic
1436                 extension encapsulates exact visibility information
1437                 with respect to the light source in the form of the
1438                 backprojection data structure, and allows the use of
1439                 discontinuity meshes in the solution hierarchy. This
1440                 tool permits us to study separately the effects of
1441                 visibility and meshing error on image quality,
1442                 computational expense as well as solution convergence.
1443                 Initial experimental results are presented by comparing
1444                 standard quadtree-based hierarchical radiosity with
1445                 point-sampling visibility to the approaches
1446                 incorporating backprojections, discontinuity meshes or
1447                 both.",
1448  who = "Havran Vlastimil: VIS-0011",
1449}
1450
1451@Article{bib:naylor90,
1452  author =       "B. Naylor",
1453  title =        "Binary Space Partitioning Trees as an Alternative
1454                 Representation of Polytopes",
1455  journal =      "Computer--Aided Design",
1456  year =         "1990",
1457  pages =        "250--252",
1458  who  = "Havran Vlastimil: VIS-0010",
1459}
1460
1461@InProceedings{Naylor:1992:PTI,
1462  author =       "Bruce F. Naylor",
1463  title =        "Partitioning tree image representation and generation
1464                 from 3{D} geometric models",
1465  pages =        "201--212",
1466  booktitle =    "Proceedings of Graphics Interface '92",
1467  year =         "1992",
1468  month =        may,
1469  conference =   "held in Vancouver, B.C.; 11-15 May 1992",
1470  keywords =     "bsp trees",
1471  who = "Havran Vlastimil: VIS-0009",
1472}
1473
1474@InProceedings{Naylor:1993:CGP,
1475        author =       "Bruce Naylor",
1476        title =        "Constructing good partition trees",
1477        booktitle =    "Proceedings of Graphics Interface '93",
1478        year =         "1993",
1479        pages =        "181--191",
1480        organization = "Canadian Information Processing Society",
1481        address =      "Toronto, Ontario, Canada",
1482        month =        may,
1483        who  = "Havran Vlastimil: VIS-0008",
1484}
1485
1486@InProceedings{Naylor:1992:ISG,
1487  author =       "Bruce F. Naylor",
1488  title =        "Interactive solid geometry via partitioning trees",
1489  pages =        "11--18",
1490  booktitle =    "Proceedings of Graphics Interface '92",
1491  year =         "1992",
1492  month =        may,
1493  conference =   "held in Vancouver, B.C.; 11-15 May 1992",
1494  keywords =     "bsp trees",
1495  who = "Havran Vlastimil: VIS-0007",
1496}
1497
1498@InProceedings{Durand:1997:VSP,
1499  author =       "Fr{\'{e}}do Durand and George Drettakis and Claude
1500                 Puech",
1501  title =        "The Visibility Skeleton: {A} Powerful and Efficient
1502                 Multi-Purpose Global Visibility Tool",
1503  booktitle =    "Computer Graphics (Proceedings of SIGGRAPH '97)",
1504  year =         "1997",
1505  pages =        "89--100",
1506  keywords =     "Visibility, Global Visibility, Extremal Stabbing
1507                 Lines, Aspect Graph, Global Illumination, Form Factor
1508                 Calculation, Discontinuity Meshing, View Calculation",
1509  annote =       "Many problems in computer graphics and computer vision
1510                 require accurate global visibility information.
1511                 Previous approaches have typically been complicated to
1512                 implement and numerically unstable, and often too
1513                 expensive in storage or computation. The Visibility
1514                 Skeleton is a new powerful utility which can
1515                 efficiently and accurately answer visibility queries
1516                 for the entire scene. The Visibility Skeleton is a
1517                 multi-purpose tool, which can solve numerous different
1518                 problems. A simple construction algorithm is presented
1519                 which only requires the use of well known computer
1520                 graphics algorithmic components such as ray-casting and
1521                 line/plane intersections. We provide an exhaustive
1522                 catalogue of visual events which completely encode all
1523                 possible visibility changes of a polygonal scene into a
1524                 graph structure. The nodes of the graph are extremal
1525                 stabbing lines, and the arcs are critical line swaths.
1526                 Our implementation demonstrates the construction of the
1527                 Visibility Skeleton for scenes of over a thousand
1528                 polygons. We also show its use to compute exact visible
1529                 boundaries of a vertex with respect to any polygon in
1530                 the scene, the computation of global or on-the-fly
1531                 discontinuity meshes by considering any scene polygon
1532                 as a source, as well as the extraction of the exact
1533                 blocker list between any polygon pair. The algorithm is
1534                 shown to be manageable for the scenes tested, both in
1535                 storage and in computation time. To address the
1536                 potential complexity problems for large scenes,
1537                 on-demand or lazy contruction is presented, its
1538                 implementation showing encouraging first results.",
1539    who = "Havran Vlastimil: VIS-0006",
1540}
1541
1542@InProceedings{Drettakis94-FSAAL,
1543  author =       "George Drettakis and Eugene Fiume",
1544  year =         "1994",
1545  title =        "A {Fast} {Shadow} {Algorithm} for {Area} {Light}
1546                 {Sources} {Using} {Backprojection}",
1547  booktitle =    "Computer Graphics (Proceedings of SIGGRAPH '94)",
1548  pages =        "223--230",
1549  keywords =     "shadows, umbra, penumbra, discontinuity meshing,
1550                 global illumination, backprojection",
1551  comments =     "available via the World Wide Web at:
1552                 http://safran.imag.fr/Membres/George.Drettakis/pub.html",
1553  who = "Havran Vlastimil: VIS-0005",
1554}
1555
1556
1557@InProceedings{Plantinga:1993:CVP,
1558  author =       "Harry Plantinga",
1559  title =        "Conservative visibility preprocessing for efficient
1560                 walkthroughs of 3{D} scenes",
1561  booktitle =    "Proceedings of Graphics Interface '93",
1562  year =         "1993",
1563  pages =        "166--173",
1564  organization = "Canadian Information Processing Society",
1565  address =      "Toronto, Ontario, Canada",
1566  month =        may,
1567  who = "Havran Vlastimil: VIS-0003", 
1568}
1569
1570@InProceedings{Teller:1993:GVA,
1571  author =       "Seth Teller and Pat Hanrahan",
1572  booktitle =    "Computer Graphics Proceedings, Annual Conference
1573                 Series, 1993",
1574  title =        "Global Visibility Algorithms for Illumination
1575                 Computations",
1576  pages =        "239--246",
1577  year =         "1993",
1578  keywords =     "hidden surface removal, visibility space, radiosity,
1579                 global illumination, algorithmic triage",
1580  annote =       "The most expensive geometric operation in image
1581                 synthesis is visibility determination. Classically this
1582                 is solved with hidden surface removal algorithms that
1583                 render only the parts of the scene visible from a
1584                 point. Global illumination calculations, however, may
1585                 require information between any two points in the
1586                 scene. This paper describes global visibility
1587                 algorithms that preprocess polygon databases in order
1588                 to accelerate visibility determination during
1589                 illumination calculations. These algorithms are
1590                 sensitive to the output complexity in visibility space;
1591                 that is, how many pairs of objects are mutually
1592                 visible. Furthermore, the algorithms are incremental so
1593                 that they work well with progressive refinement and
1594                 hierarchical methods of image synthesis. The algorithms
1595                 are conservative, but exact; that is, when they return
1596                 visibility predicates they can be proved true. However
1597                 sometimes they do not return either totally visible or
1598                 totally invisible, but partially visible, even though
1599                 in the same situation a better algorithm might return
1600                 the exact answer. In this paper we describe the
1601                 algorithms and their implementation, and show that, in
1602                 a scene with low average visual complexity, they can
1603                 dramatically accelerate conventional radiosity
1604                 programs.",
1605   who = "Havran Vlastimil: VIS-0002",
1606}
1607
1608@InProceedings{Stewart:1994:FCSb,
1609  author =       "A. James Stewart and Sherif Ghali",
1610  booktitle =    "Computer Graphics (Proceedings of SIGGRAPH '94)",
1611  title =        "Fast Computation of Shadow Boundaries Using Spatial
1612                 Coherence and Backprojections",
1613  pages =        "231--238",
1614  year =         "1994",
1615  who = "Havran Vlastimil: VIS-0001",
1616}
1617
1618@Article{Cohen-Or:1995:VDZ,
1619  author =       "D. Cohen-Or and A. Shaked",
1620  title =        "Visibility and Dead-Zones in Digital Terrain Maps",
1621  journal =      "Com{\-}pu{\-}ter Graphics Forum",
1622  volume =       "14",
1623  number =       "3",
1624  pages =        "C/171--C/180",
1625  month =        sep,
1626  year =         "1995",
1627  coden =        "CGFODY",
1628  ISSN =         "0167-7055",
1629  bibdate =      "Fri Jul 18 14:10:02 1997",
1630  acknowledgement = ack-nhfb,
1631  classification = "A9110D (Cartography); A9365 (Data and information;
1632                 acquisition, processing, storage and dissemination in
1633                 geophysics); C4240C (Computational complexity); C4260
1634                 (Computational geometry); C6130B (Graphics techniques);
1635                 C7340 (Geophysics computing); C7840 (Geography and
1636                 cartography computing)",
1637  conflocation = "Maastricht, Netherlands; 18 Aug.-1 Sept. 1995",
1638  conftitle =    "EUROGRAPHICS '95",
1639  corpsource =   "Sch. of Math. Sci., Tel Aviv Univ., Israel",
1640  keywords =     "cartography; computational; computational complexity;
1641                 Computational geometry; Dead-zones; dead-zones;
1642                 detection; digital; Digital elevation map; digital
1643                 terrain maps; Digital terrain maps; digital terrain
1644                 maps; Discrete cross-sections; discrete cross-sections;
1645                 discrete lines of sight; Discrete lines of sight;
1646                 discrete lines of sight; elevation map; geographic
1647                 information systems; Geographic information systems;
1648                 geographic information systems; geometry; hidden area
1649                 detection; Hidden area detection; hidden area
1650                 detection; hidden feature; multiplication;
1651                 Multiplication; multiplication; Polygonal surface
1652                 representation; polygonal surface representation;
1653                 removal; Surface perimeter; surface perimeter; terrain
1654                 modelling; Terrain modelling; terrain modelling;
1655                 Testing operations; testing operations; topographic
1656                 surface; Topographic surface; topographic surface;
1657                 Unit-sized terrain elements; unit-sized terrain
1658                 elements; viewpoint; Viewpoint; viewpoint; Visibility;
1659                 visibility; visible area; Visible area detection",
1660  thesaurus =    "Cartography; Computational complexity; Computational
1661                 geometry; Geographic information systems; Hidden
1662                 feature removal; Visibility",
1663  treatment =    "P Practical",
1664  who  = "Havran Vlastimil: VIS-0091",
1665}
Note: See TracBrowser for help on using the repository browser.