• No results found

Discrete tomography with two directions Dalen, B.E. van

N/A
N/A
Protected

Academic year: 2021

Share "Discrete tomography with two directions Dalen, B.E. van"

Copied!
9
0
0

Bezig met laden.... (Bekijk nu de volledige tekst)

Hele tekst

(1)

Discrete tomography with two directions

Dalen, B.E. van

Citation

Dalen, B. E. van. (2011, September 20). Discrete tomography with two directions. Retrieved from https://hdl.handle.net/1887/17845

Version: Not Applicable (or Unknown)

License: Leiden University Non-exclusive license Downloaded from: https://hdl.handle.net/1887/17845

Note: To cite this publication please use the final published version (if

applicable).

(2)

Discrete tomography with two directions

Proefschrift

ter verkrijging van

de graad van Doctor aan de Universiteit Leiden, op gezag van Rector Magnificus prof.mr. P.F. van der Heijden,

volgens besluit van het College voor Promoties te verdedigen op dinsdag 20 september 2011

klokke 15:00 uur

door

Birgit Ellen van Dalen

geboren te ’s-Gravenhage in 1984

(3)

Samenstelling van de promotiecommissie

Promotoren prof.dr. R. Tijdeman

prof.dr. K.J. Batenburg (Centrum Wiskunde & Informatica, Universiteit Antwerpen) Overige leden

prof.dr. S.J. Edixhoven prof.dr. H.W. Lenstra, Jr.

prof.dr. A. Schrijver (Centrum Wiskunde & Informatica) prof.dr. P. Stevenhagen

(4)

Discrete tomography with two directions

Birgit van Dalen

(5)

ISBN/EAN 9789461081803 Birgit van Dalen, Leiden, 2011c bevandalen@gmail.com

Typeset using LATEX

Printed by Gildeprint Drukkerijen, Enschede Cover design by Ad van den Broek

(6)

Contents

1 Introduction 1

1.1 Discrete tomography . . . 1

1.2 Applications . . . 2

1.3 Two directions . . . 3

1.4 Stability . . . 4

1.5 Difference between reconstructions . . . 5

1.6 Boundary length . . . 7

1.7 Shape of binary images . . . 9

1.8 Overview . . . 9

2 Stability results for uniquely determined sets 11 2.1 Introduction . . . 11

2.2 Notation and statement of the problems . . . 12

2.3 Staircases . . . 14

2.4 A new bound for the disjoint case . . . 17

2.5 Two bounds for general α . . . 19

(7)

vi

2.6 Generalisation to unequal sizes . . . 29

3 Upper bounds for the difference between reconstructions 31 3.1 Introduction . . . 31

3.2 Notation . . . 32

3.3 Some lemmas . . . 33

3.4 Uniquely determined neighbours . . . 35

3.5 Sets with equal line sums . . . 38

3.6 Sets with different line sums . . . 41

3.7 Concluding remarks . . . 46

4 A lower bound on the largest possible difference 47 4.1 Introduction . . . 47

4.2 Definitions and notation . . . 48

4.3 Main result . . . 49

4.4 Proof . . . 50

4.5 Example . . . 53

5 Minimal boundary length of a reconstruction 57 5.1 Introduction . . . 57

5.2 Definitions and notation . . . 59

5.3 The main theorem . . . 60

5.4 Some examples and a corollary . . . 63

5.5 An extension . . . 67

(8)

vii

6 Reconstructions with small boundary 81

6.1 Introduction . . . 81

6.2 Definitions and notation . . . 82

6.3 The construction . . . 83

6.4 Boundary length of the constructed solution . . . 90

6.5 Examples . . . 94

6.6 Generalising the results for arbitrary c1 and r1 . . . 97

7 Boundary and shape of binary images 99 7.1 Introduction . . . 99

7.2 Definitions and notation . . . 100

7.3 Largest connected component . . . 101

7.4 Balls of ones in the image . . . 108

Bibliography 115 Samenvatting 119 1 Binaire plaatjes en Japanse puzzels . . . 119

2 Onoplosbare puzzels . . . 121

3 Saaie puzzels . . . 124

4 Puzzels met meerdere oplossingen . . . 125

5 Rand . . . 128

Curriculum Vitae 131

(9)

viii

Referenties

GERELATEERDE DOCUMENTEN

In this chapter we consider the complementary problem: find the best lower bound for the symmetric difference between two solutions that you can at least achieve given a set

The first bound does not use the actual value of the nonzero line sums at all, while the second bound only uses the column sums to estimate the length of the vertical boundary and

Then after moving the ones in column j, the length of the horizontal boundary in this column is equal to 4... Now suppose that I does not consist of

Each cell at distance i from the boundary, i ≥ 1, has at least one neighbour at distance i − 1 from the boundary, hence the number of cells at distance i from the boundary is at

Gerbrands, A network flow approach to reconstruction of the left ventricle from two projections, Computer Graphics and Image Processing 18 (1982) 18-36... Wang, Characterization

Dat betekent dat er altijd minstens 6 zwarte vakjes in de eerste rij zijn die boven een wit vakje in de tweede rij zitten (want er kunnen er maar 4 van de 10 boven een zwart

Na als scholier drie jaar te hebben deelgenomen aan het het trainingsprogramma voor de International Mathematical Olympiad (IMO) en in 2002 een eervolle vermelding behaald te hebben

Hoewel filelezers regelmatig aankondigen dat ze “de files van 7 km of langer of die met een bijzondere oorzaak” zullen noemen, noemen ze dan in feite altijd “de files van 7 km of