-
Notifications
You must be signed in to change notification settings - Fork 2
/
compgeom.bib
1604 lines (1465 loc) · 51.6 KB
/
compgeom.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
%% This BibTeX bibliography file was created using BibDesk.
%% http://bibdesk.sourceforge.net/
%% Created for Jeff Erickson at 2021-11-26 15:18:58 -0600
%% Saved with string encoding Unicode (UTF-8)
@article{ks-tbcds-02,
author = {Keil, Mark and Snoeyink, Jack},
date-added = {2021-11-26 15:15:40 -0600},
date-modified = {2021-11-26 15:15:40 -0600},
doi = {10.1142/S0218195902000803},
journal = {Int. J. Comput. Geom. Appl.},
number = {3},
pages = {181--192},
title = {On the time bound for convex decomposition of simple polygons},
volume = {12},
year = {2002},
bdsk-url-1 = {https://doi.org/10.1142/S0218195902000803}}
@article{k-dpisc-85,
author = {Keil, Mark},
date-added = {2021-11-26 15:15:40 -0600},
date-modified = {2021-11-26 15:15:40 -0600},
doi = {10.1137/0214056},
journal = {{SIAM} J. Comput.},
number = {4},
pages = {799--814},
title = {Decomposing a Polygon into Simpler Components},
volume = {14},
year = {1985},
bdsk-url-1 = {https://doi.org/10.1137/0214056}}
@incollection{cd-ocd-85,
author = {Chazelle, Bernard and Dobkin, David},
booktitle = {Computational Geometry},
date-added = {2021-11-26 15:15:40 -0600},
date-modified = {2021-11-26 15:15:40 -0600},
doi = {10.1016/B978-0-444-87806-9.50009-8},
editor = {Toussaint, Godfried T.},
number = {2},
pages = {63--133},
publisher = {Elsevier},
series = {Machine Intelligence and Pattern Recognition},
title = {Optimal Convex Decompositions},
year = {1985},
bdsk-url-1 = {https://doi.org/10.1016/B978-0-444-87806-9.50009-8}}
@inproceedings{cd-dpicp-79,
author = {Chazelle, Bernard and Dobkin, David},
booktitle = {Proc. 11th Ann. ACM Symp. Theory Comput.},
date-added = {2021-11-26 15:15:40 -0600},
date-modified = {2021-11-26 15:15:40 -0600},
doi = {10.1145/800135.804396},
pages = {38--48},
title = {Decomposing a polygon into its convex parts},
year = {1979},
bdsk-url-1 = {https://doi.org/10.1145/800135.804396}}
@phdthesis{c-cgc-80,
author = {Chazelle, Bernard Marie},
date-added = {2021-11-26 15:15:40 -0600},
date-modified = {2021-11-26 15:15:40 -0600},
note = {Technical Report CMU-CS-80150, Carnegie Mellon Univ.},
school = {Yale Univ.},
title = {Computational Geometry and Convexity},
url = {https://www.cs.princeton.edu/~chazelle/pubs/PhD.pdf},
year = {1980},
bdsk-url-1 = {https://www.cs.princeton.edu/~chazelle/pubs/PhD.pdf}}
@article{hm-ftpwr-85,
author = {Hertel, Stefan and Mehlhorn, Kurt},
comments = {4-approx optimal convex decomposition (via diagonals)},
date-added = {2021-11-26 15:15:40 -0600},
date-modified = {2021-11-26 15:15:40 -0600},
doi = {10.1016/S0019-9958(85)80044-9},
journal = {Inf. Control},
number = {1--3},
pages = {52--76},
title = {Fast triangulation of the plane with respect to simple polygons},
volume = {64},
year = {1985},
bdsk-url-1 = {https://doi.org/10.1016/S0019-9958(85)80044-9}}
@incollection{g-dpicp-83,
author = {Greene, Daniel H.},
booktitle = {Computational Geometry},
comments = {Convex decomposition via diagonals in O(n^2 r^2) time; 4-approx via triangulation. No online version, publisher out of business.},
date-added = {2021-11-26 15:15:40 -0600},
date-modified = {2021-11-26 15:18:58 -0600},
editor = {Preparata, Franco P.},
publisher = {JAI Press},
series = {Advances in Computing Research},
title = {The decomposition of polygons into convex parts},
volume = {1},
year = {1983}}
@article{iim-vdlga-85,
author = {Imai, Hiroshi and Iri, Masao and Murota, Kazuo},
date-added = {2020-07-26 09:17:38 -0500},
date-modified = {2020-07-26 09:19:05 -0500},
doi = {doi.org/10.1137/0214006},
journal = {SIAM J. Comput.},
keywords = {power diagram},
number = {1},
pages = {93--105},
title = {Voronoi diagram in the {Laguerre} geometry and its applications},
volume = {14},
year = {1985},
bdsk-url-1 = {https://doi.org/10.1137/0214006}}
@article{m-dspce-94,
author = {McMullen, Peter},
date-added = {2020-07-23 12:27:54 -0500},
date-modified = {2020-07-23 12:28:37 -0500},
journal = {Geom. Dedicata},
pages = {183--202},
title = {Duality, sections and projections of certain {Euclidean} tilings},
volume = {49},
year = {1994}}
@incollection{m-cvdsp-98,
address = {Kyiv},
arxiv = {math/0312052},
author = {Musin, Oleg R.},
booktitle = {Voronoi's Impact on Modern Science},
date-added = {2020-07-18 18:43:45 -0500},
date-modified = {2020-07-18 18:49:31 -0500},
editor = {Engel, Peter and Syta, Halyna},
pages = {105--114},
publisher = {Institute of Mathematics of the National Academy of Sciences of Ukraine},
title = {Construction of the {Voronoi} diagram and secondary polytope},
update = {00.11 smid},
volume = {2},
year = {1998}}
@inproceedings{m-pdt-97,
author = {Musin, Oleg R.},
booktitle = {Proc. 13th Ann. Symp. Comput. Geom.},
date-added = {2020-07-18 18:30:03 -0500},
date-modified = {2020-07-18 18:38:35 -0500},
doi = {10.1145/262839.263061},
pages = {424--426},
title = {Properties of the {Delaunay} Triangulation},
year = {1997},
bdsk-url-1 = {https://doi.org/10.1145/262839.263061}}
@article{egmn-vfmdtp-17,
author = {Edelsbrunner, Herbert and Glazyrin, Alexey and Musin, Oleg R. and Nikitenko, Anton},
date-added = {2020-07-18 18:28:03 -0500},
date-modified = {2020-07-18 18:29:33 -0500},
doi = {10.1007/s00493-016-3308-y},
journal = {Combinatorica},
number = {5},
pages = {887--910},
title = {The {Voronoi} functional is maximized by the {Delaunay} triangulation in the plane},
volume = {37},
year = {2017},
bdsk-url-1 = {https://doi.org/10.1007/s00493-016-3308-y}}
@article{v-napct3-09,
author = {Vorono{\"\i}, Georges F.},
date-added = {2020-07-18 17:25:20 -0500},
date-modified = {2020-07-18 17:25:50 -0500},
journal = {J.~Reine Angew. Math.},
pages = {67--182},
title = {Nouvelles applications des param{\`e}tres continus {\`a} la th{\'e}orie des formes quadratiques. {Deuxi{\`e}me} m{\'e}moire. {Recherches} sur les parall{\'e}llo{\`e}dres primitifs.},
url = {https://eudml.org/doc/149311},
volume = {136},
year = {1909},
bdsk-url-1 = {http://eudml.org/doc/149276}}
@article{v-napct2-08,
author = {Vorono{\"\i}, Georges F.},
comments = {paraboloid lifting map},
date-added = {2020-07-18 17:23:45 -0500},
date-modified = {2020-07-18 17:35:43 -0500},
journal = {J.~Reine Angew. Math.},
pages = {198--287},
title = {Nouvelles applications des param{\`e}tres continus {\`a} la th{\'e}orie des formes quadratiques. {Deuxi{\`e}me} m{\'e}moire. {Recherches} sur les parall{\'e}llo{\`e}dres primitifs.},
url = {https://eudml.org/doc/149291},
volume = {134},
year = {1908},
bdsk-url-1 = {http://eudml.org/doc/149276}}
@article{v-napct1-08,
author = {Vorono{\"\i}, Georges F.},
date-added = {2020-07-18 17:15:03 -0500},
date-modified = {2020-07-18 17:23:31 -0500},
journal = {J.~Reine Angew. Math.},
pages = {97--178},
title = {Nouvelles applications des param{\`e}tres continus {\`a} la th{\'e}orie des formes quadratiques. {Premier} m{\'e}moire. {Sur} quelques propri{\'e}t{\'e}s des formes quadratiques positives parfaites},
url = {http://eudml.org/doc/149276},
volume = {133},
year = {1908},
bdsk-url-1 = {http://eudml.org/doc/149276}}
@article{degm-ftds-14,
author = {Dolbilin, Nikolai P. and Edelsbrunner, Herbert and Glazyrin, Alexey and Musin, Oleg R.},
comments = {Any functional that is optimal for finite Delaunay triangulations is also optimal for infinite Delaunay triangulations},
date-added = {2020-07-18 17:07:14 -0500},
date-modified = {2020-07-18 17:12:04 -0500},
journal = {Moscow Math. J.},
number = {3},
pages = {491--504},
title = {Functionals on triangulations of {Delaunay} sets},
url = {http://www.mathjournals.org/mmj/2014-014-003/2014-014-003-003.html},
volume = {14},
year = {2014},
bdsk-url-1 = {http://www.mathjournals.org/mmj/2014-014-003/2014-014-003-003.html}}
@book{drs-tsaa-10,
author = {De Loera, Jes{\'u}s and Rambau, J{\"o}rg and Santos, Francisco},
date-added = {2019-12-04 12:54:37 -0600},
date-modified = {2019-12-04 13:04:40 -0600},
doi = {10.1007/978-3-642-12971-1},
number = {25},
publisher = {Springer},
series = {Algorithms and Computation in Mathematics},
title = {Triangulations: Structures for Algorithms and Applications},
year = {2010},
bdsk-url-1 = {https://doi.org/10.1007/978-3-642-12971-1}}
@article{l-tt-72,
author = {Lawson, Charles L.},
date-added = {2019-12-04 12:51:03 -0600},
date-modified = {2019-12-04 12:51:50 -0600},
doi = {10.1016/0012-365X(72)90093-3},
journal = {Discrete Math.},
number = {4},
pages = {365--372},
title = {Transforming triangulations},
volume = {3},
year = {1972},
bdsk-url-1 = {https://doi.org/10.1016/0012-365X(72)90093-3}}
@article{ai-gravd-88,
author = {Aurenhammer, Franz and Imai, Hiroshi},
date-added = {2019-12-04 12:48:16 -0600},
date-modified = {2019-12-04 12:49:17 -0600},
doi = {10.1007/BF00181613},
journal = {Geom. Dedicata},
number = {1},
pages = {65--75},
title = {Geometric relations among {Voronoi} diagrams},
volume = {27},
year = {1988},
bdsk-url-1 = {https://doi.org/10.1007/BF00181613}}
@inproceedings{aam-gpe-18,
arxiv = {1704.06969},
author = {Abrahamsen, Mikkel and Adamaszek, Anna and Miltzow, Tillmann},
booktitle = {Proc. 50th Ann. ACM Symp. Theory Comput.},
date-added = {2019-08-10 15:54:15 -0500},
date-modified = {2019-08-10 15:56:13 -0500},
doi = {10.1145/3188745.3188868},
pages = {65--73},
read = {1},
title = {The art gallery problem is {$\exists\mathbb{R}$}-complete},
year = {2018},
bdsk-url-1 = {https://doi.org/10.1145/3188745.3188868}}
@article{b-vdch-79,
author = {Brown, Kevin Q.},
date-added = {2019-03-21 09:34:19 +0100},
date-modified = {2019-03-21 09:34:55 +0100},
doi = {10.1016/0020-0190(79)90074-7},
journal = {Inform. Process. Lett.},
number = {5},
pages = {223--228},
title = {Voronoi diagrams from convex hulls},
volume = {9},
year = {1979},
bdsk-url-1 = {https://doi.org/10.1016/0020-0190(79)90074-7}}
@article{a-pdpaa-87,
author = {Aurenhammer, Franz},
date-added = {2019-03-21 09:30:38 +0100},
date-modified = {2019-12-04 12:46:31 -0600},
doi = {10.1137/0216006},
journal = {SIAM J. Comput.},
number = {1},
pages = {78--96},
title = {Power diagrams: {Properties}, algorithms and applications},
volume = {16},
year = {1987},
bdsk-url-1 = {https://doi.org/10.1137/0216006}}
@article{es-vda-86,
author = {Edelsbrunner, Herbert and Seidel, Raimund},
date-added = {2019-03-14 16:06:54 +0100},
date-modified = {2019-03-14 16:07:31 +0100},
doi = {10.1007/BF02187681},
journal = {Discrete Comput. Geom.},
number = {1},
pages = {25--44},
title = {Voronoi diagrams and arrangements},
volume = {1},
year = {1986},
bdsk-url-1 = {https://doi.org/10.1007/BF02187681}}
@article{b-cccda-94,
author = {Brandt, Jonathan W.},
date-added = {2018-12-05 12:04:53 -0600},
date-modified = {2018-12-05 12:06:05 -0600},
doi = {10.1006/ciun.1994.1007},
journal = {CVGIP: Image Understanding},
number = {1},
pages = {116--124},
title = {Convergence and continuity criteria for discrete approximations of the continuous planar skeletons},
volume = {59},
year = {1994},
bdsk-url-1 = {https://doi.org/10.1006/ciun.1994.1007}}
@article{r-odtr-94,
author = {Rajan, V. T.},
comments = {Vadakkedathu Thomas Rajan},
date-added = {2018-05-02 23:35:04 +0000},
date-modified = {2020-07-17 14:37:16 -0500},
doi = {10.1007/BF02574375},
journal = {Discrete Comput. Geom.},
number = {2},
pages = {189--202},
read = {1},
title = {Optimality of the {Delaunay} Triangulation in {$\mathbb{R}^d$}},
volume = {12},
year = {1994},
bdsk-url-1 = {https://doi.org/10.1007/BF02574375}}
@article{dg-cop3d-97,
author = {Das, Gautam and Goodrich, Michael T.},
date-added = {2017-10-15 16:26:47 +0000},
date-modified = {2017-10-15 16:27:52 +0000},
doi = {10.1016/S0925-7721(97)00006-0},
journal = {Comput. Geom. Theory Appl.},
number = {3},
pages = {123--137},
read = {1},
title = {On the complexity of optimization problems for 3-dimensional convex polyhedra and decisiosn trees},
volume = {8},
year = {1997},
bdsk-url-1 = {https://doi.org/10.1016/S0925-7721(97)00006-0}}
@article{g-pmcbh-60,
author = {Gr{\"u}nbaum, Branko},
comments = {Claims Theorem 2 independently proved by Preston C. Hammer, whose proof was apparently never published},
date-added = {2017-08-10 19:51:23 +0000},
date-modified = {2017-08-10 20:12:17 +0000},
doi = {10.2140/pjm.1960.10.1257},
journal = {Pacific J. Math.},
keywords = {any halfspace containing the centroid of convex body B contains at least 1/e of B's volume},
number = {4},
pages = {1257--1261},
title = {Partitions of mass-distributions and convex bodies by hyperplanes},
volume = {10},
year = {1960},
bdsk-url-1 = {http://dx.doi.org/10.2140/pjm.1960.10.1257}}
@article{m-lpltw-84,
author = {Megiddo, Nimrod},
date-added = {2017-08-10 16:49:16 +0000},
date-modified = {2017-08-10 16:50:37 +0000},
doi = {10.1145/2422.322418},
journal = {J. Assoc. Comput. Machinery},
keywords = {design of algorithms, linear programming, worst-case analysis, prune-and-search},
number = {1},
pages = {114--127},
title = {Linear programming in linear time when the dimension is fixed},
volume = {31},
year = {1984},
bdsk-url-1 = {http://dx.doi.org/10.1145/2422.322418}}
@article{is-scpzs-90,
author = {Iwano, Kazuo and Steiglitz, Kenneth},
comments = {zero-sum cycles for 2d-weighted graphs via Kleene's algorithm},
date-added = {2017-08-08 16:37:02 +0000},
date-modified = {2017-08-08 16:42:36 +0000},
doi = {10.1137/0219061},
journal = {SIAM J. Comput.},
number = {5},
pages = {883--901},
read = {1},
title = {A semiring on convex polygons and zero-sum cycle problems},
volume = {19},
year = {1990},
bdsk-url-1 = {http://dx.doi.org/10.1137/0219061}}
@article{ce-oails-92,
author = {Chazelle, Bernard and Edelsbrunner, Herbert},
date-added = {2016-07-14 18:19:48 +0000},
date-modified = {2016-07-14 18:20:10 +0000},
journal = {J. ACM},
number = 1,
pages = {1--54},
title = {An optimal algorithm for intersecting line segments in the plane},
volume = {39},
year = {1992}}
@article{m-fppa-90,
author = {Mulmuley, Ketan},
date-added = {2016-07-14 18:09:21 +0000},
date-modified = {2016-07-14 18:09:37 +0000},
journal = {J. Symbolic Comput.},
number = {3--4},
pages = {253--280},
title = {A Fast Planar Partition Algorithm, {I}},
volume = {10},
year = {1990}}
@article{cs-arscg-89,
author = {Clarkson, Kenneth L. and Shor, Peter W.},
date-added = {2016-07-14 18:07:49 +0000},
date-modified = {2016-07-14 18:08:10 +0000},
journal = {Discrete Comput. Geom.},
pages = {387--421},
title = {Applications of random sampling in computational geometry, {II}},
volume = {4},
year = {1989}}
@article{aghtu-acgg-08,
author = {Abellanas, Manuel and Garc{\'\i}a, Alfredo and Hurtado, Ferran and Tejel, Javier and Urrutia, Jorge},
comments = {weakly simple = non-self-crossing (no definition of latter)},
date-added = {2014-07-20 15:23:40 +0000},
date-modified = {2014-07-20 15:25:05 +0000},
journal = {Comput. Geom. Theory Appl.},
number = {3},
pages = {220--230},
read = {1},
title = {Augmenting the Connectivity of Geometric Graphs},
volume = {40},
year = {2008}}
@inproceedings{ahv-cmbps-12,
abstract = {Two plane graphs with the same vertex set are compatible
if their union is again a plane graph. We consider
bichromatic plane straight-line graphs with vertex set $S$
consisting of the same number of red and blue points, and
(perfect) matchings which are compatible to them. For
several different classes $\mathcal{C}$ of graphs, we
present lower and upper bounds such that any given graph
$G(S) \in \mathcal{C}$ admits a compatible (perfect)
matching with this many disjoint edges.},
author = {Aichholzer, Oswin and Hurtado, Ferran and Vogtenhuber, Birgit},
booktitle = {Proc. 28th European Workshop Comput. Geom.},
comments = {http://www.ist.tugraz.at/files/publications/geometry/ahv-cmbps-12.pdf},
date-added = {2014-07-20 15:23:40 +0000},
date-modified = {2014-07-20 15:25:03 +0000},
pages = {257--260},
read = {1},
title = {Compatible Matchings for Bichromatic Plane Straight-line Graphs},
year = {2012}}
@mastersthesis{a-npntd-13,
author = {Arruda, Patrice},
date-added = {2014-07-20 15:23:40 +0000},
date-modified = {2014-07-20 15:25:01 +0000},
read = {1},
school = {Carleton University},
title = {A New Polygon Nesting Trees Data Structure to Construct a Physical Polyhedral Object},
url = {http://www.scs.carleton.ca/content/new-polygon-nesting-trees-data-structure-construct-physical-polyhedral-object},
year = {2013},
bdsk-url-1 = {http://www.scs.carleton.ca/content/new-polygon-nesting-trees-data-structure-construct-physical-polyhedral-object}}
@article{bm-corgg-04,
author = {Bose, Prosenjit and Morin, Pat},
date-added = {2014-07-20 15:23:40 +0000},
date-modified = {2014-07-20 15:24:56 +0000},
journal = {Theoretical Computer Science},
number = {2--3},
pages = {273--288},
read = {1},
title = {Competitive Online Routing in Geometric Graphs},
volume = {324},
year = {2004}}
@mastersthesis{b-pvgrp-93,
author = {Bremner, David Dylan},
date-added = {2014-07-20 15:23:40 +0000},
date-modified = {2014-07-20 15:24:55 +0000},
read = {1},
school = {Simon Fraser University},
title = {Point Visibility Graphs and Restricted-orientation Polygon Covering},
year = {1993}}
@article{dfor-cpst-10,
author = {Damian, Mirela and Flatland, Robin and O'Rourke, Joseph and Ramaswami, Suneeta},
date-added = {2014-07-20 15:23:40 +0000},
date-modified = {2014-07-20 15:24:51 +0000},
journal = {Theory of Computing Systems},
number = {3},
pages = {674--695},
read = {1},
title = {Connecting Polygonizations via Stretches and Twangs},
volume = {47},
year = {2010}}
@book{do-gfalo-07,
author = {Demaine, Erik D. and O'Rourke, Joseph},
date-added = {2014-07-20 15:23:40 +0000},
date-modified = {2014-07-20 15:24:51 +0000},
publisher = {Cambridge Univ. Press},
read = {1},
title = {Geometric Folding Algorithms: Linkages, Origami, Polyhedra},
year = {2007}}
@article{dt-loncg-09,
author = {Dumitrescu, Adrian and T\'{o}th, Csaba D.},
date-added = {2014-07-20 15:23:40 +0000},
date-modified = {2014-07-20 15:24:50 +0000},
journal = {Journal of Discrete Algorithms},
number = {1},
pages = {112--129},
read = {1},
title = {Light Orthogonal Networks with Constant Geometric Dilation},
volume = {7},
year = {2009}}
@article{ist-dcgm-13,
author = {Ishaque, Mashhood and Souvaine, Diane L. and T{\'o}th, Csaba D.},
date-added = {2014-07-20 15:23:40 +0000},
date-modified = {2018-05-02 23:44:37 +0000},
journal = {Discrete Comput. Geom.},
number = {1},
pages = {89--131},
title = {Disjoint Compatible Geometric Matchings},
volume = {49},
year = {2013}}
@book{mn-lpcgc-99,
author = {Mehlhorn, Kurt and N{\"a}her, Stefan},
date-added = {2014-07-20 15:23:40 +0000},
date-modified = {2014-07-20 15:23:40 +0000},
publisher = {Cambridge Univ. Press},
title = {{LEDA}: A Platform for Combinatorial and Geometric Computing},
year = {1999}}
@article{rw-acpgg-12,
author = {{Rutter}, {Ignaz} and {Wolff}, {Alexander}},
date-added = {2014-07-20 15:23:40 +0000},
date-modified = {2014-07-20 15:23:40 +0000},
journal = {J. Graph Algorithms Appl.},
number = {2},
pages = {599--628},
title = {Augmenting the Connectivity of Planar and Geometric Graphs},
volume = {16},
year = {2012},
bdsk-url-1 = {http://dx.doi.org/10.7155/jgaa.00275}}
@incollection{w-sp-14,
author = {{Wikipedia contributors}},
booktitle = {Wikipedia, The Free Encyclopedia},
date-added = {2014-07-20 15:23:40 +0000},
date-modified = {2014-07-20 15:23:40 +0000},
note = {Last accessed June 26, 2014},
title = {Simple polygon},
url = {http://en.wikipedia.org/wiki/Simple_polygon},
bdsk-url-1 = {http://en.wikipedia.org/wiki/Simple_polygon}}
@inproceedings{sh-gip-76,
author = {Shamos, Michael I. and Hoey, Dan},
booktitle = {Proc. 17th Annu. IEEE Sympos. Found. Comput. Sci.},
date-added = {2014-07-20 15:14:05 +0000},
date-modified = {2014-07-20 15:14:08 +0000},
pages = {208--215},
read = {1},
title = {Geometric intersection problems},
year = {1976}}
@article{ksn-spppo-99,
author = {Kusakari, Yoshiyuki and Suzuki, Hitoshi and Nishizeki, Takao},
comments = {Defines "crossing" correctly for non-simple paths without spurs},
date-added = {2014-07-20 15:13:47 +0000},
date-modified = {2014-07-20 15:13:51 +0000},
journal = {Int. J. Comput. Geom. Appl.},
number = {2},
pages = {151--170},
read = {1},
title = {A Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas},
volume = {9},
year = {1999}}
@inproceedings{ht-pcbet-05,
author = {Hoffmann, Michael and T{\'o}th, Csaba D.},
booktitle = {Proc. 21st Ann. Symp. Comput. Geom.},
comments = {weakly simple = non-self-crossing (no definition of latter)},
date-added = {2014-07-20 15:13:30 +0000},
date-modified = {2014-07-20 15:13:30 +0000},
pages = {81--90},
read = {1},
title = {Pointed and colored binary encompassing trees},
year = {2005}}
@article{r-nsaq2-95,
author = {Ruppert, Jim},
date-added = {2014-07-20 15:13:06 +0000},
date-modified = {2014-07-20 15:14:19 +0000},
journal = {J. Algorithms},
number = {3},
pages = {548--585},
read = {1},
title = {A new and simple algorithm for quality 2-dimensional mesh generation},
volume = {18},
year = {1995}}
@inproceedings{bcdt-cordg-14,
author = {Bose, Prosenjit and Carufel, Jean-Lou De and Durocher, Stephane and Taslakian, Perouz},
booktitle = {Proc. 14th Scand. Workshop Algorithm Theory},
date-added = {2014-07-20 15:12:55 +0000},
date-modified = {2014-07-20 15:14:27 +0000},
editor = {Ravi, R. and and Inge Li G{\o}rtz},
pages = {98--104},
publisher = {Springer},
read = {1},
series = {Lecture Notes Comput. Sci.},
title = {Competitive Online Routing on {Delaunay} Graphs},
volume = {8503},
year = {2014}}
@article{ylw-spnprp-97,
author = {Yang, Chung-Do and Lee, Der-Tsai and Wong, Chak-Kuen},
comments = {definition of crossing assumes simple paths},
date-added = {2014-06-26 12:13:26 +0000},
date-modified = {2014-06-26 12:17:39 +0000},
journal = {IEEE Trans. Comput.},
number = {8},
pages = {930--941},
read = {1},
title = {The smallest pair of noncrossing paths in a rectilinear polygon},
volume = {46},
year = {1997}}
@article{addjs-sswg-93,
author = {Alth{\"o}fer, Ingo and Das, Gautam and Dobkin, David P. and Joseph, Deborah and Soares, Jos{\'e}},
date-added = {2013-11-08 20:52:08 +0000},
date-modified = {2014-07-20 15:14:34 +0000},
journal = {Discrete Comput. Geom.},
pages = {81--100},
read = {1},
title = {On sparse spanners of weighted graphs},
volume = {9},
year = {1993}}
@inproceedings{bgh-dsmd-97,
author = {Basch, Julien and Guibas, Leonidas J. and Hershberger, John},
booktitle = {Proc. 8th ACM-SIAM Sympos. Discrete Algorithms},
date-added = {2013-11-08 19:54:30 +0000},
date-modified = {2013-11-08 19:55:06 +0000},
pages = {747--756},
read = {1},
title = {Data Structures for Mobile Data},
update = {98.03 mitchell, 97.07 agarwal, 97.03 held},
year = {1997}}
@incollection{g-kdssa-98,
address = {Wellesley, MA},
author = {Guibas, Leonidas J.},
booktitle = {Proc. Workshop Algorithmic Found. Robot.},
date-added = {2013-11-08 19:53:46 +0000},
date-modified = {2013-11-08 19:55:05 +0000},
editor = {Agarwal, Pankaj K. and Kavraki, Lydia E. and Mason, Matthew T.},
pages = {191--209},
publisher = {A. K. Peters},
read = {1},
title = {Kinetic data structures: {A} state of the art report},
update = {00.03 agarwal},
year = {1998}}
@article{m-gsaps2-99,
author = {Mitchell, Joseph S. B.},
date-added = {2013-11-08 06:33:37 +0000},
date-modified = {2013-11-08 06:35:16 +0000},
journal = {SIAM J. Computing},
pages = {1298--1309},
read = {1},
title = {Guillotine subdivisions approximate polygonal subdivisions: {Part II} -- a simple {PTAS} for geometric $k$-{MST}, {TSP}, and related problems},
volume = {28},
year = {1999}}
@book{g-cp-67,
author = {Gr{\"u}nbaum, Branko},
date-added = {2013-10-29 04:14:03 +0000},
date-modified = {2013-10-29 04:18:18 +0000},
number = {XVI},
publisher = {John Wiley \& Sons},
series = {Monographs in Pure and Applied Mathematics},
title = {Convex Polytopes},
year = {1967}}
@incollection{r-gbp-99,
author = {Reiner, Victor},
booktitle = {New Perspectives in Geometric Combinatorics},
date-added = {2013-08-02 16:31:38 +0000},
date-modified = {2013-08-02 16:38:15 +0000},
editor = {Billera, Louis J. and Bj{\"o}rner, Anders and Greene, Curtis and Simion, Rodica E. and Stanley, Richard P.},
pages = {293--336},
publisher = {MSRI Publications},
read = {1},
title = {The Generalized {Baues} problem},
volume = {38},
year = {1999}}
@article{bs-fp-92,
author = {Billera, Louis J. and Sturmfels, Bernd},
comments = {cube flips (implicit)},
date-added = {2013-08-02 15:43:02 +0000},
date-modified = {2013-08-02 16:22:40 +0000},
journal = {Ann. Math.},
number = {3},
pages = {527--549},
read = {1},
title = {Fiber Polytopes},
volume = {135},
year = {1992}}
@article{cg-vippg-89,
author = {Chazelle, Bernard and Guibas, Leonidas J.},
date-added = {2013-03-12 21:08:52 +0000},
date-modified = {2013-03-12 21:09:29 +0000},
journal = {Discrete Comput. Geom.},
pages = {551--581},
read = {1},
title = {Visibility and intersection problems in plane geometry},
volume = {4},
year = {1989}}
@article{ghls-ltavs-87,
author = {Guibas, Leonidas J. and Hershberger, John and Leven, Daniel and Sharir, Micha and Tarjan, Robert E.},
date-added = {2013-03-12 18:56:13 +0000},
date-modified = {2013-03-12 18:57:06 +0000},
journal = {Algorithmica},
number = {1},
pages = {209--233},
read = {1},
title = {Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons},
volume = {2},
year = {1987},
bdsk-url-1 = {http://dx.doi.org/10.1007/BF01840360}}
@article{gh-ospqs-89,
author = {Guibas, Leonidas J. and Hershberger, John},
date-added = {2013-03-12 18:53:32 +0000},
date-modified = {2013-03-12 18:53:58 +0000},
journal = {J. Comput. Syst. Sci.},
number = {2},
pages = {126--152},
read = {1},
title = {Optimal Shortest Path Queries in a Simple Polygon},
volume = {39},
year = {1989}}
@article{eghsssw-irals-89,
author = {Edelsbrunner, Herbert and Guibas, Leonidas and Hershberger, John and Seidel, Raimund and Sharir, Micha and Snoeyink, Jack and Welzl, Emo},
date-added = {2013-02-09 14:38:07 +0000},
date-modified = {2013-02-09 14:39:25 +0000},
journal = {Discrete Comput. Geom.},
number = {1},
pages = {433--466},
read = {1},
title = {Implicitly representing arrangements of lines or segments},
volume = {4},
year = {1989},
bdsk-url-1 = {http://dx.doi.org/10.1007/BF02187742}}
@article{m-rsehc-93,
author = {Matou{\v s}ek, Ji{\v r}{\'\i}},
date-added = {2013-02-08 22:35:07 +0000},
date-modified = {2014-07-20 15:14:15 +0000},
journal = {Discrete Comput. Geom.},
number = {1},
pages = {157--182},
read = {1},
title = {Range searching with efficient hierarchical cuttings},
volume = {10},
year = {1993}}
@article{m-ept-92,
author = {Matou{\v s}ek, Ji{\v r}{\'\i}},
date-added = {2013-02-08 22:03:51 +0000},
date-modified = {2013-02-08 22:04:16 +0000},
journal = {Discrete Comput. Geom.},
pages = {315--334},
read = {1},
title = {Efficient partition trees},
volume = {8},
year = {1992}}
@article{as-anspt-93,
author = {Agarwal, Pankaj K. and Sharir, Micha},
date-added = {2013-02-08 21:09:54 +0000},
date-modified = {2013-02-08 21:10:29 +0000},
journal = {Discrete Comput. Geom.},
number = {1},
pages = {11--38},
read = {1},
title = {Applications of a new space-partitioning technique},
volume = {9},
year = {1993}}
@techreport{m-mcast-90,
author = {Matou{\v s}ek, Ji{\v r}{\'\i}},
date-added = {2013-02-08 20:50:48 +0000},
date-modified = {2013-02-08 21:04:37 +0000},
institution = {Freie Univ. Berlin},
month = {February},
number = {B-90-2},
read = {0},
title = {More on cutting arrangements and spanning trees with low crossing number},
type = {{Tech. Rep.}},
year = {1990}}
@article{a-soast-92,
author = {Agarwal, Pankaj K.},
date-added = {2013-02-08 20:31:40 +0000},
date-modified = {2013-02-08 20:53:23 +0000},
journal = {SIAM J. Comput.},
number = {3},
pages = {540--570},
read = {1},
title = {Ray shooting and other applications of spanning trees with low stabbing number},
volume = {21},
year = {1992}}
@article{m-stwcn-91,
author = {Matou{\v s}ek, Ji{\v r}{\'\i}},
date-added = {2013-02-08 20:27:09 +0000},
date-modified = {2013-02-08 20:51:34 +0000},
journal = {RAIRO Inform. Th{\'e}or. Appl.},
number = {2},
pages = {103--123},
read = {1},
title = {Spanning trees with low crossing number},
volume = {25},
year = {1991}}
@incollection{w-stlcn-92,
author = {Welzl, Emo},
booktitle = {Data Structures and Efficient Algorithms: {Final} Report on the {DFG} Special Joint Initiative},
date-added = {2013-02-08 20:14:52 +0000},
date-modified = {2013-02-08 20:51:19 +0000},
editor = {Monien, Burkhard and Ottmann, Thomas},
pages = {233--249},
publisher = {Springer},
read = {1},
series = {Lecture Notes Comput. Sci.},
title = {On spanning trees with low crossing numbers},
volume = {594},
year = {1992},
bdsk-url-1 = {http://dx.doi.org/10.1007/3-540-55488-2_30}}
@article{cw-qrssf-89,
author = {Chazelle, Bernard and Welzl, Emo},
date-added = {2013-02-08 20:12:17 +0000},
date-modified = {2013-02-08 20:52:12 +0000},
journal = {Discrete Comput. Geom.},
number = {1},
pages = {467--489},
read = {1},
title = {Quasi-optimal range searching in spaces of finite {VC}-dimension},
volume = {4},
year = {1989}}
@article{cp-cioor-10,
author = {Chan, Timothy M. and P{\u a}tra{\c s}cu, Mihai},
comments = {orthogonal emptiness (via dominance counting): O(n \sqrt{\log n}) space, O(log n/log log n) query time},
date-added = {2013-01-30 01:45:54 +0000},
date-modified = {2013-02-08 20:52:17 +0000},
journal = {Proc. 21st Ann. Symp. Discrete Algorithms},
pages = {161--173},
read = {1},
title = {Counting inversions, offline orthogonal range counting, and related problems},
year = {2010}}
@article{cbk-sn-05,
author = {Cabello, Sergio and de Berg, Mark and van Kreveld, Marc},
date-added = {2013-01-29 23:01:05 +0000},
date-modified = {2013-02-08 20:52:50 +0000},
journal = {Comput. Geom. Theory Appl.},
pages = {223--238},
read = {1},
title = {Schematization of networks},
volume = {30},
year = {2005}}
@article{k-osps-83,
author = {Kirkpatrick, David G.},
date-added = {2013-01-27 05:09:52 +0000},
date-modified = {2013-02-08 20:51:39 +0000},
journal = {SIAM J. Comput.},
keywords = {data structuring, searching, subdivisions, plane graph representation, hierarchical representations},
number = {1},
pages = {28--35},
read = {1},
title = {Optimal search in planar subdivisions},
volume = {12},
year = {1983}}
@article{gjpt-tsp-78,
author = {Garey, Michael R. and Johnson, David S. and Preparata, Franco P. and Tarjan, Robert E.},
comments = {trapezoids in O(n log n) time + triangles in O(n) more time},
date-added = {2013-01-19 02:48:28 +0000},
date-modified = {2013-02-08 20:51:50 +0000},
journal = {Inform. Proc. Lett.},
pages = {175--180},
read = {1},
title = {Triangulating a simple polygon},
volume = {7},
year = {1978}}
@book{o-cg-98,
author = {O'Rourke, Joseph},
date-added = {2013-01-19 02:42:38 +0000},
date-modified = {2013-02-08 20:51:32 +0000},
edition = {2nd},
publisher = {Cambridge University Press},
read = {1},
title = {Computational Geometry in C},
year = {1998}}
@book{bcko-cgaa-08,
author = {de Berg, Mark and Cheong, Otfried and van Kreveld, Marc and Overmars, Mark},
date-added = {2013-01-19 02:41:44 +0000},
date-modified = {2013-01-19 02:41:44 +0000},
edition = {3rd},
keywords = {textbook},
publisher = {Springer-Verlag},
read = {1},
title = {Computational Geometry: Algorithms and Applications},
year = {2008}}
@article{t-etsp-91,
author = {Toussaint, Godfried},
comments = {incorrect proofs of polygon triangulability},
date-added = {2013-01-18 22:55:47 +0000},
date-modified = {2013-02-08 20:51:21 +0000},
journal = {The Visual Computer},
number = {5},
pages = {280--295},
read = {1},
title = {Efficient triangulation of simple polygons},
volume = {7},
year = {1991}}
@article{h-dpit-76,
author = {Hu, Chung-Wo},
comments = {incorrect proofs of polygon triangulability},
date-added = {2013-01-18 22:50:29 +0000},
date-modified = {2013-02-08 20:51:43 +0000},
journal = {Math. Gazette},
number = {132--134},
read = {0},
title = {Decomposition of a polygon into triangles},
volume = {60},
year = {1976}}
@inproceedings{b-ct-93,
author = {Bern, Marshall},
booktitle = {Proc. 9th Ann. Symp. Comput. Geom.},
date-added = {2012-12-02 06:25:30 +0000},
date-modified = {2020-07-13 10:07:54 -0500},
pages = {281--288},
read = {1},
title = {Compatible tetrahedralizations},
year = {1993}}
@article{c-cpplb-84,
author = {Chazelle, Bernard},
date-added = {2012-12-02 06:19:53 +0000},
date-modified = {2012-12-02 06:20:47 +0000},
journal = {SIAM J. Comput.},
number = {3},
pages = {488--507},
read = {1},
title = {Convex partitions of polyhedra: {A} lower bound and worst-case optimal algorithm},
volume = {13},
year = {1984}}
@article{cp-tnp-90,
author = {Chazelle, Bernard and Palios, Leonidas},
date-added = {2012-12-02 06:13:39 +0000},
date-modified = {2012-12-02 06:15:05 +0000},
journal = {Discrete Comput. Geom.},
pages = {505--526},
read = {1},
title = {Triangulating a nonconvex polytope},
volume = {5},
year = {1990}}
@inproceedings{ag-mrpc-92,
author = {Alt, Helmut and Godau, Michael},
booktitle = {Proc. 8th Ann. Symp. Comput. Geom.},
date-added = {2012-11-01 21:10:08 +0000},
date-modified = {2013-02-08 20:53:22 +0000},
pages = {102--109},
read = {1},
title = {Measuring the resemblance of polygonal curves},
year = {1992}}