-
Notifications
You must be signed in to change notification settings - Fork 0
/
cited.bib
2296 lines (2114 loc) · 82.5 KB
/
cited.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
@COMMENT{{This file has been generated by bib2bib 1.86}}
@COMMENT{{Command line: /usr/bin//bib2bib -c '$key="lucas" or $key="l-rmp-91" or $key="Nilsson:1997:FMS" or $key="cpw-stmm-93" or $key="FIORIO:2006:LIRMM-00128281:1" or $key="ROSEN_66" or $key="fouard:ivc:2005" or $key="GotLin95" or $key="fourier" or $key="ICCV2-99*828" or $key="veelaert_hyper" or $key="TCS::JansenM1995:69" or $key="deVieilleville_these" or $key="Moore79a" or $key="MULL_92" or $key="dcg-handbook" or $key="conf/dgci/SivignonDC05" or $key="laurefab" or $key="BreuEtAl95" or $key="bb18000" or $key="Guan" or $key="roerdnik" or $key="Aurenhammer:1987:PDP" or $key="dcoeurjo_pami_RDMA" or $key="BaranyLarman" or $key="maurer_pami" or $key="bruck93" or $key="Moor66a" or $key="bruynooghe1994cir" or $key="lossless" or $key="bernoulli" or $key="Bresenham_circular" or $key="BBN1" or $key="Thiel_EMA" or $key="hardy" or $key="bb33412" or $key="Thiel_CMA" or $key="dcoeurjo_hermes" or $key="veelaert" or $key="ilroy" or $key="Vee99" or $key="dcoeurjo_avacavan_ISCV" or $key="STO91" or $key="christoffel" or $key="dcoeurjo_NPhard" or $key="m-etps-88" or $key="Grunbaum" or $key="dcoeurjo_digitalarc_DAM" or $key="hartong" or $key="kothe_IVC" or $key="dor91" or $key="dcoeurjo_TFCV_graphe" or $key="bb16862" or $key="P16" or $key="antoine_RR" or $key="DEB95" or $key="GareyJohnson" or $key="bb36468" or $key="Fitzpatrick" or $key="borgerfors_min_SSAB" or $key="TCS::DobkinK1983" or $key="kimmel" or $key="LeymarieL92" or $key="montanari" or $key="megiddo_LP" or $key="sivignon_these" or $key="vittonethese" or $key="dcoeurjo_iwcia2006" or $key="Thiel_IWCIA7" or $key="Barany02" or $key="Cook:1971" or $key="journals/rc/RueherS97" or $key="SaitTori:94" or $key="bb20013" or $key="Vee02" or $key="dcoeurjo_IVC_couprie" or $key="zolo" or $key="journals/algorithmica/SivignonDC03" or $key="minset_log" or $key="dcoeurjo_RR_AMNP" or $key="BarHowLov92" or $key="jamet_functionality" or $key="havran" or $key="IPL::Melkman1987" or $key="marching" or $key="AmeChoKol01" or $key="Megiddo84" or $key="citeulike_611268" or $key="debled" or $key="Andres_hypersphere" or $key="kim91" or $key="andres_hdr" or $key="satio_redt" or $key="citeulike_937376" or $key="Tamassia/87" or $key="Smeulders84" or $key="danielson" or $key="dcoeurjo_mdexet_ISVC" or $key="journals/dcg/Chazelle93" or $key="BoissonnatEtAl96" or $key="soillebook" or $key="citeulike_613266" or $key="reveilles" or $key="Cuisenaire1999_268" or $key="mukherjee" or $key="attali" or $key="Hirata" or $key="KOV_1990" or $key="jospin_transmission" or $key="citeulike_910101" or $key="jonas97" or $key="lieutier_MA" or $key="LinckeW03" or $key="montanvert" or $key="shb-ipamv-99" or $key="vittone" or $key="borgefors_min" or $key="dcoeurjo_MCsimplDGCI06" or $key="conf/dgci/FiorioT06" or $key="de_Fraysseix-Pach-Pollack/90" or $key="dcoeurjo_these" or $key="mesmoudi" or $key="borgefors" or $key="mo:RatschekRokne:84" or $key="buzer_cvxhull" or $key="thiel" or $key="citeulike:677854" or $key="Thiel_hdr" or $key="decomp3Dstina" or $key="attal" or $key="ragnemalm" or $key="dexet_these" or $key="boissonnat" or $key="tajine_ronse" or $key="Andres_standard" or $key="acketa" or $key="dcoeurjo_avacavan_DGCI" or $key="journals/ijcv/GiblinK03" or $key="GerDebZim05" or $key="balog" or $key="ORourke:1986a" or $key="journals/pami/HilaireT06" or $key="ingemar" or $key="Kim84f" or $key="dcoeurjo_planarity" or $key="klette_book" or $key="har-peled98" or $key="Graham:72" or $key="dcoeurjo_preimage_DAM" or $key="pion" or $key="rourke" or $key="snyder-92" or $key="Blum:1964" or $key="aupperle88a" or $key="hesselink_ISMM" or $key="deberg" or $key="dcoeurjo_supercover_dgci" or $key="conf/dgci/BrimkovD05" or $key="sann94" or $key="BarBen96" or $key="rang_thesis" or $key="samet90" or $key="dcoeurjo_computergraphics" or $key="lachaud_MC" or $key="ROSEN_68" or $key="flux" or $key="serra" or $key="cormen" or $key="schrijver86" or $key="voss" or $key="goldwasser95survey" or $key="Nagy05" or $key="Lachaud00a" or $key="attali_incluExclu" or $key="o-mvdss-94" or $key="Herman98b" or $key="megiddo" or $key="jarvis73" or $key="sphere-tree" or $key="tajine_ronse_h" or $key="dcoeurjo_spie_mc" or 1=2' ./mybiblio.bib ./biblio.bib ./biblio_chapitre.bib ./biblio_chapitre2.bib ./edt.bib ./integer_programming.bib}}
@BOOK{dcoeurjo_hermes,
editor = {D. Coeurjolly and A. Montanvert and J.-M. Chassery},
title = {Géométrie discrète et images numériques},
publisher = {Hermès Paris},
year = 2007,
pages = 416,
series = {Traité IC2, Signal et Image},
address = {France},
month = SEP
}
@ARTICLE{dcoeurjo_IVC_couprie,
author = {M. Couprie and D. Coeurjolly and R. Zrour},
title = {Discrete bisector function and Euclidean skeleton in 2D and 3D},
journal = {Image and Vision Computing},
year = 2007,
volume = 25,
number = 10,
pages = {1519--1698},
month = OCT
}
@INPROCEEDINGS{dcoeurjo_mdexet_ISVC,
author = {M. Dexet and D. Coeurjolly and E. Andres},
title = {Invertible Polygonalization of 3D Planar Digital Curves and Application to Volume Data Reconstruction},
booktitle = {International Symposium on Visual Computing (ISVC)},
year = 2006,
volume = 4292,
series = {LNCS},
address = {Lake Tahoe, Nevada, USA}
}
@INPROCEEDINGS{dcoeurjo_MCsimplDGCI06,
author = {D. Coeurjolly and F. Dupont and L. Jospin and I. Sivignon},
title = {Optimization schemes for the reversible discrete volume polyhedrization using Marching Cubes simplification},
booktitle = {13th International Conference on Discrete Geometry for Computer Imagery},
pages = {413--424},
year = 2006,
volume = 4245,
series = {LNCS},
address = {Szeged, Hungary},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{dcoeurjo_NPhard,
author = {I. Sivignon and D. Coeurjolly},
title = {Minimal Decomposition of a Digital Surface into Digital Plane Segments is NP-Hard},
booktitle = {13th International Conference on Discrete Geometry for Computer Imagery},
pages = {674--685},
year = 2006,
number = 4245,
series = {LNCS},
address = {Szeged, Hungary},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{dcoeurjo_avacavan_DGCI,
author = {A. Vacavant and D. Coeurjolly and L. Tougne},
title = {Topological and Geometrical Reconstruction of Complex Objects on Irregular Isothetic Grids},
booktitle = {13th International Conference on Discrete Geometry for Computer Imagery},
key = {470--481},
year = 2006,
volume = 4245,
series = {LNCS},
address = {Szeged, Hungary},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{dcoeurjo_avacavan_ISCV,
author = {A. Vacavant and D. Coeurjolly and L. Tougne},
title = {Dynamic Reconstruction of Complex Planar Objects on Irregular Isothetic Grids},
booktitle = {International Symposium on Visual Computing (ISVC)},
year = 2006,
number = 4292,
series = {LNCS},
address = {Nevada, USA}
}
@INBOOK{ingemar,
author = {I. Ragnemalm and G. Borgefors},
title = {The Euclidean Distance Transform,},
chapter = {Towards a minimal shape representation using maximal discs},
publisher = {Link\"{o}ping Studies in Science and Technology. Dissertations No.
304., Link\"{o}ping University},
year = 1993,
month = APR,
pages = {245--260}
}
@INPROCEEDINGS{borgerfors_min_SSAB,
author = {G. Borgefors and I. Nystr\"{o}m},
title = {Quantitative shape analysis of volume images -- reducing the set
of centres of maximal spheres},
booktitle = {Proc. SSAB Symposium on Image Analysis},
pages = {5--8},
year = 1995,
address = {Link\"{o}ping, Sweden},
month = MA
}
@ARTICLE{Tamassia/87,
author = {R. Tamassia},
title = {On embedding a graph in the grid with the minimum
number of bends},
journal = {SIAM J. Comput.},
pages = {421--444},
year = 1987,
month = JUN,
number = 3,
volume = 16,
publisher = {Society for Industrial and Applied Mathematics},
institution = {Dipartimento di Inf. e Sistemistica, Roma Univ.,
Italy},
address = {Philadelphia, PA},
cdate = {1970-01-01},
mdate = {2005-08-18}
}
@TECHREPORT{dcoeurjo_RR_AMNP,
author = {D. Coeurjolly and J. Hulin and I. Sivignon},
title = {Finding a Minimum Medial Axis of a Discrete Shape is NP-hard},
institution = {Laboratoire LIRIS, UMR-CNRS 5205, Universit\'e Claude Bernard Lyon 1},
year = 2007,
url = {http://liris.cnrs.fr/publis/index_html?id=3158},
number = {RR-2007-026}
}
@INPROCEEDINGS{lucas,
year = 2001,
title = {Multiresolution and Shape Optimization of Implicit
Skeletal Model},
author = {S. Prevost and L. Lucas and E. Bittar},
url = {http://visinfo.zib.de/EVlib/Show?EVL-2001-86},
abstract = {Display of large volumes, progressive rendering and
selective refinements are some of the operations
supported by multiresolution technology. In this paper,
a general framework relying on the use of such
techniques applied to volume data rendering is
presented. Based on a pyramidal representation of data,
two aspects of our work are considered. First, the
decimation algorithm itself is described. The general
principle consists in gradually removing nodes of a
structural graph previously established while
respecting constraints. A second part introduces the
refinement of preliminary obtained Levels of Details
(LOD). The problem is to preserve as well as possible
the initial volume of studied objects. The goal is to
build an interactive system of visualization for the
analysis of volumetric data. The speed of treatments
associated with a good visualization should enable to
achieve a 3D survey of a natural object in a
quasi-interactive manner. The method has been
successfully applied to both synthetic and real data
(medical imaging).},
editor = {V. Skala},
keywords = {Volume data visualization, skeleton shape description,
implicit surface, multiresolution, graph
representation, shape simplification, optimization,
genetic algorithms.},
booktitle = {WSCG 2001 Conference Proceedings}
}
@ARTICLE{de_Fraysseix-Pach-Pollack/90,
author = {H. {de Fraysseix} and J. Pach and R. Pollack},
title = {How to draw a planar graph on a grid},
journal = {Combinatorica},
pages = {41--51},
year = {1990},
volume = {10},
publisher = {Akad{\'e}miai Kiad{\'o}},
address = {Budapest, North-Holland Publishing Company:
Amsterdam-New York-Oxford-Tokyo},
cdate = {1970-01-01},
mdate = {2005-08-18}
}
@ARTICLE{TCS::JansenM1995:69,
title = {The minimum broadcast time problem for several
processor networks},
author = {K. Jansen and H. M{\"u}ller},
journal = {Theoretical Computer Science},
pages = {69--85},
month = {7~} # AUG,
year = {1995},
volume = {147},
number = {1--2}
}
@INPROCEEDINGS{hartong,
author = {J. Hartong},
booktitle = {La mathématique non standard},
title = {Une théorie du continu},
publisher = {Editions du CNRS, Paris},
year = 1989,
series = {Fondements des Sciences}
}
@ARTICLE{decomp3Dstina,
author = {Svensson, S. and {Sanniti di Baja}, G.},
title = {Using distance transforms to decompose 3D discrete objects},
journal = {Image Vision \& Computing},
volume = 20,
year = 2002,
number = 8,
month = JUN,
pages = {529-540},
bibsource = {http://www.visionbib.com/bibliography/twod300.html#TT20209}
}
@ARTICLE{TCS::DobkinK1983,
title = {Fast Detection of Polyhedral Intersection},
author = {D.~P. Dobkin and D.~G. Kirkpatrick},
pages = {241--253},
journal = {Theoretical Computer Science},
year = {1983},
month = DEC,
volume = {27},
number = {3},
preliminary = {ICALP::DobkinK1982}
}
@ARTICLE{attali_incluExclu,
title = {Inclusion-Exclusion Formulas from Independent
Complexes},
author = {D. Attali and H. Edelsbrunner},
publisher = {Springer-Verlag},
year = {2007},
abstract = {Using inclusion-exclusion, we can write the indicator
function of a union of finitely many balls as an
alternating sum of indicator functions of common
intersections of balls. We exhibit abstract simplicial
complexes that correspond to minimal
inclusion-exclusion formulas. They include the dual
complex, as defined in [3], and are characterized by
the independence of their simplices and by geometric
realizations with the same underlying space as the dual
complex.},
issn = {1432-0444},
journal = {Discrete \& Computational Geometry},
volume = 37,
number = 1,
pages = {59--77},
doi = {10.1007/s00454-006-1274-7}
}
@INPROCEEDINGS{FIORIO:2006:LIRMM-00128281:1,
title = {{D}iscrete {C}ircles: an arithmetical approach with non-constant thickness},
author = {Fiorio, {C}. and {T}outant, {J}.-{L}. and {J}amet, {D}.},
booktitle = {{V}ision {G}eometry {X}{I}{V}, {I}{S}\&{T}/{S}{P}{I}{E} 18th {A}nnual {S}ymposium {E}lectronic {I}maging },
pages = {60660{C}01-60660{C}12 },
month = 01,
year = 2006,
url = {http://hal-lirmm.ccsd.cnrs.fr/lirmm-00128281/en/}
}
@INPROCEEDINGS{conf/dgci/FiorioT06,
title = {Arithmetic Discrete Hyperspheres and Separatingness},
author = {C. Fiorio and J.-L. Toutant},
bibdate = {2006-11-22},
bibsource = {DBLP,
http://dblp.uni-trier.de/db/conf/dgci/dgci2006.html#FiorioT06},
booktitle = {DGCI},
booktitle = {Discrete Geometry for Computer Imagery, 13th
International Conference, {DGCI} 2006, Szeged, Hungary,
October 25-27, 2006, Proceedings},
publisher = {Springer},
year = 2006,
volume = 4245,
editor = {Attila Kuba and L{\'a}szl{\'o} G. Ny{\'u}l and
K{\'a}lm{\'a}n Pal{\'a}gyi},
isbn = {3-540-47651-2},
pages = {425--436},
series = {Lecture Notes in Computer Science},
url = {http://dx.doi.org/10.1007/11907350_36}
}
@ARTICLE{jamet_functionality,
abstract = {Naive discrete planes are well known to be functional on a coordinate plane. The aim of our paper is to extend the functionality concept to a larger family of arithmetic discrete planes, by introducing suitable projection directions ([alpha]1, [alpha]2, [alpha]3) satisfying [alpha]1v1 + [alpha]2v2 + [alpha]3v3 = w. Several applications are considered. We first study certain local configurations, that is, the (m, n)-cubes introduced in Ref. [J. Vittone, J.-M. Chassery, (n,m)-cubes and Farey Nets for Naive Planes Understanding, in: DGCI, 8th International Conference, Lecture Notes in Computer Science, vol. 1568, Springer-Verlag, 1999, pp. 76-87.]. We compute their number for a given (m, n) and study their statistical behaviour. We then apply functionality to formulate an algorithm for generating arithmetic discrete planes, inspired by Debled-Renesson [I. Debled-Renesson, Reconnaissance des Droites et Plans Discrets, These de doctorat, Universite Louis Pasteur, Strasbourg, France, 1995.]. We also prove that an arithmetic discrete plane may be endowed with a combinatorial surface structure, in the spirit of Ref. [Y. Kenmochi, A. Imiyam Combinatorial topologies for discrete planes, in: DGCI, 11th International Conference, DGCI 2003, Lecture Notes in Computer Science, vol. 2886, Springer-Verlag, 2003, pp. 144-153.].},
author = {Berthé, V. and Fiorio, C. and Jamet, D. and Philippe, F. },
booktitle = {Discrete Geometry for Computer Imagery 2005},
citeulike-article-id = 1583039,
doi = {10.1016/j.imavis.2006.06.023},
journal = {Image and Vision Computing},
keywords = {digital hyperplane},
month = {October},
number = 10,
pages = {1671--1684},
priority = 2,
title = {On some applications of generalized functionality for arithmetic discrete planes},
url = {http://www.sciencedirect.com/science/article/B6V09-4M7VB14-4/2/e10d6699aa9e6a87d3ff71cb96a32793},
volume = 25,
year = 2007
}
@ARTICLE{goldwasser95survey,
author = {M. Goldwasser},
title = {A Survey of Linear Programming in Randomized Subexponential Time},
journal = {SIGACTN: SIGACT News (ACM Special Interest Group on Automata and Computability Theory)},
volume = 26,
year = 1995,
url = {citeseer.ist.psu.edu/goldwasser95survey.html}
}
@ARTICLE{ORourke:1986a,
author = {J. O'Rourke and S.~R. Kosaraju and N. Megiddo},
title = {Computing Circular Separability},
journal = {Discrete and Computational Geometry},
volume = 1,
number = 1,
pages = {105--113},
year = 1986,
issn = {0179-5376}
}
@INPROCEEDINGS{buzer_cvxhull,
author = {L. Buzer},
title = {Computing multiple convex hulls of a simple polygonal chain in linear time},
booktitle = {23rd European Workshop on Computational Geometry},
optcrossref = {},
optkey = {},
optpages = {},
year = {2007},
url = {\url{http://ewcg07.tugraz.at/}},
opteditor = {},
optvolume = {},
optnumber = {},
optseries = {},
optaddress = {},
optmonth = {},
optorganization = {},
optpublisher = {},
optnote = {},
optannote = {}
}
@ARTICLE{IPL::Melkman1987,
title = {On-line construction of the convex hull of a simple
polyline},
author = {A.~A. Melkman},
pages = {11--12},
journal = {Information Processing Letters},
year = 1987,
month = APR,
volume = 25,
number = 1
}
@ARTICLE{har-peled98,
title = {An output sensitive algorithm for discrete convex
hulls},
language = {en},
month = MAY,
number = 2,
pages = {125--138},
year = 1998,
url = {http://visinfo.zib.de/EVlib/Show?EVL-1998-188},
author = {S. {Har-Peled}},
abstract = {Given a convex body C in the plane, its discrete hull
is $C^0 = ConvexHull( C {\ca}p L)$ , where $L = Z
\times Z$ is the integer lattice. We present an $O(
|C0| \log \delta(C))$-time algorithm for calculating
the discrete hull of C , where $|C^0|$ denotes the
number of vertices of $C^0$ , and $\delta(C)$ is the
diameter of $C$ . Actually, using known combinatorial
bounds, the running time of the algorithm is $O(\delta
(C)^{2/3} log \delta (C))i$ . In particular, this bound
applies when C is a disk.},
volume = 10,
copyright = {Copyright 1998, Elsevier Science, All rights
reserved.},
journal = {Computational Geometry. Theory and Applications}
}
@ARTICLE{Graham:72,
author = {R. Graham},
title = {An efficient algorithm for determining the convex hull
of a finite planar set},
journal = {Information Processing Letters},
volume = {1},
pages = {132--133},
year = {1972}
}
@ARTICLE{jarvis73,
author = {R. Jarvis},
title = {On the identification of the convex hull of a finite
set of points in the plane},
journal = {Information Processing Letters},
year = {1973},
volume = {2},
pages = {18--21}
}
@ARTICLE{journals/dcg/Chazelle93,
title = {An Optimal Convex Hull Algorithm in Any Fixed
Dimension},
author = {B. Chazelle},
journal = {Discrete \& Computational Geometry},
year = {1993},
volume = {10},
bibdate = {2002-12-09},
bibsource = {DBLP,
http://dblp.uni-trier.de/db/journals/dcg/dcg10.html#Chazelle93},
pages = {377--409}
}
@INPROCEEDINGS{sphere-tree,
author = {G. Bradshaw and C. O'Sullivan},
title = {Sphere-tree construction using dynamic medial axis approximation},
booktitle = {SCA '02: Proceedings of the 2002 ACM SIGGRAPH/Eurographics symposium on Computer animation},
year = 2002,
isbn = {1-58113-573-4},
pages = {33--40},
location = {San Antonio, Texas},
doi = {http://doi.acm.org/10.1145/545261.545267},
publisher = {ACM Press},
address = {New York, NY, USA}
}
@MASTERSTHESIS{jospin_transmission,
author = {L. Jospin},
title = {Transmission progressive d'images 3D à partir du calcul de l'axe médian},
school = {Ecole Normale Supérieure de Lyon},
year = 2006,
type = {Rapport Master Recherche},
address = {Laboratoire LIRIS},
note = {\url{http://liris.cnrs.fr/publis?id=2983}},
url = {http://liris.cnrs.fr/publis?id=2983}
}
@INPROCEEDINGS{lossless,
author = {F. Dupont and B. Gilles and A. Baskurt},
booktitle = {PCS'O3 (Picture Coding Symposium)},
title = {Lossless and Scalable 3D obbject coding method based on medial axis transformation},
year = 2003
}
@ARTICLE{minset_log,
author = {U. Feige},
title = {A threshold of ln n for approximating set cover},
journal = {J. ACM},
volume = 45,
number = 4,
year = 1998,
issn = {0004-5411},
pages = {634--652},
doi = {http://doi.acm.org/10.1145/285055.285059},
publisher = {ACM Press},
address = {New York, NY, USA}
}
@ARTICLE{lieutier_MA,
abstract = {Medial axis Transform is sometimes used as an intermediate representation in algorithms for meshing or recognition of shapes from digitized data. This raises the question whether the Medial Axis captures fundamental topological invariants of the object. The (positive) answer has been known already in the case of smooth objects. The main result presented here is the homotopy equivalence of any bounded open subset of with its medial axis.},
author = {Lieutier, A. },
booktitle = {Solid Modeling Theory and Applications},
citeulike-article-id = {1460869},
journal = {Computer-Aided Design},
keywords = {axis medial},
month = {September},
number = {11},
pages = {1029--1046},
priority = {2},
title = {Any open bounded subset of has the same homotopy type as its medial axis},
url = {http://www.sciencedirect.com/science/article/B6TYR-4BMY0HG-1/2/de886b1f20753fc8c42e28c271fdcb56},
volume = {36},
year = {2004}
}
@ARTICLE{BarBen96,
author = {R. Bar-Yehuda and E. Ben-Hanoch},
title = {A linear time algorithm for covering simple polygons
with similar rectangles},
journal = {Intern. J. of Computational Geometry and
Applications},
year = {1996},
volume = {6},
number = {1},
pages = {79--102}
}
@BOOK{dcg-handbook,
title = {Handbook of Discrete and Computational Geometry},
booktitle = {Handbook of Discrete and Computational Geometry},
publisher = {CRC Press},
year = {1997},
editor = {J.~E. Goodman and J. O'Rourke}
}
@INCOLLECTION{flux,
abstract = {Geometric shapes are identified with their features. For computational purposes a concrete mathematical definition of features is required. In this paper we use a topological approach, namely dynamical systems, to define features of shapes. To exploit this definition algorithmically we assume that a point sample of the shape is given as input from which features of the shape have to be approximated. We translate our definition of features to the discrete domain while mimicking the set-up developed for the continuous shapes. Experimental results show that our algorithms segment shapes in two and three dimensions into so-called features quite effectively. Further, we develop a shape matching algorithm that takes advantage of our robust feature segmentation step.},
author = {Dey, T. and Giesen, J. and Goswami, S. },
citeulike-article-id = {1454362},
journal = {Algorithms and Data Structures},
keywords = {no-tag},
pages = {25--36},
priority = {2},
title = {Shape Segmentation and Matching with Flow Discretization},
url = {http://www.springerlink.com/content/6qwfh2adqmm60n30
},
year = {2003}
}
@INPROCEEDINGS{laurefab,
author = {Feschet, F. and Tougne, L.},
title = {Optimal Time Computation of the Tangent of a Discrete Curve : Application to the Curvature},
booktitle = {8th International Workshop in Discrete Geometry for Computer Imagery},
year = {1999},
pages = {31--40},
publisher = {Springer-Verlag, LNCS, 1568}
}
@PHDTHESIS{deVieilleville_these,
author = {F. de Vieilleville},
title = {Analyse des parties linéaires des objets discrets pour l'extraction de caractéristiques géométriques},
school = {Université de Bordeaux 1},
year = 2007,
type = {Thèse de Doctorat}
}
@ARTICLE{Lachaud00a,
author = {J.-O. Lachaud and A. Montanvert},
title = {{C}ontinuous analogs of digital boundaries: A topological
approach to iso-surfaces},
journal = {Graphical Models and Image Processing},
publisher = {Academic Press},
year = 2000,
volume = 62,
pages = {129--164}
}
@PHDTHESIS{havran,
author = {V. Havran},
title = {Heuristic Ray Shooting Algorithms},
school = {Czech Technical University, Faculty of Electrical Engineering, Department of Computer Science and Engineering},
year = 2001,
url = {http://www.cgg.cvut.cz/~havran/DISSVH/phdthesis.html}
}
@TECHREPORT{antoine_RR,
title = {{A framework for dynamic implicit curve approximation by
an irregular discrete approach}},
author = {A. {Vacavant} and D. {Coeurjolly} and L.
{Tougne}},
year = {2007},
institution = {LIRIS UMR 5205 CNRS/INSA de Lyon/Université Claude Bernard
Lyon 1/Université Lumière Lyon 2/Ecole Centrale de Lyon},
number = {RR-LIRIS-2007-020},
language = {en},
url = {http://liris.cnrs.fr/publis/?id=2962}
}
@PHDTHESIS{dexet_these,
author = {M. Dexet},
title = {Architecture d'un modeleur géométrique à base topologique d'objets discrets et méthodes de reconstruction en dimensions 2 et 3},
school = {Université de Poitiers},
year = 2006,
type = {Thèse de Doctorat}
}
@ARTICLE{bb20013,
author = {L. J. Latecki and C. Conrad and A. Gross},
title = {Preserving Topology by a Digitization Process},
journal = {Journal of Mathematical Imaging and Vision},
volume = {8},
year = {1998},
number = {2},
month = MAR,
pages = {131--159},
url = {http://dx.doi.org/10.1023/A:1008273227913},
bibsource = {http://www.visionbib.com/bibliography/twod289.html#TT19121}
}
@INPROCEEDINGS{Cook:1971,
author = {S.~A. Cook},
year = {1971},
title = {The complexity of theorem-proving procedures},
booktitle = {Proceedings of the 3rd Annual ACM Symposium on Theory
of Computing},
address = {New York},
pages = {151--158}
}
@ARTICLE{journals/rc/RueherS97,
title = {Concurrent Cooperating Solvers over Reals},
author = {M. Rueher and C. Solnon},
journal = {Reliable Computing},
year = {1997},
number = {3},
volume = {3},
bibdate = {2004-07-29},
bibsource = {DBLP,
http://dblp.uni-trier.de/db/journals/rc/rc3.html#RueherS97},
pages = {325--333},
url = {http://dx.doi.org/10.1023/A:1009939327927}
}
@INPROCEEDINGS{bruynooghe1994cir,
title = {{CLP(intervals) Revisited}},
author = {Benhamou, F. and Mc Allester, D. and Van Hentenryck, P.},
booktitle = {Proceedings of the 1994 International Symposium on Logic Programming},
pages = {124--138},
year = 1994,
publisher = {MIT Press}
}
@ARTICLE{snyder-92,
author = {J.~M. Snyder},
journal = {Computer Graphics},
month = JUL,
note = {Proceedings SIGGRAPH'92.},
number = {2},
title = {Interval Analysis For Computer Graphics},
volume = {26},
year = {1992},
tag = {I74}
}
@BOOK{mo:RatschekRokne:84,
author = {H. Ratschek and J. Rokne},
title = {Computer Methods for the Range of Functions},
publisher = {Ellis Horwood Ltd.},
year = {1984},
address = {Chichester},
pages = {168}
}
@BOOK{Moor66a,
author = {R.~E. Moore},
title = {Interval Analysis},
publisher = {Prentice-Hall},
year = {1966},
address = {Englewood Cliffs, N.J.},
referred = {[Garl85a] \# 967, 969; [Bart70a]; [Chan74a];
[Corl82a]; [Corl87a]; [Corl88a]; [Corl91a]; [Gray67a];
[Gray74a]; [Hali83a]; [Iri84a]; [Kuba72a]; [Moor79a];
[Rall80a]; [Rall81a]; [Yohe79a].},
comment = {German translation: {\sl Intervallanalyse,\/}
translated by D. Pfaffenzeller, R. Oldenburg,
M{\"u}nchen, 1968.},
keywords = {boundary value problems; wrapping effect; coordinate
transformation; Taylor coefficients.},
abstract = {Chapter ten of this book discusses the machine
generation of Taylor coefficients. Basic recursion
relations are presented.}
}
@BOOK{Moore79a,
author = {R.~E. Moore},
year = {1979},
title = {Methods and Applications of Interval Arithmetic},
series = {Studies in Applied Mathematics},
publisher = {SIAM},
address = {Philadelphia}
}
@PHDTHESIS{pion,
author = {S. Pion},
title = {De la géométrie algorithmique au calcul géométrique},
school = {Université Nice Sophia-Antipolis},
year = {1999},
type = {Thése de doctorat},
optkey = {},
opttype = {},
optaddress = {},
optmonth = {},
optnote = {},
optannote = {}
}
@ARTICLE{bb33412,
author = {D. Cohen Or and A. Kaufman},
title = {Fundamentals of Surface Voxelization},
journal = {Graphical Models and Image Processing},
volume = {57},
year = {1995},
number = {6},
month = NOV,
pages = {453--461},
bibsource = {http://www.visionbib.com/bibliography/describe478.html#TT31590}
}
@ARTICLE{journals/pami/HilaireT06,
title = {Robust and Accurate Vectorization of Line Drawings},
author = {X. Hilaire and K. Tombre},
journal = {IEEE Trans. Pattern Anal. Mach. Intell},
year = {2006},
number = {6},
volume = {28},
bibdate = {2006-08-23},
bibsource = {DBLP,
http://dblp.uni-trier.de/db/journals/pami/pami28.html#HilaireT06},
pages = {890--904},
url = {http://doi.ieeecomputersociety.org/10.1109/TPAMI.2006.127}
}
@INPROCEEDINGS{Vee02,
author = {Veelaert, P.},
title = {Concurrency of Line Segments in Uncertain Geometry},
booktitle = DGCI,
pages = {289--300},
year = {2002},
editor = {Braquelaire, A. and Lachaud, J.-O. and Vialard, A.},
volume = {2301},
address = {Bordeaux, France},
series = LNCS,
publisher = {Springer-Verlag}
}
@ARTICLE{Vee99,
author = {Veelaert, P.},
title = {Geometric Constructions in the Digital Plane},
journal = {Journal of Mathematical Imaging and Vision},
year = {1999},
volume = {11},
pages = {99--118}
}
@BOOK{Herman98b,
author = {Herman, G. T.},
title = {Geometry of digital spaces},
publisher = {Birkh\"{a}user, Boston},
year = {1998}
}
@BOOK{samet90,
author = {H. Samet},
title = {The Design and Analysis of Spatial Data Structures},
publisher = {Addison-Wesley Reading MA},
year = 1990
}
@ARTICLE{citeulike_937376,
abstract = {We present simple output-sensitive algorithms that
construct the convex hull of a set of n points in two
or three dimensions in worst-case optimal O(n log h)
time and O(n) space, where h denotes the number of
vertices of the convex hull. 1 Introduction Given a set
P of n points in the Euclidean plane E 2 or Euclidean
space E 3 , we consider the problem of computing the
convex hull of P , conv(P ), which is defined as the
smallest convex set containing P . The convex hull
problem has...},
author = {T.M. Chan},
citeulike-article-id = {937376},
journal = {GEOMETRY: Discrete \& Computational Geometry},
keywords = {convex hull output sensitive},
priority = {2},
title = {Optimal Output-Sensitive Convex Hull Algorithms in Two
and Three Dimensions},
url = {http://citeseer.ist.psu.edu/181154.html},
volume = {16},
year = {1996}
}
@ARTICLE{citeulike_910101,
abstract = {A survey of the development of the marching cubes
algorithm [W. Lorensen, H. Cline, Marching cubes: a
high resolution 3D surface construction algorithm.
Computer Graphics 1987; 21(4):163-9], a well-known
cell-by-cell method for extraction of isosurfaces from
scalar volumetric data sets, is presented. The paper's
primary aim is to survey the development of the
algorithm and its computational properties, extensions,
and limitations (including the attempts to resolve its
limitations). A rich body of publications related to
this aim are included. Representative applications and
spin-off work are also considered and related
techniques are briefly discussed.},
author = {T.~S. Newman and H. Yi},
citeulike-article-id = {910101},
doi = {10.1016/j.cag.2006.07.021},
journal = {Computers \& Graphics},
keywords = {marching-cubes},
month = OCT,
number = {5},
pages = {854--879},
priority = {2},
title = {A survey of the marching cubes algorithm},
url = {http://dx.doi.org/10.1016/j.cag.2006.07.021},
volume = {30},
year = {2006}
}
@ARTICLE{megiddo_LP,
address = {New York, NY, USA},
author = {Nimrod Megiddo},
citeulike-article-id = {579334},
doi = {10.1145/2422.322418},
issn = {0004-5411},
journal = {J. ACM},
keywords = {computationalgeometry hyperplane lp},
month = JAN,
number = {1},
pages = {114--127},
priority = {0},
publisher = {ACM Press},
title = {Linear Programming in Linear Time When the Dimension
Is Fixed},
url = {http://portal.acm.org/citation.cfm?id=322418},
volume = {31},
year = {1984}
}
@ARTICLE{citeulike_613266,
abstract = {Digital geometry is very different from Euclidean
geometry in many ways and the intersection of two
digital lines or planes is often used to illustrate
those differences. Nevertheless, while digital lines
and planes are widely studied in many areas, very few
works deal with the intersection of such objects. In
this paper, we investigate the geometrical and
arithmetical properties of those objects. More
precisely, we give some new results about the
connectivity, periodicity, and minimal parameters of
the intersection of two digital lines or planes.},
author = {Isabelle Sivignon and Florent Dupont and Jean-Marc
Chassery},
citeulike-article-id = {613266},
doi = {10.1016/j.gmod.2004.05.002},
journal = {Graphical Models},
keywords = {digital intersection line},
month = JUL,
number = {4},
pages = {226--244},
priority = {0},
title = {Digital Intersections: minimal carrier, connectivity,
and periodicity properties},
url = {http://dx.doi.org/10.1016/j.gmod.2004.05.002},
volume = {66},
year = {2004}
}
@ARTICLE{citeulike_611268,
abstract = {A digital arc is called \‘straight\’ if it
is the digitization of a straight line segment. Since
the concept of digital straightness was introduced in
the mid-1970s, dozens of papers on the subject have
appeared; many characterizations of digital straight
lines have been formulated, and many algorithms for
determining whether a digital arc is straight have been
defined. This paper reviews the literature on digital
straightness and discusses its relationship to other
concepts of geometry, the theory of words, and number
theory.},
author = {R. Klette and A. Rosenfeld},
booktitle = {The 2001 International Workshop on Combinatorial Image
Analysis},
citeulike-article-id = {611268},
doi = {10.1016/j.dam.2002.12.001},
journal = {Discrete Applied Mathematics},
keywords = {dss},
month = APR,
number = {1-3},
pages = {197--230},
priority = {0},
title = {Digital straightness--a review},
url = {http://dx.doi.org/10.1016/j.dam.2002.12.001},
volume = {139},
year = {2004}
}
@PHDTHESIS{debled,
author = {I. {Debled-Rennesson}},
citeulike-article-id = 605447,
keywords = {bibtex-import hyperplane interger iwcia2006 plane
programming recognition},
priority = 0,
school = {Universit{\'e} Louis Pasteur},
title = {Etude et reconnaissance des droites et plans
discrets},
year = 1995
}
@ARTICLE{dcoeurjo_digitalarc_DAM,
author = {D. Coeurjolly and Y. Gerard and J. P. Reveill$BGe(Band L.
Tougne},
citeulike-article-id = {605388},
journal = {Discrete Applied Mathematics},
keywords = {bibtex-import perso},
number = {1-3},
pages = {31--50},
priority = {0},
title = {An elementary algorithm for digital arc segmentation},
volume = {139},
year = {2004}
}
@INPROCEEDINGS{dcoeurjo_TFCV_graphe,
author = {I. Sivignon and D. Coeurjolly},
booktitle = {Theoretical Foundations of Computer Vision
{}
}
@ARTICLE{dcoeurjo_preimage_DAM,
author = {D. Coeurjolly and I. Sivignon and F. Dupont and F.
Feschet and J. M. Chassery},
citeulike-article-id = {605375},
editor = {Elsevier Science},
journal = {Discrete Applied Mathematics},
keywords = {bibtex-import perso},
number = {1--3},
pages = {78--92},
priority = {2},
title = {On Digital plane preimage structure},
volume = {151},
year = {2005}
}
@INPROCEEDINGS{dcoeurjo_spie_mc,
address = {San Jose, USA},
author = {D. Coeurjolly and Alexis Guillaume and I. Sivignon},
booktitle = {SPIE Vision Geometry XII},
citeulike-article-id = {605370},
keywords = {bibtex-import perso},
pages = {1--11},
priority = {2},
title = {Reversible discrete volume polyhedrization using
Marching Cubes simplification},
volume = {5300},
year = {2004}
}
@INPROCEEDINGS{dcoeurjo_supercover_dgci,
author = {D. Coeurjolly},
booktitle = {12th International Conference on Discrete Geometry for
Computer Imagery},
citeulike-article-id = {605368},
editor = {E. Andres and G. Damiand and P. Lienhardt},
keywords = {bibtex-import perso},
pages = {311--322},
priority = {2},
publisher = {Springer-Verlag},
series = {Lecture Notes in Computer Science},
title = {Supercover Model and Digital Straight Line Recognition
on Irregular Isothetic Grids},
volume = {3429},
year = {2005}
}
@ARTICLE{dcoeurjo_computergraphics,
author = {D. Coeurjolly and L. Zerarga},
citeulike-article-id = {605367},
journal = {Computer and Graphics},
keywords = {bibtex-import perso},
number = {1},
pages = {46--53},
priority = {2},
title = {Supercover model, digital straight line recognition
and curve reconstruction on the irregular isothetic
grids},
volume = {30},
year = {2006}
}
@ARTICLE{dcoeurjo_planarity,
author = {V. Brimkov and D. Coeurjolly and R. Klette},
citeulike-article-id = {605366},
comment = {accepted for publication},
journal = {Discrete Applied Mathematics},
keywords = {bibtex-import perso},
priority = {2},
title = {Digital Planarity - a review},
year = {2006}
}
@INPROCEEDINGS{dcoeurjo_iwcia2006,
author = {D. Coeurjolly and V. Brimkov},
booktitle = {11th International Workshop on Combinatorial Image
Analysis},
citeulike-article-id = {605365},
keywords = {bibtex-import perso},
priority = {2},
publisher = {Springer-Verlag},
series = {LNCS},
title = {Computational aspects of Digital Plane and Hyperplane
Recognition},
year = {2006}
}
@BOOK{Grunbaum,
author = {B. Grunbaum and G. C. Shephard},
title = {Tilings and Patterns},
year = {1987},
publisher = {Freeman},
address = {San Francisco, CA}
}
@ARTICLE{Andres_hypersphere,
author = {E. Andr{\`e}s and M.-A. Jacob},
title = {The Discrete Analytical Hyperspheres:},
journal = {IEEE Transactions on Visualization and Computer
Graphics},
volume = 3,
number = 1,
pages = {75--86},
month = JAN # {\slash } # MAR,