-
-
Notifications
You must be signed in to change notification settings - Fork 4
/
Copy pathtopp.bib
2954 lines (2674 loc) · 88.3 KB
/
topp.bib
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
% Some entries from Geombib: https://sarielhp.org/research/CG/bib/
@article{a-rsoas-92
, author = "Pankaj K. Agarwal"
, title = "Ray shooting and other applications of spanning trees with low stabbing number"
, journal = "SIAM J. Comput."
, volume = 21
, year = 1992
, pages = "540--570"
, keywords = "ray shooting, visibility, spanning trees, partition trees"
, succeeds = "a-rsoas-89"
, update = "96.05 agarwal, 95.05 korneenko"
}
@article{aacs-lalsp-98
, author = "P. K. Agarwal and Boris Aronov and T. M. Chan and Micha Sharir"
, title = "On Levels in Arrangements of Lines, Segments, Planes, and Triangles"
, journal = "Discrete Comput. Geom."
, volume = 19
, year = 1998
, pages = "315--331"
, update = "98.07 agarwal+smid, 98.03 agarwal"
}
@article{aaos-supa-97
, author = "Pankaj K. Agarwal and Boris Aronov and Joseph O'Rourke and Catherine A. Schevon"
, title = "Star Unfolding of a Polytope with Applications"
, journal = "SIAM J. Comput."
, volume = 26
, year = 1997
, pages = "1689--1713"
, keywords = "motion planning, shortest paths, polytopes, diameter, edge sequences, unfolding of polytopes"
, succeeds = "aaos-supa-93"
, update = "98.03 smid, 97.11 agarwal+orourke, 97.03 agarwal+orourke, 96.05 orourke"
}
@article{aesw-emstb-91
, author = "Pankaj K. Agarwal and Herbert Edelsbrunner and O. Schwarzkopf and Emo Welzl"
, title = "Euclidean minimum spanning trees and bichromatic closest pairs"
, journal = "Discrete Comput. Geom."
, volume = 6
, number = 5
, year = 1991
, pages = "407--422"
, keywords = "proximity, minimum spanning trees, random sampling, geometric graphs, Voronoi diagrams, three-dimensional, closest pairs, red-blue"
, succeeds = "aesw-emstb-90"
, update = "98.03 mitchell, 96.05 agarwal, 95.05 korneenko, 93.05 schwarzkopf"
}
@article{aes-vdsl3-99
, author = "P. K. Agarwal and A. Efrat and Micha Sharir"
, title = "Vertical decomposition of shallow levels in $3$-dimensional arrangements and its applications"
, journal = "SIAM J. Comput."
, volume = 29
, year = 1999
, pages = "912--953"
, update = "00.11 smid, 00.07 smid"
}
@article{am-dhsrr-95
, author = "P. K. Agarwal and J. Matou{\v s}ek"
, title = "Dynamic Half-Space Range Reporting and Its Applications"
, journal = "Algorithmica"
, volume = 13
, year = 1995
, pages = "325--345"
, keywords = "arrangements, cuttings, range-searching, dynamization"
, update = "96.09 agarwal, 96.05 pascucci"
}
@incollection{as-dssga-00
, author = "Pankaj K. Agarwal and Micha Sharir"
, title = "{Davenport-Schinzel} Sequences and Their Geometric Applications"
, editor = "J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
, booktitle = "Handbook of Computational Geometry"
, publisher = "Elsevier Publishers B.V. North-Holland"
, address = "Amsterdam"
, year = 2000
, pages = "1--47"
, update = "00.03 bibrelex, 99.03 bibrelex, 98.11 bibrelex, 98.07 mitchell"
, annote = "Chapter 1 of su-hcg-00"
}
@inproceedings{as-hpcps-24
, author={Mikkel Abrahamsen and Jack Stade}
, booktitle={2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS)}
, title={Hardness of Packing, Covering and Partitioning Simple Polygons with Unit Squares}
, year={2024}
, volume={}
, number={}
, pages={1355-1371}
, keywords={Computer science;Logic;Faces;packing;np-hard;polygon;covering;partitioning}
, url="https://arxiv.org/abs/2404.09835"
, doi={10.1109/FOCS61266.2024.00087}
}
@inproceedings{as-pckum-99
, author = "Pankaj K. Agarwal and Micha Sharir"
, title = "Pipes, cigars, and kreplach: The union of {M}inkowski sums in three dimensions"
, booktitle = "Proc. 15th Annu. ACM Sympos. Comput. Geom."
, year = 1999
, pages = "143--153"
, update = "00.03 agarwal"
}
@article{as-pckum-00
, author = "Pankaj K. Agarwal and Micha Sharir"
, title = "Pipes, cigars, and kreplach: The union of {M}inkowski sums in three dimensions"
, journal = "Discrete Comput. Geom."
, volume = 24
, number = 4
, year = 2000
, pages = "645--685"
, update = "01.07 orourke"
}
@article{as-sagp-98
, author = "P. K. Agarwal and S. Suri"
, title = "Surface Approximation and Geometric Partitions"
, journal = "SIAM J. Comput."
, volume = 27
, year = 1998
, pages = "1016--1035"
, update = "01.04 smid"
}
@article{av-eaapc-00
, author = "P. K. Agarwal and Kasturi R. Varadarajan"
, title = "Efficient algorithms for approximating polygonal chains"
, journal = "Discrete Comput. Geom."
, volume = 23
, year = 2000
, pages = "273--291"
, update = "01.11 smid, 00.03 agarwal"
}
@inproceedings{ackms-amtsp-97
, author = "Alok Aggarwal and Don Coppersmith and Sanjeev Khanna and Rajeev Motwani and Baruch Schieber"
, title = "The Angular-Metric Traveling Salesman Problem"
, booktitle = "Proc. 8thh Annual ACM-SIAM Sympos. Discrete Algorithms"
, site = "New Orleans, Louisiana"
, month = jan
, year = 1997
, pages = "221--229"
, update = "98.03 mitchell"
, annote = "An earlier version, titled 'The Angle-TSP Problem and the
Weighted Linear Matroid Parity Problem' was accepted
to STOC96, but apparently was withdrawn, as it never
appeared there"
}
@article{aahk-tct-02
, author = "Oswin Aichholzer and Franz Aurenhammer and Ferran Hurtado and Hannes Krasser"
, title = "Towards compatible triangulations"
, journal = "Theoret. Comput. Sci."
, volume = "??"
, year = 2002
, pages = "??--??"
, note = "\url{http://www.cis.TUGraz.at/igi/oaich/}"
, url = "http://www.cis.TUGraz.at/igi/oaich/publications.html"
, succeeds = "aak-ctps-01"
, update = "02.03 orourke"
}
@inproceedings{aak-ctps-01
, author = "Oswin Aichholzer and Franz Aurenhammer and Hannes Krasser"
, title = "On Compatible Triangulations of Point Sets"
, booktitle = "Abstracts 17th European Workshop Comput. Geom."
, nickname = "CG 2001"
, site = "Berlin"
, publisher = "Freie Universit{\"a}t Berlin"
, year = 2001
, pages = "23--26"
, update = "01.04 icking"
}
@inproceedings{agr-lttsp-00
, author = "Nancy M. Amato and Michael T. Goodrich and Edgar A. Ramos"
, title = "Linear-Time Triangulation of a Simple Polygon Made Easier via Randomization"
, booktitle = "Proc. 16th Annu. ACM Sympos. Comput. Geom."
, year = 2000
, pages = "201--212"
, update = "00.11 jones"
}
@inproceedings{acdl-sahsr-00
, author = "N. Amenta and S. Choi and T. K. Dey and N. Leekha"
, title = "A Simple Algorithm for Homeomorphic Surface Reconstruction"
, booktitle = "Proc. 16th Annu. ACM Sympos. Comput. Geom."
, year = 2000
, pages = "213--222"
, update = "00.11 jones"
}
@inproceedings{abfms-ftphwusr-01
, author = "E. M. Arkin and M. A. Bender and S. P. Fekete and J. S. B. Mitchell and M. Skutella"
, title = "The Freeze-Tag Problem: How to Wake Up a Swarm of Robots"
, booktitle = "Proc. 13th ACM-SIAM Sympos. Discrete Algorithms"
, year = 2002
, pages = "568--577"
, update = "02.03 orourke"
}
@inproceedings{acmsy-mst-97
, author = "Esther M. Arkin and Y.-J. Chiang and Joseph S. B. Mitchell and Steven S. Skiena and T. Yang"
, title = "On the Maximum Scatter {TSP}"
, booktitle = "Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
, nickname = "SODA '97"
, year = 1997
, pages = "211--220"
, keywords = "TSP, MAX TSP, bottleneck TSP, approximation algorithms"
, update = "98.03 mitchell"
}
@article{ahms-htfr-96
, author = "Esther M. Arkin and Martin Held and Joseph S. B. Mitchell and Steven S. Skiena"
, title = "Hamiltonian Triangulations for Fast Rendering"
, journal = "Visual Comput."
, volume = 12
, number = 9
, year = 1996
, pages = "429--444"
, keywords = "triangulation, tri-strips, mesh generation, rendering, sequential triangulation, ribbons"
, succeeds = "ahms-htfr-94"
, update = "98.03 mitchell, 97.11 held"
}
@inproceedings{ao-nsu-91
, author = "Boris Aronov and Joseph O'Rourke"
, title = "Nonoverlap of the star unfolding"
, booktitle = "Proc. 7th Annu. ACM Sympos. Comput. Geom."
, year = 1991
, pages = "105--114"
, keywords = "polytopes, shortest paths, Voronoi diagrams, edge sequences"
, cites = "ao-nsu-91t, aaos-supa-90, aaos-supa-93, a-digdk-55, a-kp-58, b-cs-58, ch-spp-90, k-ccl-67, p-egcs-73, ss-spps-86, ZZZ"
, update = "97.11 bibrelex, 93.05 orourke"
}
@article{a-ptase-98
, author = "Sanjeev Arora"
, title = "Polynomial time approximation schemes for {Euclidean} traveling salesman and other geometric problems"
, journal = "J. Assoc. Comput. Mach."
, volume = 45
, number = 5
, year = 1998
, pages = "753--782"
, update = "01.04 icking, 00.11 smid, 00.07 agarwal"
}
@inproceedings{ah-hgrp-96
, author = "Thomas Auer and Martin Held"
, title = "Heuristics for the Generation of Random Polygons"
, booktitle = "Proc. 8th Canad. Conf. Comput. Geom."
, year = 1996
, pages = "38--43"
, url = "http://www.cosy.sbg.ac.at/~held/papers/cccg96.ps.gz"
, update = "98.11 bibrelex, 98.03 mitchell, 97.03 agarwal, 96.09 held+mitchell"
}
@article{bh-pctmh-01
, author = "G. Barequet and S. Har-Peled"
, title = "Polygon containment and translational min-{Hausdorff}-distance between segment sets are {3SUM}-hard"
, journal = "Internat. J. Comput. Geom. Appl."
, volume = 11
, year = 2001
, pages = "465--474"
, update = "01.11 smid"
}
@article{b-tarts-96
, author = "Alexander I. Barvinok"
, title = "Two Algorithmic Results for the {TSP}"
, journal = "Math. Oper. Res."
, volume = 21
, year = 1996
, pages = "65--84"
, keywords = "MAX TSP, longest cycle, PTAS, approximation scheme"
, update = "98.03 mitchell"
}
@article{bs-dsp1s-80
, author = "J. L. Bentley and J. B. Saxe"
, title = "Decomposable searching problems {I}: {S}tatic-to-dynamic transformations"
, journal = "J. Algorithms"
, volume = 1
, year = 1980
, pages = "301--358"
, succeeds = "sb-tsdsd-79"
, update = "00.11 smid, 96.05 agarwal"
}
@article{bdekms-upcf-03
, AUTHOR = {Marshall Bern and Erik D.~Demaine and David Eppstein and
Eric Kuo and Andrea Mantler and Jack Snoeyink}
, title = "Ununfoldable Polyhedra with Convex Faces"
, journal = "Comput. Geom. Theory Appl."
, VOLUME = 24
, NUMBER = 2
, YEAR = 2003
, PAGES = {51--62}
, comment = {Special issue of selected papers from the 4th CGC
Workshop Computational Geometry, 1999.}
}
@misc{be-ecct-99
, author = "Marshall Bern and D. Eppstein and P. K. Agarwal and N. Amenta and P. Chew and T. Dey and D. P. Dobkin and Herbert Edelsbrunner and C. Grimm and L. J. Guibas and J. Harer and J. Hass and A. Hicks and C. K. Johnson and G. Lerman and D. Letscher and P. Plassmann and E. Sedgwick and Jack Snoeyink and J. Weeks and C. Yap and D. Zorin"
, title = "Emerging Challenges in Computational Topology"
, year = 1999
, note = "Report on an NSF Workshop Computational Topology,
June 11-12, Miami Beach, FL."
, update = "01.07 orourke"
}
@article{bs-pdtcm-98
, author = "Marshall Bern and Amit Sahai"
, title = "Pushing Disks Together -- {The} Continuous-Motion Case"
, journal = "Discrete Comput. Geom."
, volume = 20
, year = 1998
, pages = "499--514"
, update = "01.07 orourke"
}
@inproceedings{bddloorw-uscop-98
, author = "Therese Biedl and Erik D.~Demaine and Martin L.~Demaine and Anna Lubiw and Joseph O'Rourke and Mark Overmars and Steve Robbins and Sue Whitesides"
, title = "Unfolding Some Classes of Orthogonal Polyhedra"
, booktitle = "Proc. 10th Canad. Conf. Comput. Geom."
, year = 1998
, pages = "70--71"
, note = "Full version in {\em Elec. Proc.}:
\url{http://cgm.cs.mcgill.ca/cccg98/proceedings/cccg98-biedl-unfolding.ps.gz}"
, update = "00.03 orourke"
}
@article{bk-bhogd-98
, author = "Therese Biedl and G. Kant"
, title = "A Better Heuristic for Orthogonal Graph Drawings"
, journal = "Comput. Geom. Theory Appl."
, volume = 9
, year = 1998
, pages = "159--180"
, update = "98.03 smid"
}
@inproceedings{b-csrpt-91
, author = "J. Bl{\"o}mer"
, title = "Computing Sums of Radicals in Polynomial Time"
, booktitle = "Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
, year = 1991
, pages = "670--677"
, update = "97.03 gaertner+salinger"
}
@article{bsty-vdhdc-98
, author = "Jean-Daniel Boissonnat and Micha Sharir and Boaz Tagansky and Mariette Yvinec"
, title = "Voronoi Diagrams in Higher Dimensions under Certain Polyhedral Distance Functions"
, journal = "Discrete Comput. Geom."
, volume = 19
, number = 4
, year = 1998
, pages = "473--484"
, succeeds = "bsty-vdhdc-95"
, update = "99.07 devillers, 98.07 devillers+held"
}
@article{bm-ort-04
, author = "P. Bose and P. Morin"
, title = "Online routing in triangulations"
, journal = "SIAM J. Comput."
, volume = 33
, year = 2004
, pages = "937--951"
}
@incollection{bj-dpcho-00
, author = "Gerth St{\o}lting Brodal and Riko Jacob"
, title = "Dynamic Planar Convex Hull with Optimal Query Time and $O(\log n\cdot\log\log n)$ Update Time"
, booktitle = "Proc. 7th Scand. Workshop Algorithm Theory"
, series = "Lecture Notes Comput. Sci."
, volume = 1851
, publisher = "Springer-Verlag"
, year = 2000
, pages = "57--70"
, update = "01.07 orourke"
}
@article{bg-aoscf-95
, author = "H. Br{\"o}nnimann and M. T. Goodrich"
, title = "Almost Optimal Set Covers in Finite {VC}-Dimension"
, journal = "Discrete Comput. Geom."
, volume = 14
, year = 1995
, pages = "263--279"
, update = "96.09 agarwal, 96.05 agarwal"
}
@misc{bikmm-oipcha-01
, author = "Herv{\'e} Br{\"o}nnimann and John Iacono and Jryki Katajainen and Pat Morin and Jason Morrison"
, title = "Optimal In-Place Planar Convex Hull Algorithms"
, howpublished = "11th Annu. Fall Workshop Comput. Geom."
, year = 2001
, note = "\url{http://geometry.poly.edu/cgwpapers/}"
, url = "http://geometry.poly.edu/cgwpapers/hbr\_inplace.ps"
, update = "02.03 orourke"
}
@article{bfms-secsb-00
, author = "C. Burnikel and R. Fleischer and K. Mehlhorn and S. Schirra"
, title = "A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Radicals"
, journal = "Algorithmica"
, volume = 27
, number = 1
, year = 2000
, pages = "87--99"
, update = "00.11 smid, 00.07 held"
}
@article{ck-dmpsa-95
, author = "P. B. Callahan and S. Rao Kosaraju"
, title = "A decomposition of multidimensional point sets with applications to $k$-nearest-neighbors and $n$-body potential fields"
, journal = "J. Assoc. Comput. Mach."
, volume = 42
, year = 1995
, pages = "67--90"
, update = "96.05 smid"
}
@article{c-aidp-96
, author = "V. Capoyleas"
, title = "On the area of the intersection of disks in the plane"
, journal = "Comput. Geom. Theory Appl."
, volume = 6
, year = 1996
, pages = "393--396"
, update = "97.03 devillers"
}
@inproceedings{c-dpcho-99
, author = "Timothy M. Chan"
, title = "Dynamic planar convex hull operations in near-logarithmic amortized time"
, booktitle = "Proc. 40th Annu. IEEE Sympos. Found. Comput. Sci."
, nickname = "FOCS '99"
, year = 1999
, pages = "92--99"
, update = "00.03 smid"
}
@inproceedings{c-lac-00
, author = "Timothy M. Chan"
, title = "On Levels in Arrangements of Curves"
, booktitle = "Proc. 41th Annu. IEEE Sympos. Found. Comput. Sci."
, nickname = "FOCS 2000"
, year = 2000
, pages = "219--227"
, update = "01.11 pocchiola"
}
@article{c-osrch-96
, author = "Timothy M. Chan"
, title = "Output-Sensitive Results on Convex Hulls, Extreme Points, and Related Problems"
, journal = "Discrete Comput. Geom."
, volume = 16
, year = 1996
, pages = "369--387"
, update = "98.03 agarwal+smid"
}
@article{cc-apcmn-96
, author = "W. S. Chan and F. Chin"
, title = "Approximation of Polygonal Curves with Minimum Number of Line Segments or Minimum error"
, journal = "Internat. J. Comput. Geom. Appl."
, volume = 6
, year = 1996
, pages = "59--77"
, succeeds = "cc-apcmn-92"
, update = "96.09 devillers"
}
@inproceedings{c-fdams-97
, author = "Bernard Chazelle"
, title = "A Faster Deterministic Algorithm for Minimum Spanning Trees"
, booktitle = "Proc. 38th Annu. IEEE Sympos. Found. Comput. Sci."
, nickname = "FOCS '97"
, year = 1997
, pages = "22--31"
, update = "98.07 bibrelex, 98.03 mitchell"
}
@techreport{c-tbsns-88
, author = "Bernard Chazelle"
, title = "Tight bounds on the stabbing number of spanning trees in {Euclidean} space"
, type = "Report"
, number = "CS-TR-155-88"
, institution = "Dept. Comput. Sci., Princeton Univ."
, address = "Princeton, NJ"
, year = 1988
, update = "98.03 mitchell"
}
@article{c-tsplt-91a
, author = "Bernard Chazelle"
, title = "Triangulating a simple polygon in linear time"
, journal = "Discrete Comput. Geom."
, volume = 6
, number = 5
, year = 1991
, pages = "485--524"
, succeeds = "c-tsplt-90i"
, update = "98.11 bibrelex, 98.03 mitchell"
}
@inproceedings{cl-qrsam-98
, author = "Siu-Wing Cheng and Kam-Hing Lee"
, title = "Quadtree Decomposition, {S}teiner Triangulation, and Ray Shooting"
, booktitle = "ISAAC: 9th Internat. Sympos. Algorithms Computation"
, year = 1998
, pages = "367--376"
, url = "citeseer.nj.nec.com/cheng98quadtree.html"
, update = "01.07 orourke"
}
@article{c-tapga-89
, author = "L. P. Chew"
, title = "There are planar graphs almost as good as the complete graph"
, journal = "J. Comput. Syst. Sci."
, volume = 39
, year = 1989
, pages = "205--219"
, succeeds = "c-tipga-86"
}
@article{cegsw-ccbac-90
, author = "K. Clarkson and Herbert Edelsbrunner and Leonidas J. Guibas and Micha Sharir and Emo Welzl"
, title = "Combinatorial complexity bounds for arrangements of curves and spheres"
, journal = "Discrete Comput. Geom."
, volume = 5
, year = 1990
, pages = "99--160"
, keywords = "arrangements, complexity of faces, combinatorial geometry"
, succeeds = "cegsw-ccbac-88"
, update = "98.03 mitchell"
}
@book{cfg-upg-90
, author = "H. P. Croft and K. J. Falconer and R. K. Guy"
, title = "Unsolved Problems in Geometry"
, publisher = "Springer-Verlag"
, year = 1990
}
@article{dg-ocop3-97a
, author = "G. Das and M. T. Goodrich"
, title = "On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees"
, journal = "Comput. Geom. Theory Appl."
, volume = 8
, year = 1997
, pages = "123--137"
, update = "98.03 smid"
}
@article{d-ibpks-98
, author = "T. K. Dey"
, title = "Improved bounds on planar $k$-sets and related problems"
, journal = "Discrete Comput. Geom."
, volume = 19
, year = 1998
, pages = "373--382"
, update = "98.07 agarwal"
}
@inproceedings{dmm-naefm-95
, author = "Matthew T. Dickerson and Scott A. McElfresh and Mark H. Montague"
, title = "New Algorithms and Empirical Findings on Minimum Weight Triangulation Heuristics"
, booktitle = "Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year = 1995
, pages = "238--247"
, keywords = "greedy triangulation, experimental"
, cites = "bs-plibp-94, bsw-cffrn-77, ddmw-fgta-94, dm-fnalm-94, dra-sltgt-95, g-nrpt-79, g-segta-89, hp-nrmwt-94, k-mtpd-80, ll-fagt-92, l-nhmwt-87, l-gtcbe-89, l-tspp-77, mz-ngndt-79, mz-pmhfa-83, o-cgc-94, w-eucdt-93, w-oagts-94, wa-srr3d-86, y-cdcrc-75, ZZZ"
, update = "98.11 bibrelex, 98.03 bibrelex, 97.03 schwarzkopf, 95.09 mitchell"
}
@article{d-lbss-89
, author = "M. Dietzfelbinger"
, title = "Lower Bounds for Sorting of Sums"
, journal = "Theoret. Comput. Sci."
, volume = 66
, year = 1989
, pages = "137--155"
, keywords = "lower bounds, comparison trees, sorting {$X+Y$}"
, update = "93.09 erickson"
}
@article{dfs-dgaag-90
, author = "D. P. Dobkin and S. J. Friedman and K. J. Supowit"
, title = "Delaunay graphs are almost as good as complete graphs"
, journal = "Discrete Comput. Geom."
, volume = 5
, year = 1990
, pages = "399--407"
, succeeds = "dfs-dgaag-87"
}
@book{d-pm-1525
, author = "Albrecht D{\"u}rer"
, title = "The painter's manual: {A} manual of measurement of lines, areas, and solids by means of compass and ruler assembled by Albrecht D{\"u}rer for the use of all lovers of art with appropriate illustrations arranged to be printed in the year MDXXV"
, publisher = "New York: Abaris Books, 1977"
, year = 1525
, note = "English translation by Walter L.~Strauss
of `Unterweysung der Messung mit dem Zirkel un Richtscheyt in Linien Ebnen uhnd Gantzen Corporen'"
, comments = "Found by Marty Demaine.
Contains unfoldings of convex polyhedra."
}
@article{d-ltatt-84
, author = "M. E. Dyer"
, title = "Linear time algorithms for two- and three-variable linear programs"
, journal = "SIAM J. Comput."
, volume = 13
, year = 1984
, pages = "31--45"
, keywords = "linear programming"
}
@article{epw-tpstd-90
, author = "Herbert Edelsbrunner and F. P. Preparata and D. B. West"
, title = "Tetrahedrizing Point Sets in Three Dimensions"
, journal = "J. Symbolic Comput."
, volume = 10
, number = "3--4"
, year = 1990
, pages = "335--347"
, succeeds = "epw-tpstd-86"
, update = "97.11 bibrelex"
}
@article{es-cufop-00
, author = "A. Efrat and Micha Sharir"
, title = "On the Complexity of the Union of Fat Objects in the Plane"
, journal = "Discrete Comput. Geom."
, volume = 23
, year = 2000
, pages = "171--189"
, update = "01.07 orourke"
}
@article{e-amwst-94
, author = "D. Eppstein"
, title = "Approximating the minimum weight {Steiner} triangulation"
, journal = "Discrete Comput. Geom."
, volume = 11
, year = 1994
, pages = "163--191"
, succeeds = "e-amwt-92"
, update = "96.09 aronov"
}
@inproceedings{e-lchmg-96
, author = "David Eppstein"
, title = "Linear Complexity Hexahedral Mesh Generation"
, booktitle = "Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year = 1996
, pages = "58--67"
, cites = "bpmcs-cahat-95, b-ct-93, be-mgot-95, cs-bst-94, h-mgasi-83, h-srcc-95, jsk-actfm-91, bbmmt-hmgd-95, m-cqmsw-95, rrt-ctq-95, s-op-, t-hdp-93, ZZZ"
, update = "97.11 bibrelex, 96.05 efrat"
}
@article{e-sdnp-46
, author = "P. Erd{\H o}s"
, title = "On sets of distances of $n$ points"
, journal = "Amer. Math. Monthly"
, volume = 53
, year = 1946
, pages = "248--250"
, keywords = "combinatorial geometry, number theory, unit distances"
, update = "02.03 orourke"
}
@article{e-sdnpe-60
, author = "P. Erd{\H o}s"
, title = "On sets of distances of $n$ points in {Euclidean} space"
, journal = "Publications Mathematical Institute of Hungarian Academy of Sciences"
, volume = 5
, year = 1960
, pages = "165--169"
, keywords = "combinatorial geometry, number theory, unit distance"
}
@article{e-nlbch-99
, author = "Jeff Erickson"
, title = "New Lower Bounds for Convex Hull Problems in Odd Dimensions"
, journal = "SIAM J. Comput."
, volume = 28
, year = 1999
, pages = "1198--1214"
, update = "99.11 smid"
}
@article{es-blbda-95
, author = "Jeff Erickson and R. Seidel"
, title = "Better lower bounds on detecting affine and spherical degeneracies"
, journal = "Discrete Comput. Geom."
, volume = 13
, year = 1995
, pages = "41--57"
, succeeds = "es-blbda-93t"
, update = "98.11 bibrelex, 97.11 bibrelex, 96.05 smid"
}
@article{eoux-ipvf-95
, author = "V. Estivill-Castro and Joseph O'Rourke and J. Urrutia and D. Xu"
, title = "Illumination of polygons with vertex floodlights"
, journal = "Inform. Process. Lett."
, volume = 56
, year = 1995
, pages = "9--13"
, keywords = "visibility, floodlights"
, succeeds = "eoux-ipvf-94"
, update = "96.01 orourke"
}
@techreport{f-shmts-98
, author = "S{\'a}ndor P. Fekete"
, title = "Simplicity and Hardness of the Maximum Traveling Salesman Problem under Geometric Distances"
, type = "Manuscript (submitted)"
, institution = "Mathematisches Institut, Universit{\"a}t zu K{\"o}ln"
, year = 1998
, keywords = "geometric optimization, complexity, Traveling Salesman Problem"
, update = "98.07 mitchell"
}
@article{fpt-opcpa-81
, author = "R. J. Fowler and M. S. Paterson and S. L. Tanimoto"
, title = "Optimal packing and covering in the plane are {NP}-complete"
, journal = "Inform. Process. Lett."
, volume = 12
, number = 3
, year = 1981
, pages = "133--137"
}
@article{fpp-hdpgg-90
, author = "H. de Fraysseix and J. Pach and R. Pollack"
, title = "How to Draw a Planar Graph on a Grid"
, journal = "Combinatorica"
, volume = 10
, number = 1
, year = 1990
, pages = "41--51"
, keywords = "graph drawing"
, update = "98.07 tamassia, 93.09 tamassia"
}
@article{f-hgiit-76
, author = "M. L. Fredman"
, title = "How good is the information theory bound in sorting?"
, journal = "Theoret. Comput. Sci."
, volume = 1
, year = 1976
, pages = "355--361"
, update = "93.09 erickson"
}
@article{go-copcg-95
, author = "A. Gajentaan and M. H. Overmars"
, title = "On a class of ${O}(n^2)$ problems in computational geometry"
, journal = "Comput. Geom. Theory Appl."
, volume = 5
, year = 1995
, pages = "165--185"
, succeeds = "go-nhpcg-93t"
, update = "99.07 smid, 98.11 bibrelex, 96.01 smid"
}
@book{gj-cigtn-79
, author = "M. R. Garey and D. S. Johnson"
, title = "Computers and Intractability: {A} Guide to the Theory of {NP}-Completeness"
, publisher = "W. H. Freeman"
, address = "New York, NY"
, year = 1979
, keywords = "NP-completeness"
}
@inproceedings{gkms-lbrad-96
, author = "Dima Grigoriev and Marek Karpinski and {Friedhelm Meyer auf der Heide} and Roman Smolensky"
, title = "A Lower Bound for Randomized Algebraic Decision Trees"
, booktitle = "Proc. 28th Annu. ACM Sympos. Theory Comput."
, year = 1996
, pages = "612--619"
, update = "01.07 orourke"
}
@inproceedings{b-foais-96
, author = "A. {Hern{\'a}ndez Barrera}"
, title = "Finding an {$o(n^2 \log n)$} algorithm is sometimes hard"
, booktitle = "Proc. 8th Canad. Conf. Comput. Geom."
, publisher = "Carleton University Press, Ottawa, Canada"
, year = 1996
, pages = "289--294"
, update = "96.09 mitchell"
}
@inproceedings{hs-oidpa-94
, author = "J. Hershberger and Jack Snoeyink"
, title = "An ${O}(n \log n)$ Implementation of the {Douglas}-{Peucker} Algorithm for Line Simplification"
, booktitle = "Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year = 1994
, pages = "383--384"
, keywords = "video review"
, cites = "b-tcl-85, dghs-eafcr-93, dp-arnpr-73, hs-sudpl-92, m-samml-86, m-alg-87, m-olcch-87, r-ippap-, r-qcsaa-90, w-algau-85, ZZZ"
, update = "98.03 bibrelex, 94.09 jones"
}
@article{hs-oaesp-99
, author = "John Hershberger and Subhash Suri"
, title = "An optimal algorithm for {Euclidean} shortest paths in the plane"
, journal = "SIAM J. Comput."
, volume = 28
, number = 6
, year = 1999
, pages = "2215--2256"
, update = "01.07 orourke"
}
@article{hs-asdch-92
, author = "J. Hershberger and S. Suri"
, title = "Applications of a semi-dynamic convex hull algorithm"
, journal = "BIT"
, volume = 32
, year = 1992
, pages = "249--267"
, update = "98.03 bibrelex"
}
@article{hm-ascpp-85
, author = "D. S. Hochbaum and W. Maas"
, title = "Approximation schemes for covering and packing problems in image processing and {VLSI}"
, journal = "J. Assoc. Comput. Mach."
, volume = 32
, year = 1985
, pages = "130--136"
, update = "96.09 orourke"
}
@article{ips-hpgg-82
, author = "A. Itai and C. H. Papadimitriou and J. L. Szwarcfiter"
, title = "Hamilton paths in grid graphs"
, journal = "SIAM J. Comput."
, volume = 11
, year = 1982
, pages = "676--686"
, update = "95.09 mitchell"
}
@article{j-ctddt-91
, author = "B. Joe"
, title = "Construction of Three-Dimensional {Delaunay} Triangulations Using Local Transformations"
, journal = "Comput. Aided Geom. Design"
, volume = 8
, number = 2
, month = may
, year = 1991
, pages = "123--142"
, update = "93.09 held"
}
@article{kmm-eaesp-97
, author = "S. Kapoor and S. N. Maheshwari and Joseph S. B. Mitchell"
, title = "An Efficient Algorithm for {Euclidean} Shortest Paths among Polygonal Obstacles in the Plane"
, journal = "Discrete Comput. Geom."
, volume = 18
, year = 1997
, pages = "377--383"
, succeeds = "m-esppo-94, km-eaesp-94"
, update = "98.03 mitchell"
, annote = "Gives an $O(n+ h^2\log n)$ algorithm for shortest paths"
}
@article{k-nptal-84a
, author = "N. Karmarkar"
, title = "A new polynomial-time algorithm for linear programming"
, journal = "Combinatorica"
, volume = 4
, year = 1984
, pages = "373--395"
, succeeds = "k-nptal-84i"
}
@article{kg-cgwac-92
, author = "J. M. Keil and C. A. Gutwin"
, title = "Classes of graphs which approximate the complete {Euclidean} graph"
, journal = "Discrete Comput. Geom."
, volume = 7
, year = 1992
, pages = "13--28"
}
@article{k-palp-80
, author = "L. G. Khachiyan"
, title = "Polynomial algorithm in linear programming"
, journal = "U.S.S.R. Comput. Math. and Math. Phys."
, volume = 20
, year = 1980
, pages = "53--72"
, update = "95.09 devillers"
}
@article{kry-ldsts-96
, author = "S. Khuller and B. Raghavachari and N. Young"
, title = "Low-degree spanning trees of small weight"
, journal = "SIAM J. Comput."
, volume = 25
, year = 1996
, pages = "355--368"
, update = "96.05 smid"
}
@incollection{k-p-97
, author = "David A. Klarner"
, title = "Polyominoes"
, chapter = 12
, editor = "Jacob E. Goodman and Joseph O'Rourke"
, booktitle = "Handbook of Discrete and Computational Geometry"
, publisher = "CRC Press LLC"
, address = "Boca Raton, FL"
, year = 1997
, pages = "225--242"
, update = "97.11 orourke"
}
@inproceedings{k-atubv-01
, author = "Vladlen Koltun"
, title = "Almost Tight Upper Bounds for Vertical Decompositions in Four Dimensions"
, booktitle = "Proc. 42nd Annu. IEEE Sympos. Found. Comput. Sci."
, year = 2001
, update = "01.07 orourke"
}
@inproceedings{lk-qgtam-96
, author = "Christos Levcopoulos and Drago Krznaric"
, title = "Quasi-greedy triangulations approximating the minimum weight triangulation"
, booktitle = "Proc. 7th ACM-SIAM Sympos. Discrete Algorithms"
, year = 1996
, pages = "392--401"
, keywords = "greedy triangulation, approximation of MWT"
, update = "96.09 agarwal, 96.01 mitchell"
}
@inproceedings{l-tspp-77
, author = "Errol Lynn Lloyd"
, title = "On triangulations of a set of points in the plane"
, booktitle = "Proc. 18th Annu. IEEE Sympos. Found. Comput. Sci."
, year = 1977
, pages = "228--240"
, url = "http://portal.acm.org/citation.cfm?id=1382557"
}
@inproceedings{lps-ctc-95
, author = "L{\'a}szl{\'o} Lov{\'a}sz and J{\'a}nos Pach and Mario Szegedy"
, title = "On Conway's Thrackle Conjecture"
, booktitle = "Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year = 1995
, pages = "147--151"
, keywords = ""
, cites = "bf-lamcp-88, b-siec-69, be-cp-48, dett-adgab-94, fs-lda1-35, f-edpsp-40, gj-cninc-83, g-lsh-75, g-tsdg-93, g-cng-72, hp-an1-34, kst-pkz-54, lst-gbtsh-95, pa-cg-95, prs-crtcs-94, prs-pnmcs-91, rsp-sbmc-91, t-nw-77, t-ttcn-70, wb-tgt-78, w-td-69, w-op-72, ZZZ"
, update = "98.03 bibrelex, 97.11 icking, 95.09 mitchell"
}
@article{msw-sblp-96
, author = "J. Matou{\v s}ek and Micha Sharir and Emo Welzl"
, title = "A subexponential bound for linear programming"
, journal = "Algorithmica"
, volume = 16
, year = 1996
, pages = "498--516"
, update = "98.03 mitchell, 97.03 agarwal+smid"
}
@article{m-ibeap-82
, author = "N. Megiddo"
, title = "Is binary encoding appropriate for the problem-language relationship?"
, journal = "Theoret. Comput. Sci."
, volume = 19
, year = 1982
, pages = "337--341"
, keywords = "computational model"
}
@article{m-lpltw-84
, author = "N. Megiddo"
, title = "Linear programming in linear time when the dimension is fixed"
, journal = "J. Assoc. Comput. Mach."
, volume = 31
, year = 1984
, pages = "114--127"
, keywords = "design of algorithms, linear programming, worst-case analysis, prune-and-search"
}
@article{m-tgpal-83
, author = "N. Megiddo"
, title = "Towards a genuinely polynomial algorithm for linear programming"