Effective computational geometry for curves and surfaces: with 1 table
Gespeichert in:
Format: | Buch |
---|---|
Sprache: | English |
Veröffentlicht: |
Berlin [u.a.]
Springer
2007
|
Schriftenreihe: | Mathematics and visualization
|
Schlagworte: | |
Online-Zugang: | Inhaltsverzeichnis |
Beschreibung: | XII, 343 S. Ill., graph. Darst. |
ISBN: | 3540332588 9783540332589 |
Internformat
MARC
LEADER | 00000nam a2200000 c 4500 | ||
---|---|---|---|
001 | BV021745678 | ||
003 | DE-604 | ||
005 | 20110617 | ||
007 | t | ||
008 | 060927s2007 gw ad|| |||| 00||| eng d | ||
015 | |a 06,N22,0871 |2 dnb | ||
016 | 7 | |a 979593913 |2 DE-101 | |
020 | |a 3540332588 |c Gb. : ca. EUR 85.55 (freier Pr.), ca. sfr 135.50 (freier Pr.) |9 3-540-33258-8 | ||
020 | |a 9783540332589 |9 978-3-540-33258-9 | ||
035 | |a (OCoLC)180913715 | ||
035 | |a (DE-599)BVBBV021745678 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
044 | |a gw |c XA-DE-BE | ||
049 | |a DE-29T |a DE-824 |a DE-384 |a DE-91G |a DE-11 |a DE-20 | ||
084 | |a SK 380 |0 (DE-625)143235: |2 rvk | ||
084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
084 | |a ST 320 |0 (DE-625)143657: |2 rvk | ||
084 | |a MAT 140f |2 stub | ||
084 | |a 510 |2 sdnb | ||
084 | |a DAT 756f |2 stub | ||
245 | 1 | 0 | |a Effective computational geometry for curves and surfaces |b with 1 table |c Jean D. Boissonnat ... eds. |
264 | 1 | |a Berlin [u.a.] |b Springer |c 2007 | |
300 | |a XII, 343 S. |b Ill., graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 0 | |a Mathematics and visualization | |
650 | 4 | |a Datenverarbeitung | |
650 | 7 | |a Computational geometry. |2 gtt | |
650 | 7 | |a Computergraphics. |2 gtt | |
650 | 4 | |a Courbes sur les surfaces | |
650 | 4 | |a Curves on surfaces | |
650 | 4 | |a Geometry |x Data processing | |
650 | 4 | |a Geometry, Differential | |
650 | 4 | |a Géométrie différentielle | |
650 | 4 | |a Géométrie |x Informatique | |
650 | 7 | |a Krommen. |2 gtt | |
650 | 7 | |a Oppervlakken. |2 gtt | |
650 | 7 | |a Visualisatie. |2 gtt | |
650 | 0 | 7 | |a Algorithmische Geometrie |0 (DE-588)4130267-9 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Fläche |0 (DE-588)4129864-0 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Kurve |0 (DE-588)4033824-1 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Kurve |0 (DE-588)4033824-1 |D s |
689 | 0 | 1 | |a Algorithmische Geometrie |0 (DE-588)4130267-9 |D s |
689 | 0 | |5 DE-604 | |
689 | 1 | 0 | |a Fläche |0 (DE-588)4129864-0 |D s |
689 | 1 | 1 | |a Algorithmische Geometrie |0 (DE-588)4130267-9 |D s |
689 | 1 | |5 DE-604 | |
700 | 1 | |a Boissonnat, Jean-Daniel |d 1953- |e Sonstige |0 (DE-588)111656990 |4 oth | |
856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=014958956&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
999 | |a oai:aleph.bib-bvb.de:BVB01-014958956 |
Datensatz im Suchindex
_version_ | 1804135599849865216 |
---|---|
adam_text | JEAN-DANIEL BOISSONNAT
MONIQU
E TEILLAUD
EDITORS
EFFECTIVE COMPUTATIONAL
GEOMETRY FOR CURVES
AND SURFACES
WITH 120 FIGURES AND I TABLE
^
J SPRINGER
CONTENTS
1 ARRANGEMENTS
EFI FOGEL, DAN HALPERIN*. LUTZ KETTNER, MONIQUE TEILLAUD, RON WEIN,
NICOLA WOLPERT
1
1.1 INTRODUCTIO
N 1
1.2 CHRONICLES 3
1.3 EXACT CONSTRUCTIO
N OF PLANA
R ARRANGEMENTS 5
1.3.1 CONSTRUCTIO
N BY SWEEPING 7
1.3.2 INCREMENTAL CONSTRUCTION 20
1.4 SOFTWARE FOR PLANA
R ARRANGEMENTS 25
1.4.1 TH
E
CGA
L
ARRANGEMENTS PACKAGE 26
1.4.2 ARRANGEMENTS TRAITS 33
1.4.3 TRAITS CLASSES FROM
EXACU
S
36
1.4.4 AN EMERGING
CGA
L
CURVED KERNEL 38
1.4.5 HOW TO SPEED UP YOUR ARRANGEMENT COMPUTATIO
N IN
CGA
L
. . 40
1.5 EXACT CONSTRUCTION IN 3-SPACE 41
1.5.1 SWEEPING ARRANGEMENTS OF SURFACES 41
1.5.2 ARRANGEMENTS OF QUADRICS IN 3D 45
1.6 CONTROLLED PERTURBATION
: FIXED-PRECISION APPROXIMATION OF
ARRANGEMENTS 50
1.7 APPLICATIONS 53
1.7.1 BOOLEAN OPERATIONS ON GENERALIZED POLYGONS 53
1.7.2 MOTION PLANNIN
G FOR DISCS 57
1.7.3 LOWER ENVELOPES FOR PAT
H VERIFICATION IN MULTI-AXIS
NC-MACHINING 59
1.7.4 MAXIMAL AXIS-SYMMETRIC POLYGON CONTAINED IN A SIMPLE
POLYGON 62
1.7.5 MOLECULAR SURFACES 63
1.7.6 ADDITIONAL APPLICATIONS 64
1.8 FURTHE
R READING AND OPEN PROBLEMS 66
X CONTENTS
2 CURVE
D VORONO
I DIAGRAM
S
JEAN-DANIEL BOISSONNAT*, CAMILLE WORMSER, MARIETTE YVINEC
67
2.1 INTRODUCTIO
N 68
2.2 LOWER ENVELOPES AN
D MINIMIZATION DIAGRAM
S 70
2.3 AFFINE VORONOI DIAGRAM
S 72
2.3.1 EUCLIDEAN VORONOI DIAGRAMS OF POINT
S 72
2.3.2 DELAUNAY TRIANGULATIO
N 74
2.3.3 POWER DIAGRAM
S 78
2.4 VORONOI DIAGRAMS WIT
H ALGEBRAIC BISECTORS 81
2.4.1 MOBIUS DIAGRAMS 81
2.4.2 ANISOTROPIC DIAGRAMS 86
2.4.3 APOLLONIUS DIAGRAMS 88
2.5 LINEARIZATION 92
2.5.1 ABSTRAC
T DIAGRAMS 92
2.5.2 INVERSE PROBLEM 97
2.6 INCREMENTAL VORONOI ALGORITHMS 99
2.6.1 PLANA
R EUCLIDEAN DIAGRAMS 101
2.6.2 INCREMENTAL CONSTRUCTIO
N 101
2.6.3 TH
E VORONOI HIERARCHY 106
2.7 MEDIAL AXIS 109
2.7.1 MEDIAL AXIS AN
D LOWER ENVELOPE 110
2.7.2 APPROXIMATION OF TH
E MEDIAL AXIS 110
2.8 VORONOI DIAGRAMS IN CGAL 114
2.9 APPLICATIONS 115
3 ALGEBRAI
C ISSUE
S I
N COMPUTATIONA
L GEOMETR
Y
BERNARD MOURRAIN*
,
SYLVAIN PION, SUSANNE SCHMITT, JEAN-PIERRE
TECOURT, ELIAS TSIGARIDAS, NICOLA WOLPERT
117
3.1 INTRODUCTIO
N 117
3.2 COMPUTER
S AND NUMBERS 118
3.2.1 MACHINE FLOATIN
G POINT NUMBERS
: TH
E IEE
E 754 NORM 119
3.2.2 INTERVAL ARITHMETI
C 120
3.2.3 FILTERS 121
3.3 EFFECTIVE REAL NUMBER
S 123
3.3.1 ALGEBRAIC NUMBERS 124
3.3.2 ISOLATING INTERVAL REPRESENTATIO
N OF REAL ALGEBRAIC NUMBER
S . . 125
3.3.3 SYMBOLIC REPRESENTATIO
N OF REAL ALGEBRAIC NUMBER
S 125
3.4 COMPUTIN
G WITH ALGEBRAIC NUMBERS 126
3.4.1 RESULTANT 126
3.4.2 ISOLATION 131
3.4.3 ALGEBRAIC NUMBERS OF SMALL DEGREE 136
3.4.4 COMPARISON 138
3.5 MULTIVARIATE PROBLEMS 140
3.6 TOPOLOGY OF PLANA
R IMPLICIT CURVES 142
3.6.1 TH
E ALGORITHM FROM A GEOMETRIC POINT OF VIEW 143
CONTENTS XI
3.6.2 ALGEBRAIC INGREDIENTS 144
3.6.3 HOW T
O AVOID GENERICITY CONDITIONS 145
3.7 TOPOLOGY OF 3D IMPLICIT CURVES 146
3.7.1 CRITICAL POINTS AND GENERIC POSITION 147
3.7.2 TH
E PROJECTED CURVES 148
3.7.3 LIFTING A POINT OF TH
E PROJECTED CURVE 149
3.7.4 COMPUTING POINTS OF TH
E CURVE ABOVE CRITICAL VALUES 151
3.7.5 CONNECTING TH
E BRANCHES 152
3.7.6 TH
E ALGORITHM 153
3.8 SOFTWARE 154
4 DIFFERENTIA
L GEOMETR
Y O
N DISCRET
E SURFACE
S
DAVID COHEN-STEINER, JEAN-MARIE MORVAN*
157
4.1 GEOMETRIC PROPERTIE
S OF SUBSETS OF POINTS 157
4.2 LENGTH AN
D CURVATURE OF A CURVE 158
4.2.1 TH
E LENGTH OF CURVES 158
4.2.2 TH
E CURVATURE OF CURVES 159
4.3 TH
E AREA OF A SURFACE 161
4.3.1 DEFINITION OF TH
E AREA 161
4.3.2 AN APPROXIMATION THEOREM 162
4.4 CURVATURE
S OF SURFACES 164
4.4.1 THE SMOOTH CASE 164
4.4.2 POINTWISE APPROXIMATION OF TH
E GAUSSIAN CURVATUR
E 165
4.4.3 FROM POINTWISE T
O LOCAL 167
4.4.4 ANISOTROPIC CURVATUR
E MEASURES 174
4.4.5 E-SAMPLES ON A SURFACE 178
4.4.6 APPLICATION 179
5 MESHIN
G O
F SURFACE
S
JEAN-DANIEL BOISSONNAT, DAVID COHEN-STEINER. BERNARD MOURRAIN.
GTINTER ROTE*, GERT VEGTER
181
5.1 INTRODUCTION
: WHA
T IS MESHING? 181
5.1.1 OVERVIEW 187
5.2 MARCHING CUBES AND CUBE-BASED ALGORITHMS 188
5.2.1 CRITERI
A FOR A CORRECT MESH INSIDE A CUB
E 190
5.2.2 INTERVAL ARITHMETIC FOR ESTIMATIN
G TH
E RANGE OF A FUNCTION . . . 190
5.2.3 GLOBAL PARAMETERIZABILITY: SNYDER S ALGORITHM 191
5.2.4 SMALL NORMAL VARIATION 196
5.3 DELAUNAY REFINEMENT ALGORITHMS 201
5.3.1 USING TH
E LOCAL FEATURE SIZE 202
5.3.2 USING CRITICAL POINTS 209
5.4 A SWEEP ALGORITHM 213
5.4.1 MESHING A CURVE 215
5.4.2 MESHING A SURFACE 216
5.5 OBTAININ
G A CORRECT MESH BY MORSE THEORY 223
5.5.1 SWEEPING THROUGH PARAMETE
R SPACE 223
XII CONTENTS
5.5.2 PIECEWISE-LINEAR INTERPOLATIO
N OF TH
E DENNING FUNCTION 224
5.6 RESEARCH PROBLEMS 227
6 DELAUNA
Y TRIANGULATIO
N BASE
D SURFAC
E RECONSTRUCTIO
N
FREDERIC CAZALS, JOACHIM GIESEN
231
6.1 INTRODUCTIO
N 231
6.1.1 SURFACE RECONSTRUCTION 231
6.1.2 APPLICATIONS 231
6.1.3 RECONSTRUCTION USING TH
E DELAUNAY TRIANGULATION 232
6.1.4 A CLASSIFICATION OF DELAUNAY BASED SURFACE RECONSTRUCTION
METHODS 233
6.1.5 ORGANIZATION OF TH
E CHAPTE
R 234
6.2 PREREQUISITES 234
6.2.1 DELAUNAY TRIANGULATIONS, VORONOI DIAGRAMS AND RELATED
CONCEPTS 234
6.2.2 MEDIAL AXIS AN
D DERIVED CONCEPTS 244
6.2.3 TOPOLOGICAL AND GEOMETRIC EQUIVALENCES 249
6.2.4 EXERCISES 252
6.3 OVERVIEW OF TH
E ALGORITHMS 253
6.3.1 TANGENT PLAN
E BASED METHOD
S 253
6.3.2 RESTRICTED DELAUNAY BASED METHOD
S 257
6.3.3 INSIDE / OUTSID
E LABELING 261
6.3.4 EMPTY BALLS METHODS 268
6.4 EVALUATING SURFACE RECONSTRUCTION ALGORITHMS 271
6.5 SOFTWARE 272
6.6 RESEARCH PROBLEMS 273
7 COMPUTATIONA
L TOPOLOGY
: A
N INTRODUCTIO
N
GIINTER ROTE, GERT VEGTER*
277
7.1 INTRODUCTION 277
7.2 SIMPLICIAL COMPLEXES 278
7.3 SIMPLICIAL HOMOLOGY 282
7.4 MORSE THEORY 295
7.4.1 SMOOTH FUNCTIONS AND MANIFOLDS 295
7.4.2 BASIC RESULTS FROM MORSE THEORY 300
7.5 EXERCISES 310
8 APPENDI
X
-
GENERI
C PROGRAMMIN
G AN
D TH
E
CGA
L
LIBRAR
Y
EFI FOGEL. MONIQUE TEILLAUD
313
8.1 THE
CGA
L
OPEN SOURCE PROJEC
T 313
8.2 GENERIC PROGRAMMIN
G 314
8.3 GEOMETRIC PROGRAMMIN
G AND
CGA
L
316
8.4
CGA
L
CONTENTS 318
REFERENCE
S
321
INDE
X
34
1
|
adam_txt |
JEAN-DANIEL BOISSONNAT
MONIQU
E TEILLAUD
EDITORS
EFFECTIVE COMPUTATIONAL
GEOMETRY FOR CURVES
AND SURFACES
WITH 120 FIGURES AND I TABLE
^
J SPRINGER
CONTENTS
1 ARRANGEMENTS
EFI FOGEL, DAN HALPERIN*. LUTZ KETTNER, MONIQUE TEILLAUD, RON WEIN,
NICOLA WOLPERT
1
1.1 INTRODUCTIO
N 1
1.2 CHRONICLES 3
1.3 EXACT CONSTRUCTIO
N OF PLANA
R ARRANGEMENTS 5
1.3.1 CONSTRUCTIO
N BY SWEEPING 7
1.3.2 INCREMENTAL CONSTRUCTION 20
1.4 SOFTWARE FOR PLANA
R ARRANGEMENTS 25
1.4.1 TH
E
CGA
L
ARRANGEMENTS PACKAGE 26
1.4.2 ARRANGEMENTS TRAITS 33
1.4.3 TRAITS CLASSES FROM
EXACU
S
36
1.4.4 AN EMERGING
CGA
L
CURVED KERNEL 38
1.4.5 HOW TO SPEED UP YOUR ARRANGEMENT COMPUTATIO
N IN
CGA
L
. . 40
1.5 EXACT CONSTRUCTION IN 3-SPACE 41
1.5.1 SWEEPING ARRANGEMENTS OF SURFACES 41
1.5.2 ARRANGEMENTS OF QUADRICS IN 3D 45
1.6 CONTROLLED PERTURBATION
: FIXED-PRECISION APPROXIMATION OF
ARRANGEMENTS 50
1.7 APPLICATIONS 53
1.7.1 BOOLEAN OPERATIONS ON GENERALIZED POLYGONS 53
1.7.2 MOTION PLANNIN
G FOR DISCS 57
1.7.3 LOWER ENVELOPES FOR PAT
H VERIFICATION IN MULTI-AXIS
NC-MACHINING 59
1.7.4 MAXIMAL AXIS-SYMMETRIC POLYGON CONTAINED IN A SIMPLE
POLYGON 62
1.7.5 MOLECULAR SURFACES 63
1.7.6 ADDITIONAL APPLICATIONS 64
1.8 FURTHE
R READING AND OPEN PROBLEMS 66
X CONTENTS
2 CURVE
D VORONO
I DIAGRAM
S
JEAN-DANIEL BOISSONNAT*, CAMILLE WORMSER, MARIETTE YVINEC
67
2.1 INTRODUCTIO
N 68
2.2 LOWER ENVELOPES AN
D MINIMIZATION DIAGRAM
S 70
2.3 AFFINE VORONOI DIAGRAM
S 72
2.3.1 EUCLIDEAN VORONOI DIAGRAMS OF POINT
S 72
2.3.2 DELAUNAY TRIANGULATIO
N 74
2.3.3 POWER DIAGRAM
S 78
2.4 VORONOI DIAGRAMS WIT
H ALGEBRAIC BISECTORS 81
2.4.1 MOBIUS DIAGRAMS 81
2.4.2 ANISOTROPIC DIAGRAMS 86
2.4.3 APOLLONIUS DIAGRAMS 88
2.5 LINEARIZATION 92
2.5.1 ABSTRAC
T DIAGRAMS 92
2.5.2 INVERSE PROBLEM 97
2.6 INCREMENTAL VORONOI ALGORITHMS 99
2.6.1 PLANA
R EUCLIDEAN DIAGRAMS 101
2.6.2 INCREMENTAL CONSTRUCTIO
N 101
2.6.3 TH
E VORONOI HIERARCHY 106
2.7 MEDIAL AXIS 109
2.7.1 MEDIAL AXIS AN
D LOWER ENVELOPE 110
2.7.2 APPROXIMATION OF TH
E MEDIAL AXIS 110
2.8 VORONOI DIAGRAMS IN CGAL 114
2.9 APPLICATIONS 115
3 ALGEBRAI
C ISSUE
S I
N COMPUTATIONA
L GEOMETR
Y
BERNARD MOURRAIN*
,
SYLVAIN PION, SUSANNE SCHMITT, JEAN-PIERRE
TECOURT, ELIAS TSIGARIDAS, NICOLA WOLPERT
117
3.1 INTRODUCTIO
N 117
3.2 COMPUTER
S AND NUMBERS 118
3.2.1 MACHINE FLOATIN
G POINT NUMBERS
: TH
E IEE
E 754 NORM 119
3.2.2 INTERVAL ARITHMETI
C 120
3.2.3 FILTERS 121
3.3 EFFECTIVE REAL NUMBER
S 123
3.3.1 ALGEBRAIC NUMBERS 124
3.3.2 ISOLATING INTERVAL REPRESENTATIO
N OF REAL ALGEBRAIC NUMBER
S . . 125
3.3.3 SYMBOLIC REPRESENTATIO
N OF REAL ALGEBRAIC NUMBER
S 125
3.4 COMPUTIN
G WITH ALGEBRAIC NUMBERS 126
3.4.1 RESULTANT 126
3.4.2 ISOLATION 131
3.4.3 ALGEBRAIC NUMBERS OF SMALL DEGREE 136
3.4.4 COMPARISON 138
3.5 MULTIVARIATE PROBLEMS 140
3.6 TOPOLOGY OF PLANA
R IMPLICIT CURVES 142
3.6.1 TH
E ALGORITHM FROM A GEOMETRIC POINT OF VIEW 143
CONTENTS XI
3.6.2 ALGEBRAIC INGREDIENTS 144
3.6.3 HOW T
O AVOID GENERICITY CONDITIONS 145
3.7 TOPOLOGY OF 3D IMPLICIT CURVES 146
3.7.1 CRITICAL POINTS AND GENERIC POSITION 147
3.7.2 TH
E PROJECTED CURVES 148
3.7.3 LIFTING A POINT OF TH
E PROJECTED CURVE 149
3.7.4 COMPUTING POINTS OF TH
E CURVE ABOVE CRITICAL VALUES 151
3.7.5 CONNECTING TH
E BRANCHES 152
3.7.6 TH
E ALGORITHM 153
3.8 SOFTWARE 154
4 DIFFERENTIA
L GEOMETR
Y O
N DISCRET
E SURFACE
S
DAVID COHEN-STEINER, JEAN-MARIE MORVAN*
157
4.1 GEOMETRIC PROPERTIE
S OF SUBSETS OF POINTS 157
4.2 LENGTH AN
D CURVATURE OF A CURVE 158
4.2.1 TH
E LENGTH OF CURVES 158
4.2.2 TH
E CURVATURE OF CURVES 159
4.3 TH
E AREA OF A SURFACE 161
4.3.1 DEFINITION OF TH
E AREA 161
4.3.2 AN APPROXIMATION THEOREM 162
4.4 CURVATURE
S OF SURFACES 164
4.4.1 THE SMOOTH CASE 164
4.4.2 POINTWISE APPROXIMATION OF TH
E GAUSSIAN CURVATUR
E 165
4.4.3 FROM POINTWISE T
O LOCAL 167
4.4.4 ANISOTROPIC CURVATUR
E MEASURES 174
4.4.5 E-SAMPLES ON A SURFACE 178
4.4.6 APPLICATION 179
5 MESHIN
G O
F SURFACE
S
JEAN-DANIEL BOISSONNAT, DAVID COHEN-STEINER. BERNARD MOURRAIN.
GTINTER ROTE*, GERT VEGTER
181
5.1 INTRODUCTION
: WHA
T IS MESHING? 181
5.1.1 OVERVIEW 187
5.2 MARCHING CUBES AND CUBE-BASED ALGORITHMS 188
5.2.1 CRITERI
A FOR A CORRECT MESH INSIDE A CUB
E 190
5.2.2 INTERVAL ARITHMETIC FOR ESTIMATIN
G TH
E RANGE OF A FUNCTION . . . 190
5.2.3 GLOBAL PARAMETERIZABILITY: SNYDER'S ALGORITHM 191
5.2.4 SMALL NORMAL VARIATION 196
5.3 DELAUNAY REFINEMENT ALGORITHMS 201
5.3.1 USING TH
E LOCAL FEATURE SIZE 202
5.3.2 USING CRITICAL POINTS 209
5.4 A SWEEP ALGORITHM 213
5.4.1 MESHING A CURVE 215
5.4.2 MESHING A SURFACE 216
5.5 OBTAININ
G A CORRECT MESH BY MORSE THEORY 223
5.5.1 SWEEPING THROUGH PARAMETE
R SPACE 223
XII CONTENTS
5.5.2 PIECEWISE-LINEAR INTERPOLATIO
N OF TH
E DENNING FUNCTION 224
5.6 RESEARCH PROBLEMS 227
6 DELAUNA
Y TRIANGULATIO
N BASE
D SURFAC
E RECONSTRUCTIO
N
FREDERIC CAZALS, JOACHIM GIESEN
231
6.1 INTRODUCTIO
N 231
6.1.1 SURFACE RECONSTRUCTION 231
6.1.2 APPLICATIONS 231
6.1.3 RECONSTRUCTION USING TH
E DELAUNAY TRIANGULATION 232
6.1.4 A CLASSIFICATION OF DELAUNAY BASED SURFACE RECONSTRUCTION
METHODS 233
6.1.5 ORGANIZATION OF TH
E CHAPTE
R 234
6.2 PREREQUISITES 234
6.2.1 DELAUNAY TRIANGULATIONS, VORONOI DIAGRAMS AND RELATED
CONCEPTS 234
6.2.2 MEDIAL AXIS AN
D DERIVED CONCEPTS 244
6.2.3 TOPOLOGICAL AND GEOMETRIC EQUIVALENCES 249
6.2.4 EXERCISES 252
6.3 OVERVIEW OF TH
E ALGORITHMS 253
6.3.1 TANGENT PLAN
E BASED METHOD
S 253
6.3.2 RESTRICTED DELAUNAY BASED METHOD
S 257
6.3.3 INSIDE / OUTSID
E LABELING 261
6.3.4 EMPTY BALLS METHODS 268
6.4 EVALUATING SURFACE RECONSTRUCTION ALGORITHMS 271
6.5 SOFTWARE 272
6.6 RESEARCH PROBLEMS 273
7 COMPUTATIONA
L TOPOLOGY
: A
N INTRODUCTIO
N
GIINTER ROTE, GERT VEGTER*
277
7.1 INTRODUCTION 277
7.2 SIMPLICIAL COMPLEXES 278
7.3 SIMPLICIAL HOMOLOGY 282
7.4 MORSE THEORY 295
7.4.1 SMOOTH FUNCTIONS AND MANIFOLDS 295
7.4.2 BASIC RESULTS FROM MORSE THEORY 300
7.5 EXERCISES 310
8 APPENDI
X
-
GENERI
C PROGRAMMIN
G AN
D TH
E
CGA
L
LIBRAR
Y
EFI FOGEL. MONIQUE TEILLAUD
313
8.1 THE
CGA
L
OPEN SOURCE PROJEC
T 313
8.2 GENERIC PROGRAMMIN
G 314
8.3 GEOMETRIC PROGRAMMIN
G AND
CGA
L
316
8.4
CGA
L
CONTENTS 318
REFERENCE
S
321
INDE
X
34
1 |
any_adam_object | 1 |
any_adam_object_boolean | 1 |
author_GND | (DE-588)111656990 |
building | Verbundindex |
bvnumber | BV021745678 |
classification_rvk | SK 380 ST 134 ST 320 |
classification_tum | MAT 140f DAT 756f |
ctrlnum | (OCoLC)180913715 (DE-599)BVBBV021745678 |
discipline | Informatik Mathematik |
discipline_str_mv | Informatik Mathematik |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02466nam a2200649 c 4500</leader><controlfield tag="001">BV021745678</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20110617 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">060927s2007 gw ad|| |||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">06,N22,0871</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">979593913</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540332588</subfield><subfield code="c">Gb. : ca. EUR 85.55 (freier Pr.), ca. sfr 135.50 (freier Pr.)</subfield><subfield code="9">3-540-33258-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783540332589</subfield><subfield code="9">978-3-540-33258-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)180913715</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021745678</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">XA-DE-BE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-20</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 380</subfield><subfield code="0">(DE-625)143235:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 320</subfield><subfield code="0">(DE-625)143657:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 140f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">510</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 756f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Effective computational geometry for curves and surfaces</subfield><subfield code="b">with 1 table</subfield><subfield code="c">Jean D. Boissonnat ... eds.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2007</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XII, 343 S.</subfield><subfield code="b">Ill., graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Mathematics and visualization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computational geometry.</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computergraphics.</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Courbes sur les surfaces</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Curves on surfaces</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Geometry</subfield><subfield code="x">Data processing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Geometry, Differential</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Géométrie différentielle</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Géométrie</subfield><subfield code="x">Informatique</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Krommen.</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Oppervlakken.</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Visualisatie.</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmische Geometrie</subfield><subfield code="0">(DE-588)4130267-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Fläche</subfield><subfield code="0">(DE-588)4129864-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kurve</subfield><subfield code="0">(DE-588)4033824-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Kurve</subfield><subfield code="0">(DE-588)4033824-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Algorithmische Geometrie</subfield><subfield code="0">(DE-588)4130267-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Fläche</subfield><subfield code="0">(DE-588)4129864-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Algorithmische Geometrie</subfield><subfield code="0">(DE-588)4130267-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Boissonnat, Jean-Daniel</subfield><subfield code="d">1953-</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)111656990</subfield><subfield code="4">oth</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=014958956&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-014958956</subfield></datafield></record></collection> |
id | DE-604.BV021745678 |
illustrated | Illustrated |
index_date | 2024-07-02T15:30:47Z |
indexdate | 2024-07-09T20:43:04Z |
institution | BVB |
isbn | 3540332588 9783540332589 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-014958956 |
oclc_num | 180913715 |
open_access_boolean | |
owner | DE-29T DE-824 DE-384 DE-91G DE-BY-TUM DE-11 DE-20 |
owner_facet | DE-29T DE-824 DE-384 DE-91G DE-BY-TUM DE-11 DE-20 |
physical | XII, 343 S. Ill., graph. Darst. |
publishDate | 2007 |
publishDateSearch | 2007 |
publishDateSort | 2007 |
publisher | Springer |
record_format | marc |
series2 | Mathematics and visualization |
spelling | Effective computational geometry for curves and surfaces with 1 table Jean D. Boissonnat ... eds. Berlin [u.a.] Springer 2007 XII, 343 S. Ill., graph. Darst. txt rdacontent n rdamedia nc rdacarrier Mathematics and visualization Datenverarbeitung Computational geometry. gtt Computergraphics. gtt Courbes sur les surfaces Curves on surfaces Geometry Data processing Geometry, Differential Géométrie différentielle Géométrie Informatique Krommen. gtt Oppervlakken. gtt Visualisatie. gtt Algorithmische Geometrie (DE-588)4130267-9 gnd rswk-swf Fläche (DE-588)4129864-0 gnd rswk-swf Kurve (DE-588)4033824-1 gnd rswk-swf Kurve (DE-588)4033824-1 s Algorithmische Geometrie (DE-588)4130267-9 s DE-604 Fläche (DE-588)4129864-0 s Boissonnat, Jean-Daniel 1953- Sonstige (DE-588)111656990 oth DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=014958956&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
spellingShingle | Effective computational geometry for curves and surfaces with 1 table Datenverarbeitung Computational geometry. gtt Computergraphics. gtt Courbes sur les surfaces Curves on surfaces Geometry Data processing Geometry, Differential Géométrie différentielle Géométrie Informatique Krommen. gtt Oppervlakken. gtt Visualisatie. gtt Algorithmische Geometrie (DE-588)4130267-9 gnd Fläche (DE-588)4129864-0 gnd Kurve (DE-588)4033824-1 gnd |
subject_GND | (DE-588)4130267-9 (DE-588)4129864-0 (DE-588)4033824-1 |
title | Effective computational geometry for curves and surfaces with 1 table |
title_auth | Effective computational geometry for curves and surfaces with 1 table |
title_exact_search | Effective computational geometry for curves and surfaces with 1 table |
title_exact_search_txtP | Effective computational geometry for curves and surfaces with 1 table |
title_full | Effective computational geometry for curves and surfaces with 1 table Jean D. Boissonnat ... eds. |
title_fullStr | Effective computational geometry for curves and surfaces with 1 table Jean D. Boissonnat ... eds. |
title_full_unstemmed | Effective computational geometry for curves and surfaces with 1 table Jean D. Boissonnat ... eds. |
title_short | Effective computational geometry for curves and surfaces |
title_sort | effective computational geometry for curves and surfaces with 1 table |
title_sub | with 1 table |
topic | Datenverarbeitung Computational geometry. gtt Computergraphics. gtt Courbes sur les surfaces Curves on surfaces Geometry Data processing Geometry, Differential Géométrie différentielle Géométrie Informatique Krommen. gtt Oppervlakken. gtt Visualisatie. gtt Algorithmische Geometrie (DE-588)4130267-9 gnd Fläche (DE-588)4129864-0 gnd Kurve (DE-588)4033824-1 gnd |
topic_facet | Datenverarbeitung Computational geometry. Computergraphics. Courbes sur les surfaces Curves on surfaces Geometry Data processing Geometry, Differential Géométrie différentielle Géométrie Informatique Krommen. Oppervlakken. Visualisatie. Algorithmische Geometrie Fläche Kurve |
url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=014958956&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
work_keys_str_mv | AT boissonnatjeandaniel effectivecomputationalgeometryforcurvesandsurfaceswith1table |