source: GTP/trunk/Lib/Vis/Preprocessing/manual/Bib/cge-wanted.bib @ 2066

Revision 2066, 23.5 KB checked in by mattausch, 18 years ago (diff)

worked on integration manual
Line 
1
2@inproceedings{BerDobEpp-SODA-90,
3  title = {{Visibility with a moving point of view}},
4  author = {Marshall W. Bern and David P. Dobkin and David Eppstein and Robert L. Grossman},
5  booktitle = {Proc. 1st Symp. Discrete Algorithms},
6  publisher = {Assoc. Comput. Mach. and Soc. Industrial {\&} Applied Mathematics},
7  pages = {107--118},
8  month = {January},
9  year = {1990}
10}
11
12@article{BerDobEpp-Algo-94,
13  title = {{Visibility with a moving point of view}},
14  author = {Marshall W. Bern and David P. Dobkin and David Eppstein and Robert L. Grossman},
15  journal = {Algorithmica},
16  volume = {11},
17  number = {4},
18  pages = {360--378},
19  month = {April},
20  year = {1994},
21  review = {MR-94j:68307}
22}
23
24@article{MR-94j:68307,
25  reviews = {BerDobEpp-Algo-94},
26  journal = {Mathematical Reviews},
27  publisher = {Amer. Math. Soc.},
28  title = {{Visibility with a moving point of view}},
29  number = {94j:68307},
30  year = {1994}
31}
32
33
34
35@Article{Matousek95,
36title={Approximations and Optimal Geometric Divide-and-Conquer},
37author={Ji{\v{r}}{\'\i} Matou{\v{s}}ek},
38pages={203--208},
39journal=jcss,
40year=1995,
41month=apr,
42volume=50,
43number=2,
44preliminary={STOC::Matousek1991}
45}
46
47@article{ma4,
48  author="J. Matousek",
49  title="Efficient partition trees",
50  journal="Discrete and Computational Geometry",
51  year="1992",
52  volume="8",
53  number="",
54  pages="315-334"
55}
56
57@inproceedings{ma92acm,
58  author="J. Matousek",
59  title="Range searching with efficient hierarchical cuttings",
60  booktitle="$8^{th}$ ACM Conf. in Comp. Geom.",
61  address="Berlin",
62  year="1992",
63  pages="276-285"
64}
65
66@article
67 {ma1,
68  author="J. Matousek",
69  title="Range searching with efficient hierarchical cuttings",
70  journal="Discrete and Computational Geometry",
71  year="1993",
72  volume="10",
73  number="",
74  pages="157-182"
75}
76
77@inproceedings{a-rsoas-89
78, author =      "Pankaj K. Agarwal"
79, title =       "Ray shooting and other applications of spanning trees with low stabbing number"
80, booktitle =   "Proc. 5th Annu. ACM Sympos. Comput. Geom."
81, year =        1989
82, pages =       "315--325"
83, precedes =    "a-rsoas-92"
84, update =      "96.05 agarwal, 95.05 korneenko"
85}
86
87@article{a-rsoas-92
88, author =      "Pankaj K. Agarwal"
89, title =       "Ray shooting and other applications of spanning trees with low stabbing number"
90, journal =     "SIAM J. Comput."
91, volume =      21
92, year =        1992
93, pages =       "540--570"
94, keywords =    "ray shooting, visibility, spanning trees, partition trees"
95, succeeds =    "a-rsoas-89"
96, update =      "96.05 agarwal, 95.05 korneenko"
97}
98
99@TECHREPORT{duke.tr:DukeCSTR9122,
100    AUTHOR = "Pankaj K. {Agarwal} and Jiri Matousek.",
101    year = "1991",
102    ABSTRACT = "\indent We present efficient algorithms for
103        the {\em ray shooting} problem:  Given a
104        collection $\Gamma$ of objects in ${\bf R}^{d}$, build a data structure
105        so that, for a query ray, one can quickly determine the first object of
106        $\Gamma$  hit by the ray.  Using the parametric search technique, we reduce
107        this problem to the {\em segment emptiness} problem.  For various ray shooting
108        problems, we achieve space/query time tradeoffs of the following type:  for
109        some integer $b$ and a parameter $m \,  (n \leq m \leq n^{b})$ the queries are
110        answered in time
111        $O(\frac{n}{m^{1/b}}\, \mbox {log} ^{O(1)}n)$,
112        with  $O(m^{1+ \epsilon })$ space and preprocessing time $(\varepsilon > 0$ is
113        arbitrarily small but fixed constant).  We get $b = \lfloor d/2
114        \rfloor $ for ray shooting
115        in a convex $d$-polytope defined as an intersection of $n$ half-spaces, $b = d$
116        for an arrangement of $n$ hyperplanes in ${\bf R}^{d}$ and $b = 3$ for an
117        arrangement of $n$ half-planes in ${\bf R}^{3}$.  Our approach also yields
118        fast procedures for finding the first $k$ objects hit by a query ray, for
119        searching nearest and farthest neighbors, and for the hidden surface
120        removal.  All the data structures can be maintained dynamically in amortized
121        time  $O(m^{1+ \epsilon }/n)$ per insert/delete operation. ",
122    LOCATION = "ftp://ftp.cs.duke.edu/dist/techreport/1991/1991-22.ps.Z",
123    NOTE = "Printed copies available from
124          T.R. Librarian,
125          Dept. of Computer Science,
126          Duke University,
127          Box 90129,
128          Durham, NC  27708-0129",
129    PUBLISHER = "Department of Computer Science, Duke University",
130    REPORTNUMBER = "Technical report DUKE--TR--1991--22",
131    TITLE = " Ray Shooting and Parametric Search",
132    SUBMITTER = "surendar@swift.cs.duke.edu (Mon Jul  1 23:53:45 1996)",
133    institution = "Duke University",
134    KEY = "DukeCSTR9122"
135}
136
137@inproceedings{am-rsps-92
138, author =      "Pankaj K. Agarwal and J. Matou{\v s}ek"
139, title =       "Ray shooting and parametric search"
140, booktitle =   "Proc. 24th Annu. ACM Sympos. Theory Comput."
141, year =        1992
142, pages =       "517--526"
143, keywords =    "ray tracing, range search, intersection, partition trees"
144, update =      "96.09 agarwal, 96.05 agarwal"
145}
146
147@article{as-rsacp-96i
148, author =      "P. K. Agarwal and M. Sharir"
149, title =       "Ray shooting amidst convex polygons in {2D}"
150, journal =     "J. Algorithms"
151, volume =      21
152, year =        1996
153, pages =       "508--519"
154, update =      "97.03 agarwal+pocchiola+smid, 96.09 agarwal, 96.05 agarwal"
155}
156
157@inproceedings{as-rsacp-93
158, author =      "Pankaj K. Agarwal and M. Sharir"
159, title =       "Ray Shooting Amidst Convex Polytopes in Three Dimensions"
160, booktitle =   "Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
161, year =        1993
162, pages =       "260--270"
163, precedes =    "as-rsacp-96ii"
164, update =      "96.05 smid, 93.05 smid"
165}
166
167@inproceedings{af-acrsm-97
168, author =      "B. Aronov and S. Fortune"
169, title =       "Average-Case Ray Shooting and Minimum Weight Triangulations"
170, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
171, year =        1997
172, pages =       "203--212"
173, update =      "97.07 efrat"
174}
175
176@inproceedings{bf-gsars-90
177, author =      "R. Bar-Yehuda and S. Fogel"
178, title =       "Good splitters with applications to ray shooting"
179, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
180, year =        1990
181, pages =       "81--84"
182, keywords =    "ray tracing, arrangements"
183}
184
185@techreport{bf-vrs-90
186, author =      "R. Bar-Yehuda and S. Fogel"
187, title =       "Variations on Ray Shooting"
188, type =        "Technical {Report}"
189, number =      639
190, institution = "Technion IIT"
191, address =     "Haifa, Israel"
192, year =        1990
193, keywords =    "sheaf, ES-trees"
194, update =      "95.01 smid, 93.09 milone+mitchell"
195}
196
197@article{bf-vrs-94
198, author =      "R. Bar-Yehuda and S. Fogel"
199, title =       "Variations on Ray Shooting"
200, journal =     "Algorithmica"
201, volume =      11
202, year =        1994
203, pages =       "133--145"
204, succeeds =    "bf-vrs-90"
205, update =      "95.01 smid, 94.05 matousek"
206}
207
208@inproceedings{bhosk-ershs-91
209, author =      "M. de Berg and D. Halperin and M. Overmars and J. Snoeyink and M. van Kreveld"
210, title =       "Efficient ray shooting and hidden surface removal"
211, booktitle =   "Proc. 7th Annu. ACM Sympos. Comput. Geom."
212, year =        1991
213, pages =       "21--30"
214, keywords =    "ray tracing, hidden surface removal, random sampling"
215, cites =       "as-anspt-91, ako-iqco-91, as-zasha-91, cegpsss-ccclr-90, cegs-lscaa-89, cg-vippg-89, csw-qoubs-90, cj-sersi-91, cs-vppt-89, bo-hsrap-90, de-ssio-87, dk-ladsc-85, e-acg-87, m-aodq-90, m-wcohs-87, os-oshsr-89, p-srs3d-90, p-nrrsi-91, sml-rtatp-88, s-pcg-88, ZZZ"
216, update =      "97.11 bibrelex"
217}
218
219@Article{deb94,
220  author =       "M. De Berg and D. Halperin and M. Overmars and J.
221                 Snoeyink and M. Van Kreveld",
222  title =        "Efficient ray shooting and hidden surface removal",
223  journal =      "Algorithmica: An International Journal in Computer
224                 Science",
225  volume =       "12",
226  number =       "1",
227  year =         "1994",
228  publisher =    "Springer Verlag, New York",
229  pages =        "30--53",
230  topic =        "visibility",
231}
232
233@inproceedings{cegghss-rspug-91
234, author =      "B. Chazelle and H. Edelsbrunner and M. Grigni and L. Guibas and J. Hershberger and M. Sharir and J. Snoeyink"
235, title =       "Ray shooting in polygons using geodesic triangulations"
236, booktitle =   "Proc. 18th Internat. Colloq. Automata Lang. Program."
237, series =      "Lecture Notes Comput. Sci."
238, volume =      510
239, publisher =   "Springer-Verlag"
240, year =        1991
241, pages =       "661--673"
242, keywords =    "ray shooting, simple polygon, geodesics"
243, update =      "93.09 rote"
244}
245
246@article{cegghss-rspug-94
247, author =      "B. Chazelle and H. Edelsbrunner and M. Grigni and L. Guibas and J. Hershberger and M. Sharir and J. Snoeyink"
248, title =       "Ray shooting in polygons using geodesic triangulations"
249, journal =     "Algorithmica"
250, volume =      12
251, year =        1994
252, pages =       "54--68"
253, keywords =    "ray shooting, simple polygon, geodesics"
254, succeeds =    "cegghss-rspug-91"
255, update =      "96.05 pocchiola+ramkumar"
256}
257
258@article{cf-plhur-94
259, author =      "B. Chazelle and J. Friedman"
260, title =       "Point Location among Hyperplanes and Unidirectional Ray-Shooting"
261, journal =     "Comput. Geom. Theory Appl."
262, volume =      4
263, year =        1994
264, pages =       "53--62"
265, update =      "97.11 bibrelex, 95.01 matousek+smid"
266}
267
268@article{cj-arsis-92
269, author =      "S. W. Cheng and R. Janardan"
270, title =       "Algorithms for ray-shooting and intersection searching"
271, journal =     "J. Algorithms"
272, volume =      13
273, year =        1992
274, pages =       "670--692"
275, update =      "93.09 smid"
276}
277
278@inproceedings{cj-sersi-91
279, author =      "S. W. Cheng and R. Janardan"
280, title =       "Space-efficient ray shooting and intersection searching: algorithms, dynamization and applications"
281, booktitle =   "Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
282, year =        1991
283, pages =       "7--16"
284, keywords =    "ray tracing, dynamization, spanning trees of low stabbing number"
285}
286
287@inproceedings{cpt-uadpl-93
288, author =      "Y.-J. Chiang and F. P. Preparata and R. Tamassia"
289, title =       "A Unified Approach to Dynamic Point Location, Ray Shooting, and Shortest Paths in Planar Maps"
290, booktitle =   "Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
291, year =        1993
292, pages =       "44--53"
293, precedes =    "cpt-uadpl-96"
294, update =      "96.05 smid, 93.05 smid"
295}
296
297@article{cpt-uadpl-96
298, author =      "Y.-J. Chiang and F. P. Preparata and R. Tamassia"
299, title =       "A Unified Approach to Dynamic Point Location, Ray Shooting, and Shortest Paths in Planar Maps"
300, journal =     "SIAM J. Comput."
301, volume =      25
302, year =        1996
303, pages =       "207--233"
304, url = "http://www.cs.brown.edu/cgc/papers/cpt-uadpl-96.ps.gz"
305, succeeds =    "cpt-uadpl-93"
306, update =      "97.03 tamassia, 96.05 smid, 95.01 tamassia"
307}
308
309@article{g-airsm-97
310, author =      "M. T. Goodrich"
311, title =       "An improved ray shooting method for constructive solid geometry models via tree contraction"
312, journal =     "Internat. J. Comput. Geom. Appl."
313, volume =      "??"
314, year =        1997
315, note =        "to appear"
316, update =      "97.03 tamassia"
317}
318
319@article{gt-drssp-97
320, author =      "M. T. Goodrich and R. Tamassia"
321, title =       "Dynamic ray shooting and shortest paths in planar subdivisions via balanced geodesic triangulations"
322, journal =     "J. Algorithms"
323, volume =      23
324, year =        1997
325, pages =       "51--73"
326, update =      "97.07 smid"
327}
328
329@inproceedings{gt-drssp-93
330, author =      "M. T. Goodrich and R. Tamassia"
331, title =       "Dynamic ray shooting and shortest paths via balanced geodesic triangulations"
332, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
333, year =        1993
334, pages =       "318--327"
335, update =      "93.09 jones"
336}
337
338@inproceedings{gos-ilsrs-88
339, author =      "L. Guibas and M. Overmars and M. Sharir"
340
341, title =       "Intersecting line segments, ray shooting, and other applications of geometric partitioning techniques"
342, booktitle =   "Proc. 1st Scand. Workshop Algorithm Theory"
343, series =      "Lecture Notes Comput. Sci."
344, volume =      318
345, publisher =   "Springer-Verlag"
346, year =        1988
347, pages =       "64--73"
348}
349
350@techreport{gos-rsipl-89
351, author =      "L. Guibas and M. Overmars and M. Sharir"
352, title =       "Ray shooting, implicit point location, and related queries in arrangements of segments"
353, type =        "Report"
354, number =      433
355, institution = "Dept. Comput. Sci., New York Univ."
356, address =     "New York, NY"
357, month =       mar
358, year =        1989
359, keywords =    "random sampling, ray tracing, arrangements, point location"
360}
361
362@article{k-3vrs2-??
363, author =      "M. J. Katz"
364, title =       "{3-D} vertical ray shooting and {2-D} point enclosure, range searching, and arc shooting amidst convex fat objects"
365, journal =     "Comput. Geom. Theory Appl."
366, note =        "to appear"
367, succeeds =    "k-3vrs2-95"
368, update =      "97.11 katz"
369, year = "1995"
370}
371
372@techreport{k-3vrs2-95
373, author =      "M. J. Katz"
374, title =       "{3-D} vertical ray shooting and {2-D} point enclosure, range searching, and arc shooting amidst convex fat objects"
375, type =        "Research {Report}"
376, number =      2583
377, institution = "INRIA"
378, address =     "BP93, 06902 Sophia-Antipolis, France"
379, year =        1995
380, update =      "97.11 katz, 96.09 smid"
381}
382
383@article{ms-rscp-93
384, author =      "J. Matou{\v s}ek and O. Schwarzkopf"
385, title =       "On ray shooting in convex polytopes"
386, journal =     "Discrete Comput. Geom."
387, volume =      10
388, number =      2
389, year =        1993
390, pages =       "215--232"
391, keywords =    "ray shooting, convex polytope, range searching"
392, comments =    "another part of the results of the conference version is in m-loq-93"
393, succeeds =    "ms-loq-92"
394, update =      "96.09 agarwal, 94.05 schwarzkopf, 94.01 matousek"
395}
396
397@inproceedings{mms-qsrs-94
398, author =      "J. S. B. Mitchell and D. M. Mount and S. Suri"
399, title =       "Query-Sensitive Ray Shooting"
400, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
401, year =        1994
402, pages =       "359--368"
403, update =      "94.09 jones, 94.01 jones"
404}
405
406@techreport{p-nrrsi-91
407, author =      "M. Pellegrini"
408, title =       "New results on ray-shooting and isotopy classes of lines in $3$-dimensional space"
409, year =        1991
410, update =      "97.11 bibrelex"
411}
412
413@inproceedings{p-rsicl-91
414, author =      "M. Pellegrini"
415, title =       "Ray-shooting and isotopy classes of lines in $3$-dimensional space"
416, booktitle =   "Proc. 2nd Workshop Algorithms Data Struct."
417, series =      "Lecture Notes Comput. Sci."
418, volume =      519
419, publisher =   "Springer-Verlag"
420, year =        1991
421, pages =       "20--31"
422, keywords =    "ray tracing, random sampling"
423}
424
425@incollection{p-rsls-97
426, author =      "M. Pellegrini"
427, title =       "Ray shooting and lines in space"
428, chapter =     32
429, editor =      "Jacob E. Goodman and Joseph O'Rourke"
430, booktitle =   "Handbook of Discrete and Computational Geometry"
431, publisher =   "CRC Press LLC"
432, address =     "Boca Raton, FL"
433, year =        1997
434, pages =       "599--614"
435, update =      "97.11 orourke"
436}
437
438@article{p-rst3s-93
439, author =      "M. Pellegrini"
440, title =       "Ray shooting on triangles in $3$-space"
441, journal =     "Algorithmica"
442, volume =      9
443, year =        1993
444, pages =       "471--494"
445, update =      "94.05 matousek"
446}
447
448@inproceedings{p-srs3d-90
449, author =      "M. Pellegrini"
450, title =       "Stabbing and ray shooting in $3$-dimensional space"
451, booktitle =   "Proc. 6th Annu. ACM Sympos. Comput. Geom."
452, year =        1990
453, pages =       "177--186"
454, cites =       "a-dapal-89, a-rsoas-89, ak-frtrc-87, aw-alts-87, bdeg-vmpv-90, cegs-lscaa-89, c-narsc-87, cs-vppt-86, e-acg-87, egs-cmfal-88, emprww-sls-82, eos-calha-86, g-rt-89, gos-rsipl-89, hp-mag-52, hs-ndssg-86, jk-spals-88, m-ai-70, mo-al3sd-88, os-oshsr-89, s-chdch-86, sml-rtatp-88, s-agtd-51, s-pcg-88, ZZZ"
455, update =      "97.11 bibrelex"
456}
457
458@inproceedings{s-rscp-92
459, author =      "O. Schwarzkopf"
460, title =       "Ray shooting in convex polytopes"
461, booktitle =   "Proc. 8th Annu. ACM Sympos. Comput. Geom."
462, year =        1992
463, pages =       "286--295"
464, precedes =    "s-dmcpr-92"
465, cites =       "aesw-emstb-90, am-dhsrr-91, am-rsps-92, bc-hhihr-92, bdsty-arsol-92, bdt-riach-, cegs-sessr-89, cf-plhur-94, c-hsh-85, c-narsc-87, c-racpq-88, cms-frric-92i, cs-arscg-89, dmt-fddtl-92, e-acg-87, gks-ricdv-92, m-ept-91, m-rph-91, m-fppa1-88, m-rmstd-91, m-rmstf-91, m-rmstl-91, s-dmgsm-91, s-sdlpc-91, s-sfira-91, ZZZ"
466, update =      "97.11 bibrelex, 93.05 schwarzkopf"
467}
468
469@TECHREPORT{duke.tr:DukeCSTR9107,
470    AUTHOR = "Pankaj K. {Agarwal} and Micha Sharir.",
471    year = "1991",
472    ABSTRACT = "\indent We present several applications of a
473        recent space partitioning technique of
474        Chazelle, Sharir and Welzl [13].  Our results include efficient algorithms
475        for output-sensitive hidden surface removal, for ray shooting in two and
476        three dimensions, and for constructing spanning trees with low stabbing
477        number.",
478    LOCATION = "ftp://ftp.cs.duke.edu/dist/techreport/1991/1991-07.ps.Z",
479    NOTE = "Printed copies available from
480          T.R. Librarian,
481          Dept. of Computer Science,
482          Duke University,
483          Box 90129,
484          Durham, NC  27708-0129",
485    PUBLISHER = "Department of Computer Science, Duke University",
486    REPORTNUMBER = "Technical report DUKE--TR--1991--07",
487    TITLE = " Applications of a New Space Partitioning Technique",
488    SUBMITTER = "surendar@swift.cs.duke.edu (Mon Jul  1 23:53:07 1996)",
489    institution = "Duke University",
490    KEY = "DukeCSTR9107"
491}
492
493@article{
494dk-ladsc-85, info="81"
495, author =      "D. P. Dobkin and D. G. Kirkpatrick"
496, title =       "A linear algorithm for determining the separation of convex polyhedra"
497, journal =     "J. Algorithms"
498, volume =      6
499, year =        1985
500, pages =       "381--392"
501, keywords =    "design of algorithms, construction, separation, convex, polyhedra, hierarchical representations"
502}
503
504@InProceedings{dadoun85a,
505        author =       "Nou Dadoun and David G. Kirkpatrick and John P.
506                       Walsh",
507        title =        "The Geometry of Beam Tracing",
508        booktitle =    "Proceedings of the ACM Symposium on Computational
509                       Geometry",
510        pages =        "55--61",
511        year =         "1985",
512        month =        jun,
513        annote =       "the use of BSP trees and hierarchical bounding volumes
514                       for fast beam intersection testing. \\ A solution to
515                       the hidden surface elimination problem called beam
516                       tracing is described. Beam tracing is related to ray
517                       tracing but uses spatial coherence within the scene,
518                       and area coherence within the image to batch
519                       computations. Beam tracing is an object space solution
520                       to the hidden surface problem. \\ Beam tracing is
521                       formulated in terms of its principal subprocesses:
522                       intersection, sorting, and clipping. A hierarchical
523                       scene representation is proposed. This incorporates the
524                       space decomposition idea of the BSP tree [Fuchs, Kedem,
525                       and Naylor, 80] along with the convex polytope
526                       intersection detection technique of [Dobkin and
527                       Kirkpatrick, 83] to interleave and efficiently solve
528                       the intersection and sorting subproblems of beam
529                       tracing.",
530}
531
532@InProceedings{dAmore:1992:OBP,
533  author =       "F. d'Amore and P. G. Franciosa",
534  title =        "On the optimal binary plane partition for sets of
535                 isothetic rectangles",
536  booktitle =    "Proc. 4th Canad. Conf. Comput. Geom.",
537  year =         "1992",
538  pages =        "1--5",
539}
540
541@inproceedings{bgo-pbsp-93
542, author =      "M. de Berg and M. de Groot and M. Overmars"
543, title =       "Perfect binary space partitions"
544, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
545, site =        "Waterloo, Canada"
546, year =        1993
547, pages =       "109--114"
548, precedes =    "bgo-pbsp-97"
549, update =      "97.03 devillers, 93.09 milone+mitchell"
550}
551
552@inproceedings{bgo-nrbsp-94
553, author =      "M. de Berg and M. de Groot and M. Overmars"
554, title =       "New results on binary space partitions in the plane"
555, booktitle =   "Proc. 4th Scand. Workshop Algorithm Theory"
556, series =      "Lecture Notes Comput. Sci."
557, volume =      824
558, publisher =   "Springer-Verlag"
559, year =        1994
560, pages =       "61--72"
561, update =      "95.01 schwarzkopf+smid, 94.05 schwarzkopf"
562}
563
564@article{bgo-pbsp-97
565, author =      "M. de Berg and M. de Groot and M. Overmars"
566, title =       "Perfect binary space partitions"
567, journal =     "Comput. Geom. Theory Appl."
568, volume =      7
569, year =        1997
570, pages =       "81--91"
571, succeeds =    "bgo-pbsp-93"
572, update =      "97.03 devillers"
573}
574
575@inproceedings{b-lsbsp-95
576, author =      "Mark de Berg"
577, title =       "Linear Size Binary Space Partitions for Fat Objects"
578, booktitle =   "Proc. 3rd Annu. European Sympos. Algorithms"
579, series =      "Lecture Notes Comput. Sci."
580, volume =      979
581, publisher =   "Springer-Verlag"
582, year =        1995
583, pages =       "252--263"
584, update =      "97.03 murali+schwarzkopf"
585}
586
587@article{ekltmmv-rcerr-91
588, author =      "J. L. Ellis and G. Kedem and T. C. Lyerly and D. G. Thielman and R. J. Marisa and J. P. Menon and H. B. Voelcker"
589, title =       "The ray casting engine and ray representations: a technical summary"
590, journal =     "Internat. J. Comput. Geom. Appl."
591, volume =      1
592, number =      4
593, year =        1991
594, pages =       "347--380"
595, keywords =    "mechanical CAD CAM, solid modeling, parallel computation, ray representation"
596}
597
598@article{py-ebsph-90
599, author =      "M. S. Paterson and F. F. Yao"
600, title =       "Efficient binary space partitions for hidden-surface removal and solid modeling"
601, journal =     "Discrete Comput. Geom."
602, volume =      5
603, year =        1990
604, pages =       "485--503"
605, succeeds =    "py-bpahs-89"
606}
607
608@inproceedings{py-obspo-90
609, author =      "M. S. Paterson and F. F. Yao"
610, title =       "Optimal binary space partitions for orthogonal objects"
611, booktitle =   "Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
612, year =        1990
613, pages =       "100--106"
614, precedes =    "py-obspo-92"
615}
616
617@article{py-obspo-92
618, author =      "M. S. Paterson and F. F. Yao"
619, title =       "Optimal binary space partitions for orthogonal objects"
620, journal =     "J. Algorithms"
621, volume =      13
622, year =        1992
623, pages =       "99--113"
624, succeeds =    "py-obspo-90"
625}
626
627@TechReport{Kreveld:1992:NRD,
628  author =       "M. J. van Kreveld",
629  title =        "New results on data structures in computational
630                 geometry",
631  type =         "Ph.{D}. {Dissertation}",
632  institution =  "Dept. Comput. Sci., Univ. Utrecht",
633  address =      "Utrecht, Netherlands",
634  year =         "1992",
635  keywords =     "doctoral thesis",
636}
637
638@Article{Vanecek:1991:BIM,
639  author =       "G. {Vanecek, Jr.}",
640  title =        "Brep-index: a multidimensional space partitioning
641                 tree",
642  journal =      "Internat. J. Comput. Geom. Appl.",
643  volume =       "1",
644  number =       "3",
645  year =         "1991",
646  pages =        "243--261",
647  keywords =     "classification, Brep, BSP tree, data structures",
648}
649
650@inproceedings{bg-bspsc-94
651, author =      "M. de Berg and M. de Groot"
652, title =       "Binary space partitions for sets of cubes"
653, booktitle =   "Abstracts 10th European Workshop Comput. Geom."
654, nickname =    "CG'94"
655, year =        1994
656, pages =       "84--88"
657, update =      "94.05 schwarzkopf"
658}
659
660
661@article{vko91,
662  author="M. van Kreveld and H. Overmars",
663  title="Divided k-d Trees",
664  journal="Algorithmica",
665  year="1991",
666  volume="6",
667  number="",
668  pages="840-858"
669}
Note: See TracBrowser for help on using the repository browser.