1 | @InCollection{p-rsls-97, |
---|
2 | author = "M. Pellegrini", |
---|
3 | title = "Ray shooting and lines in space", |
---|
4 | chapter = 32 , |
---|
5 | editor = "Jacob E. Goodman and Joseph O'Rourke", |
---|
6 | booktitle = "Handbook of Discrete and Computational Geometry", |
---|
7 | publisher = "CRC Press LLC", |
---|
8 | address = "Boca Raton, FL", |
---|
9 | year = 1997, |
---|
10 | pages = "599--614", |
---|
11 | update = "97.11 orourke", |
---|
12 | who = "Havran Vlastimil: CGE-0046", |
---|
13 | } |
---|
14 | |
---|
15 | @TechReport{Kahan94, |
---|
16 | author = "S. Kahan and P. Kelsen", |
---|
17 | title = "Constant Time Parallel Indexing of Points in a Triangle", |
---|
18 | institution = "Department of Computer Science, University of British |
---|
19 | Columbia", |
---|
20 | number = "UBC CS TR-94-06", |
---|
21 | month = feb, |
---|
22 | year = "1994", |
---|
23 | url = "http://www.cs.ubc.ca/cgi-bin/tr/1994/TR-94-06", |
---|
24 | who = "Havran Vlastimil: CGE-0045", |
---|
25 | } |
---|
26 | |
---|
27 | @Booklet{matousek94, |
---|
28 | author = "Matou\v{s}ek, J.", |
---|
29 | title = "Topological Methods in Combinatorics and Geometry", |
---|
30 | howpublished = "Lecture Notes", |
---|
31 | address = "Charles University--Praha", |
---|
32 | year = 1994, |
---|
33 | who = "Havran Vlastimil: CGE-0044", |
---|
34 | } |
---|
35 | |
---|
36 | @Article{KalShe94, |
---|
37 | author = "L.J. Guibas and J-C. Latombe and S.M. Lavalle and D. Lin and R. Motwani", |
---|
38 | title = "Visibility-Based Pursuit-Evasion in a Polygonal Environment", |
---|
39 | journal = "Special issue on the CGC Workshop on Computational Geometry, |
---|
40 | International Journal of Computational Geometry and Applications", |
---|
41 | volume = "??", |
---|
42 | year = "1997", |
---|
43 | who = "Havran Vlastimil: CGE-0043", |
---|
44 | } |
---|
45 | |
---|
46 | @TechReport{Luebke96:TCHR, |
---|
47 | author = "D. Luebke", |
---|
48 | title = "Hierarchical Structures For Dynamic Polygonal Simplification", |
---|
49 | institution = "Department of Computer Science, University of North |
---|
50 | Carolina - Chapel Hill", |
---|
51 | number = "TR96-006", |
---|
52 | month = feb # " 16", |
---|
53 | year = "1996", |
---|
54 | url = "ftp://ftp.cs.unc.edu/pub/publications/techreports/96-006.ps.Z", |
---|
55 | note = "Wed, 26 Jun 1996 18:07:48 GMT", |
---|
56 | who = "Havran Vlastimil: CGE-0042", |
---|
57 | } |
---|
58 | |
---|
59 | @TechReport{Erikson96, |
---|
60 | author = "Carl Erikson", |
---|
61 | title = "Polygonal Simplification: An Overview", |
---|
62 | institution = "Department of Computer Science, University of North |
---|
63 | Carolina - Chapel Hill", |
---|
64 | number = "TR96-016", |
---|
65 | month = feb # " 16", |
---|
66 | year = "1996", |
---|
67 | url = "ftp://ftp.cs.unc.edu/pub/publications/techreports/96-016.ps.Z", |
---|
68 | note = "Wed, 26 Jun 1996 18:07:48 GMT", |
---|
69 | who = "Havran Vlastimil: CGE-0041", |
---|
70 | } |
---|
71 | |
---|
72 | @techreport{TH83 |
---|
73 | , author = "S. Teller and M. Hohmeyer" |
---|
74 | , title = "Computing the Lines Piercing Four Lines" |
---|
75 | , type = "Technical {Report}" |
---|
76 | , number = "UCB/CSD 93/161" |
---|
77 | , institution = "UC Berkeley" |
---|
78 | , month = apr |
---|
79 | , year = 1993 |
---|
80 | , who = "Havran Vlastimil: CGE-0040" |
---|
81 | } |
---|
82 | |
---|
83 | @Article{KalShe94a, |
---|
84 | author = "Kalpakis and Sherman", |
---|
85 | title = "Probabilistic Analysis of an Enhanced Partitioning |
---|
86 | Algorithm for the Steiner Tree Problem", |
---|
87 | journal = "NETWORKS: Networks: An International Journal", |
---|
88 | volume = "24", |
---|
89 | year = "1994", |
---|
90 | who = "Havran Vlastimil: CGE-0039", |
---|
91 | } |
---|
92 | |
---|
93 | @Article{Blinn:1992:JBCc, |
---|
94 | author = "James F. Blinn", |
---|
95 | title = "{Jim Blinn}'s Corner --- Uppers and downers: Part 2", |
---|
96 | journal = "IEEE Computer Graphics and Applications", |
---|
97 | volume = "12", |
---|
98 | number = "3", |
---|
99 | pages = "80--85", |
---|
100 | month = may, |
---|
101 | year = "1992", |
---|
102 | coden = "ICGADZ", |
---|
103 | ISSN = "0272-1716", |
---|
104 | bibdate = "Sat Jan 25 06:42:48 MST 1997", |
---|
105 | acknowledgement = ack-nhfb, |
---|
106 | affiliation = "California Inst of Technol, CA, USA", |
---|
107 | classification = "723; 921", |
---|
108 | journalabr = "IEEE Comput Graphics Appl", |
---|
109 | keywords = "Applications; Computer Graphics; Feynman Diagrams; |
---|
110 | Mathematical Techniques --- Tensors", |
---|
111 | who = "Havran Vlastimil: CGE-0038", |
---|
112 | } |
---|
113 | |
---|
114 | @Article{Blinn:1992:JBCb, |
---|
115 | author = "James F. Blinn", |
---|
116 | title = "{Jim Blinn}'s Corner --- Uppers and downers", |
---|
117 | journal = "IEEE Computer Graphics and Applications", |
---|
118 | volume = "12", |
---|
119 | number = "2", |
---|
120 | pages = "85--91", |
---|
121 | month = mar, |
---|
122 | year = "1992", |
---|
123 | coden = "ICGADZ", |
---|
124 | ISSN = "0272-1716", |
---|
125 | bibdate = "Sat Jan 25 06:42:48 MST 1997", |
---|
126 | acknowledgement = ack-nhfb, |
---|
127 | affiliation = "California Inst of Technol, CA, USA", |
---|
128 | classification = "723; 921", |
---|
129 | journalabr = "IEEE Comput Graphics Appl", |
---|
130 | keywords = "Computational Geometry; Computer Graphics; |
---|
131 | Mathematical Techniques; Mathematical Techniques --- |
---|
132 | Tensors; Matrix Algebra", |
---|
133 | who = "Havran Vlastimil: CGE-0037", |
---|
134 | } |
---|
135 | |
---|
136 | @Article{RavadaSherman, |
---|
137 | author = "S. Ravada and A. T. Sherman", |
---|
138 | title = "Experimental evaluation of a partitioning algorithm |
---|
139 | for the {Steiner} tree problem in {$R^2$} and {$R^3$}", |
---|
140 | journal = "Networks", |
---|
141 | note = "(to appear)", |
---|
142 | year = "1993", |
---|
143 | url = "http://www.cs.umbc.edu/\~{}sherman/Rtopics/Algs/steiner.html", |
---|
144 | postscript = "http://www.cs.umbc.edu/pub/REPORTS/cs-93-12.ps", |
---|
145 | who = "Havran Vlastimil: CGE-0036", |
---|
146 | } |
---|
147 | |
---|
148 | @inproceedings{held:cgi:98, |
---|
149 | author = "M. Held", |
---|
150 | title = "Efficient and Reliable Triangulation of Polygons", |
---|
151 | booktitle = "Proceedings of Computer Graphics International '98 (CGI'98)", |
---|
152 | year = "1998", |
---|
153 | month = jun, |
---|
154 | pages = "633--643", |
---|
155 | address = "Hannover, Germany", |
---|
156 | publisher = "IEEE, NY", |
---|
157 | who = "Havran Vlastimil: CGE-0035", |
---|
158 | } |
---|
159 | |
---|
160 | @Article{Kolingerov:1997:CPL, |
---|
161 | author = "Ivana Kolingerov", |
---|
162 | title = "Convex polyhedron-line intersection detection using |
---|
163 | dual representation", |
---|
164 | journal = "The Visual Computer", |
---|
165 | year = "1997", |
---|
166 | volume = "13", |
---|
167 | number = "1", |
---|
168 | pages = "42--49", |
---|
169 | publisher = "Springer-Verlag", |
---|
170 | note = "ISSN 0178-2789", |
---|
171 | keywords = "intersection detection, dual representation, |
---|
172 | line-polyhedron intersection, convex polyhedron, |
---|
173 | computer graphics", |
---|
174 | annote = "Duality is a well-known principle of computational |
---|
175 | geometry. It is often used for detecting the mutual |
---|
176 | position of convex geometrical objects, the dimensions |
---|
177 | of which do not differ more than by one; e.g., a convex |
---|
178 | polyhedron and a hyperplane or two convex polyhedra of |
---|
179 | the same dimensions. In this paper, a new possibility |
---|
180 | of usage is shown for objects with dimensions different |
---|
181 | by two. The mutual position of a convex polyhedron and |
---|
182 | a line is tested. The method works as follows. The line |
---|
183 | is described as an intersection of two planes. With a |
---|
184 | proper choice of these planes, the original problem of |
---|
185 | detecting a polyhedron-line intersection is reduced to |
---|
186 | a one-dimensional range search, which is much simpler |
---|
187 | to solve. The price to be paid for this reduction is |
---|
188 | computationally more demanding preprocessing.", |
---|
189 | who = "Havran Vlastimil: CGE-0034", |
---|
190 | } |
---|
191 | |
---|
192 | @InCollection{Green95gems, |
---|
193 | author = "D. Green and D. Hatch", |
---|
194 | editor = "Alan W. Paeth", |
---|
195 | title = "Fast Polygon-Cube Intersection Testing", |
---|
196 | booktitle = "Graphics Gems V", |
---|
197 | pages = "375--379", |
---|
198 | publisher = "Academic Press", |
---|
199 | address = "Boston MA", |
---|
200 | year = "1995", |
---|
201 | who = "Havran Vlastimil: CGE-0033", |
---|
202 | } |
---|
203 | |
---|
204 | @InProceedings{Barequet:1996:HCR, |
---|
205 | title = "History Consideration in Reconstructing Polyhedral |
---|
206 | Surfaces from Parallel Slices", |
---|
207 | author = "Gill Barequet and Daniel Shapiro and Ayellet Tal", |
---|
208 | booktitle = "IEEE Visualization '96", |
---|
209 | organization = "IEEE", |
---|
210 | year = "1996", |
---|
211 | month = oct, |
---|
212 | note = "ISBN 0-89791-864-9", |
---|
213 | who = "Havran Vlastimil: CGE-0032", |
---|
214 | } |
---|
215 | |
---|
216 | @InProceedings{SODA::AgarwalP1998, |
---|
217 | title = "Exact and Approximation Algorithms for Clustering |
---|
218 | (Extended Abstract)", |
---|
219 | author = "Pankaj K. Agarwal and Cecilia M. Procopiuc", |
---|
220 | pages = "658--667", |
---|
221 | booktitle = "Proceedings of the Ninth Annual {ACM}-{SIAM} Symposium |
---|
222 | on Discrete Algorithms", |
---|
223 | month = "25--27 " # jan, |
---|
224 | year = "1998", |
---|
225 | address = "San Francisco, California", |
---|
226 | references = "\cite{ACMCS::AgarwalS1998} |
---|
227 | \cite{ICVLDB::AgrawalGIIS1992} |
---|
228 | \cite{JALGO::Bar-IlanKP1993} |
---|
229 | \cite{STOC::charikarCFM1997} |
---|
230 | \cite{ICVLDB::DiwanRSS1996} \cite{STOC::FederG1988} |
---|
231 | \cite{IPL::FowlerPT1981} \cite{TCS::Gonzalez1985} |
---|
232 | \cite{IPL::Gonzalez1991} \cite{ALGOR::HwangCL1993} |
---|
233 | \cite{ALGOR::HwangLC1993} \cite{ESA::KhullerS1996} |
---|
234 | \cite{SODA::LuptonMY1996} \cite{SICOMP::MegiddoS1984} |
---|
235 | \cite{ICVLDB::NgH1994} \cite{SODA::Raghavan1997} |
---|
236 | \cite{ICVLDB::ShaverAM1997} \cite{STOC::ShmoysTA1997}", |
---|
237 | who = "Havran Vlastimil: CGE-0031", |
---|
238 | } |
---|
239 | |
---|
240 | @techreport{c-accgc-96 |
---|
241 | , author = "Bernard Chazelle and others" |
---|
242 | , title = "Application Challenges to Computational Geometry: {CG} Impact Task Force Report" |
---|
243 | , type = "Technical {Report}" |
---|
244 | , number = "TR-521-96" |
---|
245 | , institution = "Princeton Univ." |
---|
246 | , month = apr |
---|
247 | , year = 1996 |
---|
248 | , url = "http://www.cs.princeton.edu/~chazelle/taskforce/CGreport.ps" |
---|
249 | , comments = "Also at \path|http://www.cs.duke.edu/~jeffe/compgeom/taskforce.html|" |
---|
250 | , update = "98.03 mitchell, 97.03 pocchiola+tamassia, 96.09 orourke" |
---|
251 | , who = "Havran Vlastimil: CGE-0030" |
---|
252 | } |
---|
253 | |
---|
254 | |
---|
255 | @Booklet{matousek94:LN, |
---|
256 | author = "Matou\v{s}ek, J.", |
---|
257 | title = "Lecture notes on combinatorial and algorithmic geometry", |
---|
258 | howpublished = "Lecture Notes", |
---|
259 | address = "Charles University--Praha", |
---|
260 | year = 1998, |
---|
261 | who = "Havran Vlastimil: CGE-0029", |
---|
262 | } |
---|
263 | |
---|
264 | @techreport{ae-rsir-97 |
---|
265 | , author = "Pankaj K. Agarwal and Jeff Erickson" |
---|
266 | , title = "Geometric range searching and its relatives" |
---|
267 | , type = "Tech.\ Report" |
---|
268 | , number = "CS-1997-11" |
---|
269 | , institution = "Department of Computer Science" |
---|
270 | , address = "Duke University" |
---|
271 | , year = 1997 |
---|
272 | , update = "98.03 agarwal" |
---|
273 | , who = "Havran Vlastimil: CGE-0028" |
---|
274 | } |
---|
275 | |
---|
276 | techreport{a-rs-96 |
---|
277 | , author = "Pankaj K. Agarwal" |
---|
278 | , title = "Range searching" |
---|
279 | , type = "Report" |
---|
280 | , number = "CS-1996-05" |
---|
281 | , institution = "Dept. Comput. Sci., Duke Univ." |
---|
282 | , address = "Durham, NC" |
---|
283 | , year = 1996 |
---|
284 | , update = "96.09 agarwal" |
---|
285 | , who = "Havran Vlastimil: CGE-0027" |
---|
286 | } |
---|
287 | |
---|
288 | @inproceedings{aas-lalsp-97 |
---|
289 | , author = "B. Aronov and Pankaj Agarwal and Micha Sharir" |
---|
290 | , title = "On Levels in Arrangements of Lines, Segments, Planes, and Triangles" |
---|
291 | , booktitle = "Proc. 13th Annu. ACM Sympos. Comput. Geom." |
---|
292 | , year = 1997 |
---|
293 | , pages = "30--38" |
---|
294 | , update = "98.03 mitchell, 97.07 efrat" |
---|
295 | , who = "Havran Vlastimil: CGE-0026" |
---|
296 | } |
---|
297 | |
---|
298 | @incollection{dt-cg-97 |
---|
299 | , author = "D. Dobkin and S. Teller" |
---|
300 | , title = "Computer graphics" |
---|
301 | , chapter = 42 |
---|
302 | , editor = "Jacob E. Goodman and Joseph O'Rourke" |
---|
303 | , booktitle = "Handbook of Discrete and Computational Geometry" |
---|
304 | , publisher = "CRC Press LLC" |
---|
305 | , address = "Boca Raton, FL" |
---|
306 | , year = 1997 |
---|
307 | , pages = "779--796" |
---|
308 | , update = "97.11 orourke" |
---|
309 | , who = "Havran Vlastimil: CGE-0025" |
---|
310 | } |
---|
311 | |
---|
312 | @article{aaas-cvgbr-94 |
---|
313 | , author = "Pankaj K. Agarwal and N. Alon and B. Aronov and Subhash Suri" |
---|
314 | , title = "Can visibility graphs be represented compactly?" |
---|
315 | , journal = "Discrete Comput. Geom." |
---|
316 | , volume = 12 |
---|
317 | , year = 1994 |
---|
318 | , pages = "347--365" |
---|
319 | , update = "98.03 mitchell, 96.05 agarwal, 95.01 smid" |
---|
320 | , who = "Havran Vlastimil: CGE-0024" |
---|
321 | } |
---|
322 | |
---|
323 | @article{hs-parss-95 |
---|
324 | , author = "J. Hershberger and Subhash Suri" |
---|
325 | , title = "A Pedestrian Approach to Ray Shooting: {Shoot} a Ray, Take a Walk" |
---|
326 | , journal = "J. Algorithms" |
---|
327 | , volume = 18 |
---|
328 | , year = 1995 |
---|
329 | , pages = "403--431" |
---|
330 | , keywords = "mesh generation, triangulation, stabbing number" |
---|
331 | , succeeds = "hs-parss-93" |
---|
332 | , update = "98.03 mitchell, 96.05 mitchell+pocchiola" |
---|
333 | , annote = "Special issue of selected papers from the |
---|
334 | 4th Symposium on Discrete Algorithms." |
---|
335 | , who = "Havran Vlastimil: CGE-0023" |
---|
336 | } |
---|
337 | |
---|
338 | @article{k-3vrs2-97 |
---|
339 | , author = "M. J. Katz" |
---|
340 | , title = "{3-D} vertical ray shooting and {2-D} point enclosure, range searching, and arc shooting amidst convex fat objects" |
---|
341 | , journal = "Comput. Geom. Theory Appl." |
---|
342 | , volume = 8 |
---|
343 | , year = 1997 |
---|
344 | , pages = "299--316" |
---|
345 | , update = "97.11 katz" |
---|
346 | , who = "Havran Vlastimil: CGE-0022" |
---|
347 | } |
---|
348 | |
---|
349 | @article{bgo-nrbsp-97 |
---|
350 | , author = "M. de Berg and M. de Groot and M. Overmars" |
---|
351 | , title = "New results on binary space partitions in the plane" |
---|
352 | , journal = "Comput. Geom. Theory Appl." |
---|
353 | , volume = 8 |
---|
354 | , year = 1997 |
---|
355 | , pages = "317--333" |
---|
356 | , update = "97.11 oostrum" |
---|
357 | , who = "Havran Vlastimil: CGE-0021" |
---|
358 | } |
---|
359 | |
---|
360 | @inproceedings{aeg-kbspi-98 |
---|
361 | , author = "Pankaj K. Agarwal and Jeff Erickson and Leonidas J. Guibas" |
---|
362 | , title = "Kinetic binary space partitions for intersecting segments and disjoint triangles" |
---|
363 | , booktitle = "Proc. 9th ACM-SIAM Sympos. Discrete Algorithms" |
---|
364 | , journal = "Proc. 1st Internat. IEE/IEEE Conf. on Genetic Algorithms in Engineering Systems: Innovations and Applications" |
---|
365 | , year = 1998 |
---|
366 | , pages = "107--116" |
---|
367 | , update = "98.03 agarwal" |
---|
368 | , who = "Havran Vlastimil: CGE-0020" |
---|
369 | } |
---|
370 | |
---|
371 | @inproceedings{ab-hgach-95 |
---|
372 | , author = "David Avis and David Bremner" |
---|
373 | , title = "How Good are Convex Hull Algorithms?" |
---|
374 | , booktitle = "Proc. 11th Annu. ACM Sympos. Comput. Geom." |
---|
375 | , year = 1995 |
---|
376 | , pages = "20--28" |
---|
377 | , keywords = "vertex enumeration, pivoting" |
---|
378 | , cites = "af-pachv-92, bdh-qach-93, bl-cacp-93, b-icp-83, cgaf-gstlm-94, ck-acp-70, c-ochaa-93, c-lp-83, cs-adpch-88, d-cvem-83, f-crmv0-, gkz-drmd-94, h-sretn-91, k-pptrl-74, km-hgisa-72, l-epcrn-88, lt-sptcc-91, l-rtp-91, mrtt-ddm-53, s-chaop-81, s-chdch-86, y-stgd-90, ZZZ" |
---|
379 | , update = "98.03 bibrelex, 95.09 mitchell" |
---|
380 | , who = "Havran Vlastimil: CGE-0019", |
---|
381 | } |
---|
382 | |
---|
383 | @techreport{pv-pc-96 |
---|
384 | , author = "M. Pocchiola and G. Vegter" |
---|
385 | , title = "On polygonal covers" |
---|
386 | , number = "96-16" |
---|
387 | , institution = "Labo. Inf. Ens" |
---|
388 | , address = "45 rue d'Ulm 75230 Paris, France" |
---|
389 | , month = jul |
---|
390 | , year = 1996 |
---|
391 | , note = "" |
---|
392 | , keywords = "illumination, covering, separation" |
---|
393 | , comments = "" |
---|
394 | , succeeds = "pv-ptta-96" |
---|
395 | , update = "97.03 pocchiola" |
---|
396 | , who = "Havran Vlastimil: CGE-0018", |
---|
397 | } |
---|
398 | |
---|
399 | @inproceedings{pv-ptta-96 |
---|
400 | , author = "Michel Pocchiola and Gert Vegter" |
---|
401 | , title = "Pseudo-Triangulations: Theory and Applications" |
---|
402 | , booktitle = "Proc. 12th Annu. ACM Sympos. Comput. Geom." |
---|
403 | , year = 1996 |
---|
404 | , pages = "291--300" |
---|
405 | , cites = "pv-vc-96, pv-cvgpt-95, b-rsdoh-93, c-cgr-95, f-icd-77, ers-ccsno-90, blsz-om-93, rz-rspu-95, pa-cg-95, gp-ms-83, bcm-anlcg-90" |
---|
406 | , update = "97.11 bibrelex, 96.05 efrat+pocchiola" |
---|
407 | , who = "Havran Vlastimil: CGE-0017", |
---|
408 | } |
---|
409 | |
---|
410 | @inproceedings{bp-sccpa-96 |
---|
411 | , author = "Chandrajit L. Bajaj and Valerio Pascucci" |
---|
412 | , title = "Splitting a Complex of Convex Polytopes in any Dimension" |
---|
413 | , booktitle = "Proc. 12th Annu. ACM Sympos. Comput. Geom." |
---|
414 | , year = 1996 |
---|
415 | , pages = "88--97" |
---|
416 | , cites = "am-dhsrr-95, am-rsss-94, b-rgsdd-93, bd-cdpr-92, be-mgot-92i, c-oaitd-92, cd-icott-87, dk-fdpi-83, e-acg-87, em-sstcd-90, fm-nsala-91, g-cp-67, hk-prga-92, k-opcbf-95, l-ndgcm-94, lc-mchr3-87, lm-cschu-90, m-cgitr-93, m-rpm-93, m-rsehc-93, mhc-avcev-90, n-cgpt-93, nat-mbtyp-90, pbcf-dimsc-93, pfp-diccb-95, py-ebsph-90, s-lrapi-94, s-rcaic-94, t-cpos-92, tn-sopub-87, v-bimsp-91, ZZZ" |
---|
417 | , update = "97.11 bibrelex, 96.05 efrat" |
---|
418 | , who = "Havran Vlastimil: CGE-0016", |
---|
419 | } |
---|
420 | |
---|
421 | @incollection{g-dirsc-94 |
---|
422 | , author = "Ned Greene" |
---|
423 | , title = "Detecting Intersection of a Rectangular Solid and a Convex Polyhedron" |
---|
424 | , editor = "Paul Heckbert" |
---|
425 | , booktitle = "Graphics Gems IV" |
---|
426 | , publisher = "Academic Press" |
---|
427 | , address = "Boston, MA" |
---|
428 | , year = 1994 |
---|
429 | , pages = "74--82" |
---|
430 | , keywords = "collision detection, octree, computational geometry" |
---|
431 | , update = "94.09 heckbert" |
---|
432 | , annote = "Presents an optimized technique to test for intersection |
---|
433 | between a convex polyhedron and a box. This is useful when comparing |
---|
434 | bounding boxes against a viewing frustum in a rendering program, for |
---|
435 | instance. Contains pseudocode." |
---|
436 | , who = "Havran Vlastimil: CGE-0015", |
---|
437 | } |
---|
438 | |
---|
439 | @techreport{as-eago-96 |
---|
440 | , author = "Pankaj K. Agarwal and Micha Sharir" |
---|
441 | , title = "Efficient algorithms for geometric optimization" |
---|
442 | , type = "Tech.\ Report" |
---|
443 | , number = "CS-1996-19" |
---|
444 | , institution = "Dept. Computer Science, Duke University" |
---|
445 | , year = 1996 |
---|
446 | , update = "97.07 agarwal" |
---|
447 | , who = "Havran Vlastimil: CGE-0014", |
---|
448 | } |
---|
449 | |
---|
450 | @inproceedings{as-rsacp-93 |
---|
451 | , author = "Pankaj K. Agarwal and M. Sharir" |
---|
452 | , title = "Ray Shooting Amidst Convex Polytopes in Three Dimensions" |
---|
453 | , booktitle = "Proc. 4th ACM-SIAM Sympos. Discrete Algorithms" |
---|
454 | , year = 1993 |
---|
455 | , pages = "260--270" |
---|
456 | , precedes = "as-rsacp-96ii" |
---|
457 | , update = "96.05 smid, 93.05 smid" |
---|
458 | , who = "Havran Vlastimil: CGE-0013", |
---|
459 | } |
---|
460 | |
---|
461 | @article{as-rsacp-96i |
---|
462 | , author = "P. K. Agarwal and M. Sharir" |
---|
463 | , title = "Ray shooting amidst convex polygons in {2D}" |
---|
464 | , journal = "J. Algorithms" |
---|
465 | , volume = 21 |
---|
466 | , year = 1996 |
---|
467 | , pages = "508--519" |
---|
468 | , update = "97.03 agarwal+pocchiola+smid, 96.09 agarwal, 96.05 agarwal" |
---|
469 | , who = "Havran Vlastimil: CGE-0012", |
---|
470 | } |
---|
471 | |
---|
472 | @TechReport{EVL-1996-11, |
---|
473 | author = "Andr{\'e} Hinkenjann and Markus Kubuk and Heinrich |
---|
474 | M{\"u}ller", |
---|
475 | title = "Answering Line Segment Intersection Queries Based On |
---|
476 | Sample Answers", |
---|
477 | number = "620/1996", |
---|
478 | type = "Research Report", |
---|
479 | institution = "University of Dortmund", |
---|
480 | address = "Universit{\"a}t Dortmund, 44221 Dortmund, Germany", |
---|
481 | month = aug, |
---|
482 | year = "1996", |
---|
483 | abstract = "Geometric query problems can be solved by |
---|
484 | preprocessing the answers for a representative set of |
---|
485 | sample queries. An arbitrary query is answered by the |
---|
486 | response of a closest sample query. In general, this |
---|
487 | answer will not be correct. A framework is presented in |
---|
488 | which the quality of approximation of this approach can |
---|
489 | be characterized. Futher, efficiency considerations are |
---|
490 | performed. They consist in empirical experiments for |
---|
491 | the classical line segment intersection query problem, |
---|
492 | but also in giving theoretical time and space bounds |
---|
493 | describing the trade-off between quality of |
---|
494 | approximation and computational complexity. Finally, |
---|
495 | approaches to the choice of favorable sample queries |
---|
496 | are discussed.", |
---|
497 | postscript-url = "ftp://euklid.informatik.uni-dortmund.de/pub/reports/ls7/rr-6 |
---|
498 | 20.ps.gz", |
---|
499 | evlib-url = "http://infovis.zib.de:8000/Dienst/UI/2.0/Describe/evl.computat |
---|
500 | ionalgeometry%2FEVL-1996-11", |
---|
501 | evlib-revision = "1st", |
---|
502 | evlib-postscript-md5 = "14a18f6a52af153a3c3eb1c7037c344c", |
---|
503 | who = "Havran Vlastimil: CGE-0011", |
---|
504 | } |
---|
505 | |
---|
506 | @article{m-vrsa-93 |
---|
507 | , author = "J. Matou{\v s}ek" |
---|
508 | , title = "On Vertical Ray Shooting in Arrangements" |
---|
509 | , journal = "Comput. Geom. Theory Appl." |
---|
510 | , volume = 2 |
---|
511 | , number = 5 |
---|
512 | , month = mar |
---|
513 | , year = 1993 |
---|
514 | , pages = "279--285" |
---|
515 | , keywords = "ray shooting, zone theorem, cutting, hyperplane arrangement" |
---|
516 | , update = "93.09 held+matousek+milone+mitchell" |
---|
517 | , who = "Havran Vlastimil: CGE-0010", |
---|
518 | } |
---|
519 | |
---|
520 | @incollection{as-atgo-95 |
---|
521 | , author = "P. K. Agarwal and Micha Sharir" |
---|
522 | , title = "Algorithmic techniques for geometric optimization" |
---|
523 | , booktitle = "??" |
---|
524 | , series = "Lecture Notes Comput. Sci." |
---|
525 | , volume = 1000 |
---|
526 | , publisher = "Springer-Verlag" |
---|
527 | , year = 1995 |
---|
528 | , pages = "234--253" |
---|
529 | , update = "98.03 mitchell, 97.11 bibrelex" |
---|
530 | , who = "Havran Vlastimil: CGE-0009", |
---|
531 | } |
---|
532 | |
---|
533 | article{h-iarat-96 |
---|
534 | , author = "Philip M. Hubbard" |
---|
535 | , title = "Improving Accuracy in a Robust Algorithm for Three-Dimensional {Voronoi} Diagrams" |
---|
536 | , journal = "Journal of Graphics Tools" |
---|
537 | , volume = 1 |
---|
538 | , number = 1 |
---|
539 | , year = 1996 |
---|
540 | , pages = "33--47" |
---|
541 | , update = "96.09 held+hubbard" |
---|
542 | , annote = "Extends \cite{iss-nriac-92}" |
---|
543 | , abstract = "This paper describes extensions to a previous algorithm that |
---|
544 | robustly builds three-dimensional Voronoi diagrams in the |
---|
545 | presence of inexact numerical computations. The extensions |
---|
546 | improve the algorithm's accuracy, making its results more |
---|
547 | nearly represent the proximity properties of an ideal |
---|
548 | Voronoi diagram. In empirical tests, these extensions have |
---|
549 | improved accuracy by more than eight orders of magnitude. |
---|
550 | Complete pseudocode for the algorithm appears in an appendix |
---|
551 | of this paper." |
---|
552 | , who = "Havran Vlastimil: CGE-0008", |
---|
553 | } |
---|
554 | |
---|
555 | @article{yn-sbgtc-97 |
---|
556 | , author = "F. Yamaguchi and M. Niizeki" |
---|
557 | , title = "Some Basic Geometric Test Conditions in Terms of Pluecker Coordinates and Pluecker Coefficients" |
---|
558 | , journal = "Visual Comput." |
---|
559 | , volume = 13 |
---|
560 | , number = 1 |
---|
561 | , year = 1997 |
---|
562 | , pages = "29--41" |
---|
563 | , update = "97.03 held" |
---|
564 | , who = "Havran Vlastimil: CGE-0007", |
---|
565 | } |
---|
566 | |
---|
567 | @incollection{m-ccpps-91 |
---|
568 | , author = "J. Matou{\v s}ek" |
---|
569 | , title = "Computing the center of planar point sets" |
---|
570 | , editor = "J. E. Goodman and R. Pollack and W. Steiger" |
---|
571 | , booktitle = "Computational Geometry: papers from the DIMACS special year" |
---|
572 | , publisher = "American Mathematical Society" |
---|
573 | , address = "Providence" |
---|
574 | , year = 1991 |
---|
575 | , pages = "221--230" |
---|
576 | , keywords = "centerpoint, parametric search, cutting, k-level" |
---|
577 | , update = "96.05 agarwal, 93.09 matousek" |
---|
578 | , who = "Havran Vlastimil: CGE-0006", |
---|
579 | } |
---|
580 | |
---|
581 | @article{m-dcg-96 |
---|
582 | , author = "J. Matou{\v s}ek" |
---|
583 | , title = "Derandomization in computational geometry" |
---|
584 | , journal = "J. Algorithms" |
---|
585 | , volume = 20 |
---|
586 | , year = 1996 |
---|
587 | , pages = "545--580" |
---|
588 | , update = "97.03 smid" |
---|
589 | , who = "Havran Vlastimil: CGE-0005", |
---|
590 | } |
---|
591 | |
---|
592 | @inproceedings{amv-ptcbs-97 |
---|
593 | , author = "P. Agarwal and T. Murali and J. Vitter" |
---|
594 | , title = "Practical techniques for constructing binary space partitions for orthogonal rectangles" |
---|
595 | , booktitle = "Proc. 13th Annu. ACM Sympos. Comput. Geom." |
---|
596 | , year = 1997 |
---|
597 | , pages = "382--384" |
---|
598 | , update = "97.07 efrat" |
---|
599 | , who = "Havran Vlastimil: CGE-0004", |
---|
600 | } |
---|
601 | |
---|
602 | @inproceedings{agm-bspfr-96 |
---|
603 | , author = "P. K. Agarwal and E. F. Grove and T. M. Murali and J. S. Vitter" |
---|
604 | , title = "Binary Space Partitions for Fat Rectangles" |
---|
605 | , booktitle = "Proc. 37th Annu. IEEE Sympos. Found. Comput. Sci." |
---|
606 | , site = "Burlington, VT" |
---|
607 | , month = oct |
---|
608 | , year = 1996 |
---|
609 | , pages = "482--491" |
---|
610 | , update = "97.07 smid, 97.03 murali" |
---|
611 | , who = "Havran Vlastimil: CGE-0003", |
---|
612 | } |
---|
613 | |
---|
614 | @inproceedings{agmv-cskbs-97 |
---|
615 | , author = "Pankaj K. Agarwal and Leonidas J. Guibas and T. M. Murali and Jeffrey Scott Vitter" |
---|
616 | , title = "Cylindrical Static and Kinetic Binary Space Partitions" |
---|
617 | , booktitle = "Proc. 13th Annu. ACM Sympos. Comput. Geom." |
---|
618 | , year = 1997 |
---|
619 | , pages = "39--48" |
---|
620 | , update = "97.07 agarwal+efrat" |
---|
621 | , who = "Havran Vlastimil: CGE-0002", |
---|
622 | } |
---|
623 | |
---|
624 | @InProceedings{Agarwal94soda, |
---|
625 | author = "Pankaj K. Agarwal and Subhash Suri", |
---|
626 | title = "Surface Approximation and Geometric Partitions", |
---|
627 | booktitle = "Proc. 5th ACM-SIAM Sympos. Discrete Algorithms", |
---|
628 | year = "1994", |
---|
629 | pages = "24--33", |
---|
630 | keywords = "triangulation, ray shooting", |
---|
631 | update = "95.01 mitchell", |
---|
632 | annote = "polygonal approximation of terrains within log factor |
---|
633 | of optimal", |
---|
634 | note = "(Also available as Duke U. CS tech report, URL {ftp://ftp.cs.duke.edu/dist/techreport/1994/1994-21.ps.Z})", |
---|
635 | who = "Havran Vlastimil: CGE-0001", |
---|
636 | } |
---|
637 | |
---|
638 | @book{bkos-cgaa-97 |
---|
639 | , author = "Mark de Berg and Marc van Kreveld and Mark Overmars and Otfried Schwarzkopf" |
---|
640 | , title = "Computational Geometry: Algorithms and Applications" |
---|
641 | , publisher = "Springer-Verlag" |
---|
642 | , address = "Berlin" |
---|
643 | , year = 1997 |
---|
644 | , isbn = "3-540-61270-X" |
---|
645 | , url = "http://www.cs.ruu.nl/geobook/" |
---|
646 | , keywords = "textbook" |
---|
647 | , update = "98.03 agarwal+mitchell, 97.11 oostrum+orourke" |
---|
648 | , who = "Havran Vlastimil: CGE-0087" |
---|
649 | } |
---|
650 | |
---|