Triangulations and applications:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Berlin ; Heidelberg ; New York
Springer
2006
|
| Schriftenreihe: | Mathematics and visualization
|
| Schlagworte: | |
| Online-Zugang: | BTU01 TUM01 UBA01 UBM01 UBR01 UBT01 UPA01 Volltext Inhaltsverzeichnis |
| Beschreibung: | Literaturverz. S. 223 - 227 |
| Beschreibung: | 1 Online-Ressource (XI, 234 S.) graph. Darst. |
| ISBN: | 354033260X 9783540332602 9783540332619 |
| DOI: | 10.1007/3-540-33261-8 |
Internformat
MARC
| LEADER | 00000nmm a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV022377846 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 070404s2006 gw |||| o||u| ||||||eng d | ||
| 015 | |a 06,N20,0904 |2 dnb | ||
| 015 | |a 06,A44,0534 |2 dnb | ||
| 016 | 7 | |a 979440726 |2 DE-101 | |
| 020 | |a 354033260X |c Pp. : EUR 53.45 (freier Pr.) |9 3-540-33260-X | ||
| 020 | |a 9783540332602 |c Pp. : EUR 53.45 (freier Pr.) |9 978-3-540-33260-2 | ||
| 020 | |a 9783540332619 |c Online |9 978-3-540-33261-9 | ||
| 024 | 7 | |a 10.1007/3-540-33261-8 |2 doi | |
| 024 | 3 | |a 9783540332602 | |
| 028 | 5 | 2 | |a 11693598 |
| 035 | |a (OCoLC)873408114 | ||
| 035 | |a (DE-599)BVBBV022377846 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c XA-DE-BE | ||
| 049 | |a DE-739 |a DE-355 |a DE-634 |a DE-91 |a DE-384 |a DE-703 |a DE-83 |a DE-19 | ||
| 084 | |a SK 380 |0 (DE-625)143235: |2 rvk | ||
| 084 | |a MAT 000 |2 stub | ||
| 084 | |a 510 |2 sdnb | ||
| 100 | 1 | |a Hjelle, Øyvind |e Verfasser |0 (DE-588)132114976 |4 aut | |
| 245 | 1 | 0 | |a Triangulations and applications |c Øyvind Hjelle ; Morten Daehlen |
| 264 | 1 | |a Berlin ; Heidelberg ; New York |b Springer |c 2006 | |
| 300 | |a 1 Online-Ressource (XI, 234 S.) |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Mathematics and visualization | |
| 500 | |a Literaturverz. S. 223 - 227 | ||
| 650 | 0 | 7 | |a Triangulation |0 (DE-588)4186017-2 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Triangulation |0 (DE-588)4186017-2 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Daehlen, Morten |d 1959- |e Verfasser |0 (DE-588)115422390 |4 aut | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/3-540-33261-8 |x Verlag |3 Volltext |
| 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=015586887&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 912 | |a ZDB-2-SMA | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015586887 | ||
| 966 | e | |u https://doi.org/10.1007/3-540-33261-8 |l BTU01 |p ZDB-2-SMA |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/3-540-33261-8 |l TUM01 |p ZDB-2-SMA |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/3-540-33261-8 |l UBA01 |p ZDB-2-SMA |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/3-540-33261-8 |l UBM01 |p ZDB-2-SMA |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/3-540-33261-8 |l UBR01 |p ZDB-2-SMA |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/3-540-33261-8 |l UBT01 |p ZDB-2-SMA |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/3-540-33261-8 |l UPA01 |p ZDB-2-SMA |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804136433056743424 |
|---|---|
| adam_text | 0YVIN
D HJELLE
MORTEN DAEHLEN
TRIANGULATIONS
AND APPLICATIONS
WITH 126 FIGURES
J SPRINGE
R
CONTENTS
TRIANGLES AND TRIANGULATIONS
1
1.1 TRIANGLES , 1
1.2 TRIANGULATIONS 5
1.3 SOME PROPERTIES OF TRIANGULATIONS 7
1.4 A TRIANGULATION ALGORITHM 10
1.5 EDGE INSERTION 16
1.6 USING TRIANGULATIONS 18
1.7 EXERCISES 20
GRAPHS AND DAT
A STRUCTURE
S
23
2.1 GRAPH THEORETIC CONCEPTS 23
2.2 GENERALIZED MAPS (G-MAPS) 25
2.3 DATA STRUCTURES FOR TRIANGULATIONS 29
2.4 A MINIMAL TRIANGLE-BASED DATA STRUCTURE 31
2.5 TRIANGLE-BASED DATA STRUCTURE WITH NEIGHBORS 32
2.6 VERTEX-BASED DATA STRUCTURE WITH NEIGHBORS 33
2.7 HALF-EDGE DAT
A STRUCTURE 35
2.8 DART-BASED DATA STRUCTURE 37
2.9 TRIANGLES FOR VISUALIZATION 38
2.10 BINARY TRIANGULATIONS 41
2.11 EXERCISES 45
DELAUNA
Y TRIANGULATIONS AND VORONOI DIAGRAM
S
47
3.1 OPTIMAL TRIANGULATIONS 47
3.2 THE NEUTRAL CASE 50
3.3 VORONOI DIAGRAMS 51
3.4 DELAUNAY TRIANGULATION AS THE DUAL OF THE VORONOI DIAGRAM . . 54
3.5 THE CIRCLE CRITERION 57
3.6 EQUIVALENCE OF THE DELAUNAY CRITERIA
FOR STRICTLY CONVEX QUADRILATERALS 59
X CONTENTS
3.7 COMPUTING THE CIRCUMCIRCLE TEST 62
3.8 THE LOCAL OPTIMIZATION PROCEDURE (LOP) 64
3.9 GLOBAL PROPERTIES OF THE DELAUNAY TRIANGULATION 66
3.10 EXERCISES
71
4 ALGORITHM
S FOR DELAUNA
Y TRIANGULATION
73
4.1 A SIMPLE ALGORITHM BASED ON PREVIOUS RESULTS 73
4.2 RADIAL SWEEP 74
4.3 A STEP-BY-STEP APPROACH FOR MAKING DELAUNAY TRIANGLES ...
. 75
4.4 INCREMENTAL ALGORITHMS
-YY
78
4.5 INSERTING A POINT INTO A DELAUNAY TRIANGULATION 79
4.6 POINT INSERTION AND EDGE-SWAPPING 81
4.7 RUNNING TIME OF INCREMENTAL ALGORITHMS 87
4.8 DIVIDE-AND-CONQUER 89
4.9 EXERCISES 92
5 DAT
A DEPENDEN
T TRIANGULATIONS
95
5.1 MOTIVATION 95
5.2 OPTIMAL TRIANGULATIONS REVISITED 96
5.3 THE GENERAL CONCEPT 98
5.4 DAT
A DEPENDENT SWAPPING CRITERIA 101
5.5 ON IMPLEMENTATION OF THE LOP 105
5.6 MODIFIED LOCAL OPTIMIZATION PROCEDURES (MLOP) 106
5.7 SIMULATED ANNEALING 106
5.8 EXERCISES 112
6 CONSTRAINE
D DELAUNA
Y TRIANGULATION
113
6.1 DELAUNAY TRIANGULATION OF A PLANAR STRAIGHT-LINE GRAPH 113
6.2 GENERALIZATION OF DELAUNAY TRIANGULATION 115
6.3 ALGORITHMS FOR CONSTRAINED DELAUNAY TRIANGULATION 118
6.4 INSERTING AN EDGE INTO A CDT 119
6.5 EDGE INSERTION AND SWAPPING . . 123
6.6 INSERTING A POINT INTO A CDT 127
6.7 EXERCISES 129
7 DELAUNA
Y REFINEMENT MES
H GENERATIO
N
; 131
7.1 INTRODUCTION 131
7.2 GENERAL REQUIREMENTS FOR MESHES 132
7.3 NODE INSERTION 134
7.4 SPLITTING ENCROACHED SEGMENTS 139
7.5 THE DELAUNAY REFINEMENT ALGORITHM 142
7.6 MINIMUM EDGE LENGTH AND TERMINATION 145
7.7 CORNER-LOPPING FOR HANDLING SMALL INPUT ANGLES 152
7.8 SPATIAL GRADING 154
7.9 EXERCISES 154
CONTENTS XI
8 LEAST SQUARES APPROXIMATIO
N OF SCATTERE
D DAT
A
157
8.1 ANOTHER FORMULATION OF SURFACE TRIANGULATIONS 157
8.2 APPROXIMATION OVER TRIANGULATIONS OF SUBSETS OF DATA . 160
8.3 EXISTENCE AND UNIQUENESS 163
8.4 SPARSITY AND SYMMETRY 164
8.5 PENALIZED LEAST SQUARES 166
8.6 SMOOTHING TERMS FOR PENALIZED LEAST SQUARES 168
8.7 APPROXIMATION OVER GENERAL TRIANGULATIONS 175
8.8 WEIGHTED LEAST SQUARES 178
8.9 CONSTRAINED LEAST SQUARES 180
8.10 APPROXIMATION OVER BINARY TRIANGULATIONS 182
8.11 NUMERICAL EXAMPLES FOR BINARY TRIANGULATIONS 185
8.12 EXERCISES 191
9 PROGRAMMIN
G TRIANGULATIONS:
TH
E TRIANGULATION TEMPLAT
E LIBRARY (TTL
)
193
9.1 IMPLEMENTATION OF THE HALF-EDGE DATA STRUCTURE 194
9.2 THE OVERALL DESIGN AND THE ADAPTATION LAYER 197
9.3 TOPOLOGICAL QUERIES AND THE DART CLASS 199
9.4 SOME ITERATOR CLASSES 203
9.5 GEOMETRIC QUERIES AND THE TRAITS CLASS 205
9.6 GEOMETRIC AND TOPOLOGICAL MODIFIERS 211
9.7 GENERIC DELAUNAY TRIANGULATION 213
9.8 EXERCISES 221
REFERENCES
223
INDE
X
229
|
| adam_txt |
0YVIN
D HJELLE
MORTEN DAEHLEN
TRIANGULATIONS
AND APPLICATIONS
WITH 126 FIGURES
J SPRINGE
R
CONTENTS
TRIANGLES AND TRIANGULATIONS
1
1.1 TRIANGLES , 1
1.2 TRIANGULATIONS 5
1.3 SOME PROPERTIES OF TRIANGULATIONS 7
1.4 A TRIANGULATION ALGORITHM 10
1.5 EDGE INSERTION 16
1.6 USING TRIANGULATIONS 18
1.7 EXERCISES 20
GRAPHS AND DAT
A STRUCTURE
S
23
2.1 GRAPH THEORETIC CONCEPTS 23
2.2 GENERALIZED MAPS (G-MAPS) 25
2.3 DATA STRUCTURES FOR TRIANGULATIONS 29
2.4 A MINIMAL TRIANGLE-BASED DATA STRUCTURE 31
2.5 TRIANGLE-BASED DATA STRUCTURE WITH NEIGHBORS 32
2.6 VERTEX-BASED DATA STRUCTURE WITH NEIGHBORS 33
2.7 HALF-EDGE DAT
A STRUCTURE 35
2.8 DART-BASED DATA STRUCTURE 37
2.9 TRIANGLES FOR VISUALIZATION 38
2.10 BINARY TRIANGULATIONS 41
2.11 EXERCISES 45
DELAUNA
Y TRIANGULATIONS AND VORONOI DIAGRAM
S
47
3.1 OPTIMAL TRIANGULATIONS 47
3.2 THE NEUTRAL CASE 50
3.3 VORONOI DIAGRAMS 51
3.4 DELAUNAY TRIANGULATION AS THE DUAL OF THE VORONOI DIAGRAM . . 54
3.5 THE CIRCLE CRITERION 57
3.6 EQUIVALENCE OF THE DELAUNAY CRITERIA
FOR STRICTLY CONVEX QUADRILATERALS 59
X CONTENTS
3.7 COMPUTING THE CIRCUMCIRCLE TEST 62
3.8 THE LOCAL OPTIMIZATION PROCEDURE (LOP) 64
3.9 GLOBAL PROPERTIES OF THE DELAUNAY TRIANGULATION 66
3.10 EXERCISES
71
4 ALGORITHM
S FOR DELAUNA
Y TRIANGULATION
73
4.1 A SIMPLE ALGORITHM BASED ON PREVIOUS RESULTS 73
4.2 RADIAL SWEEP 74
4.3 A STEP-BY-STEP APPROACH FOR MAKING DELAUNAY TRIANGLES .
. 75
4.4 INCREMENTAL ALGORITHMS
-YY
78
4.5 INSERTING A POINT INTO A DELAUNAY TRIANGULATION 79
4.6 POINT INSERTION AND EDGE-SWAPPING 81
4.7 RUNNING TIME OF INCREMENTAL ALGORITHMS 87
4.8 DIVIDE-AND-CONQUER 89
4.9 EXERCISES 92
5 DAT
A DEPENDEN
T TRIANGULATIONS
95
5.1 MOTIVATION 95
5.2 OPTIMAL TRIANGULATIONS REVISITED 96
5.3 THE GENERAL CONCEPT 98
5.4 DAT
A DEPENDENT SWAPPING CRITERIA 101
5.5 ON IMPLEMENTATION OF THE LOP 105
5.6 MODIFIED LOCAL OPTIMIZATION PROCEDURES (MLOP) 106
5.7 SIMULATED ANNEALING 106
5.8 EXERCISES 112
6 CONSTRAINE
D DELAUNA
Y TRIANGULATION
113
6.1 DELAUNAY TRIANGULATION OF A PLANAR STRAIGHT-LINE GRAPH 113
6.2 GENERALIZATION OF DELAUNAY TRIANGULATION 115
6.3 ALGORITHMS FOR CONSTRAINED DELAUNAY TRIANGULATION 118
6.4 INSERTING AN EDGE INTO A CDT 119
6.5 EDGE INSERTION AND SWAPPING . . 123
6.6 INSERTING A POINT INTO A CDT 127
6.7 EXERCISES 129
7 DELAUNA
Y REFINEMENT MES
H GENERATIO
N
; 131
7.1 INTRODUCTION 131
7.2 GENERAL REQUIREMENTS FOR MESHES 132
7.3 NODE INSERTION 134
7.4 SPLITTING ENCROACHED SEGMENTS 139
7.5 THE DELAUNAY REFINEMENT ALGORITHM 142
7.6 MINIMUM EDGE LENGTH AND TERMINATION 145
7.7 CORNER-LOPPING FOR HANDLING SMALL INPUT ANGLES 152
7.8 SPATIAL GRADING 154
7.9 EXERCISES 154
CONTENTS XI
8 LEAST SQUARES APPROXIMATIO
N OF SCATTERE
D DAT
A
157
8.1 ANOTHER FORMULATION OF SURFACE TRIANGULATIONS 157
8.2 APPROXIMATION OVER TRIANGULATIONS OF SUBSETS OF DATA . 160
8.3 EXISTENCE AND UNIQUENESS 163
8.4 SPARSITY AND SYMMETRY 164
8.5 PENALIZED LEAST SQUARES 166
8.6 SMOOTHING TERMS FOR PENALIZED LEAST SQUARES 168
8.7 APPROXIMATION OVER GENERAL TRIANGULATIONS 175
8.8 WEIGHTED LEAST SQUARES 178
8.9 CONSTRAINED LEAST SQUARES 180
8.10 APPROXIMATION OVER BINARY TRIANGULATIONS 182
8.11 NUMERICAL EXAMPLES FOR BINARY TRIANGULATIONS 185
8.12 EXERCISES 191
9 PROGRAMMIN
G TRIANGULATIONS:
TH
E TRIANGULATION TEMPLAT
E LIBRARY (TTL
)
193
9.1 IMPLEMENTATION OF THE HALF-EDGE DATA STRUCTURE 194
9.2 THE OVERALL DESIGN AND THE ADAPTATION LAYER 197
9.3 TOPOLOGICAL QUERIES AND THE DART CLASS 199
9.4 SOME ITERATOR CLASSES 203
9.5 GEOMETRIC QUERIES AND THE TRAITS CLASS 205
9.6 GEOMETRIC AND TOPOLOGICAL MODIFIERS 211
9.7 GENERIC DELAUNAY TRIANGULATION 213
9.8 EXERCISES 221
REFERENCES
223
INDE
X
229 |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author | Hjelle, Øyvind Daehlen, Morten 1959- |
| author_GND | (DE-588)132114976 (DE-588)115422390 |
| author_facet | Hjelle, Øyvind Daehlen, Morten 1959- |
| author_role | aut aut |
| author_sort | Hjelle, Øyvind |
| author_variant | ø h øh m d md |
| building | Verbundindex |
| bvnumber | BV022377846 |
| classification_rvk | SK 380 |
| classification_tum | MAT 000 |
| collection | ZDB-2-SMA |
| ctrlnum | (OCoLC)873408114 (DE-599)BVBBV022377846 |
| discipline | Mathematik |
| discipline_str_mv | Mathematik |
| doi_str_mv | 10.1007/3-540-33261-8 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02612nmm a2200589 c 4500</leader><controlfield tag="001">BV022377846</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">070404s2006 gw |||| o||u| ||||||eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">06,N20,0904</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">06,A44,0534</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">979440726</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">354033260X</subfield><subfield code="c">Pp. : EUR 53.45 (freier Pr.)</subfield><subfield code="9">3-540-33260-X</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783540332602</subfield><subfield code="c">Pp. : EUR 53.45 (freier Pr.)</subfield><subfield code="9">978-3-540-33260-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783540332619</subfield><subfield code="c">Online</subfield><subfield code="9">978-3-540-33261-9</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/3-540-33261-8</subfield><subfield code="2">doi</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783540332602</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">11693598</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)873408114</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV022377846</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-739</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-19</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">MAT 000</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="100" ind1="1" ind2=" "><subfield code="a">Hjelle, Øyvind</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)132114976</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Triangulations and applications</subfield><subfield code="c">Øyvind Hjelle ; Morten Daehlen</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin ; Heidelberg ; New York</subfield><subfield code="b">Springer</subfield><subfield code="c">2006</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XI, 234 S.)</subfield><subfield code="b">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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Mathematics and visualization</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturverz. S. 223 - 227</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Triangulation</subfield><subfield code="0">(DE-588)4186017-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Triangulation</subfield><subfield code="0">(DE-588)4186017-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Daehlen, Morten</subfield><subfield code="d">1959-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)115422390</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/3-540-33261-8</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</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=015586887&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SMA</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015586887</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/3-540-33261-8</subfield><subfield code="l">BTU01</subfield><subfield code="p">ZDB-2-SMA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/3-540-33261-8</subfield><subfield code="l">TUM01</subfield><subfield code="p">ZDB-2-SMA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/3-540-33261-8</subfield><subfield code="l">UBA01</subfield><subfield code="p">ZDB-2-SMA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/3-540-33261-8</subfield><subfield code="l">UBM01</subfield><subfield code="p">ZDB-2-SMA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/3-540-33261-8</subfield><subfield code="l">UBR01</subfield><subfield code="p">ZDB-2-SMA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/3-540-33261-8</subfield><subfield code="l">UBT01</subfield><subfield code="p">ZDB-2-SMA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/3-540-33261-8</subfield><subfield code="l">UPA01</subfield><subfield code="p">ZDB-2-SMA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV022377846 |
| illustrated | Not Illustrated |
| index_date | 2024-07-02T17:10:01Z |
| indexdate | 2024-07-09T20:56:19Z |
| institution | BVB |
| isbn | 354033260X 9783540332602 9783540332619 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015586887 |
| oclc_num | 873408114 |
| open_access_boolean | |
| owner | DE-739 DE-355 DE-BY-UBR DE-634 DE-91 DE-BY-TUM DE-384 DE-703 DE-83 DE-19 DE-BY-UBM |
| owner_facet | DE-739 DE-355 DE-BY-UBR DE-634 DE-91 DE-BY-TUM DE-384 DE-703 DE-83 DE-19 DE-BY-UBM |
| physical | 1 Online-Ressource (XI, 234 S.) graph. Darst. |
| psigel | ZDB-2-SMA |
| publishDate | 2006 |
| publishDateSearch | 2006 |
| publishDateSort | 2006 |
| publisher | Springer |
| record_format | marc |
| series2 | Mathematics and visualization |
| spelling | Hjelle, Øyvind Verfasser (DE-588)132114976 aut Triangulations and applications Øyvind Hjelle ; Morten Daehlen Berlin ; Heidelberg ; New York Springer 2006 1 Online-Ressource (XI, 234 S.) graph. Darst. txt rdacontent c rdamedia cr rdacarrier Mathematics and visualization Literaturverz. S. 223 - 227 Triangulation (DE-588)4186017-2 gnd rswk-swf Triangulation (DE-588)4186017-2 s DE-604 Daehlen, Morten 1959- Verfasser (DE-588)115422390 aut https://doi.org/10.1007/3-540-33261-8 Verlag Volltext DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=015586887&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Hjelle, Øyvind Daehlen, Morten 1959- Triangulations and applications Triangulation (DE-588)4186017-2 gnd |
| subject_GND | (DE-588)4186017-2 |
| title | Triangulations and applications |
| title_auth | Triangulations and applications |
| title_exact_search | Triangulations and applications |
| title_exact_search_txtP | Triangulations and applications |
| title_full | Triangulations and applications Øyvind Hjelle ; Morten Daehlen |
| title_fullStr | Triangulations and applications Øyvind Hjelle ; Morten Daehlen |
| title_full_unstemmed | Triangulations and applications Øyvind Hjelle ; Morten Daehlen |
| title_short | Triangulations and applications |
| title_sort | triangulations and applications |
| topic | Triangulation (DE-588)4186017-2 gnd |
| topic_facet | Triangulation |
| url | https://doi.org/10.1007/3-540-33261-8 http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=015586887&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT hjelleøyvind triangulationsandapplications AT daehlenmorten triangulationsandapplications |