Reprint of: Delaunay refinement algorithms for triangular mesh generation
Delaunay refinement is a technique for generating unstructured meshes of triangles for use in interpolation, the finite element method, and the finite volume method. In theory and practice, meshes produced by Delaunay refinement satisfy guaranteed bounds on angles, edge lengths, the number of triang...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Shewchuk, Jonathan Richard [verfasserIn] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2014transfer abstract |
|---|
| Schlagwörter: |
|---|
| Umfang: |
38 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Enhancement in median nerve mobility during radioulnar wrist compression in carpal tunnel syndrome patients - Yao, Yifei ELSEVIER, 2018, theory and applications, Amsterdam |
|---|---|
| Übergeordnetes Werk: |
volume:47 ; year:2014 ; number:7 ; pages:741-778 ; extent:38 |
| Links: |
|---|
| DOI / URN: |
10.1016/j.comgeo.2014.02.005 |
|---|
| Katalog-ID: |
ELV039416054 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | ELV039416054 | ||
| 003 | DE-627 | ||
| 005 | 20230625224834.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 180603s2014 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1016/j.comgeo.2014.02.005 |2 doi | |
| 028 | 5 | 2 | |a GBVA2014015000009.pica |
| 035 | |a (DE-627)ELV039416054 | ||
| 035 | |a (ELSEVIER)S0925-7721(14)00038-8 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | |a 004 | |
| 082 | 0 | 4 | |a 004 |q DE-600 |
| 082 | 0 | 4 | |a 610 |a 796 |q VZ |
| 084 | |a 31 |2 ssgn | ||
| 084 | |a 44.09 |2 bkl | ||
| 100 | 1 | |a Shewchuk, Jonathan Richard |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Reprint of: Delaunay refinement algorithms for triangular mesh generation |
| 264 | 1 | |c 2014transfer abstract | |
| 300 | |a 38 | ||
| 336 | |a nicht spezifiziert |b zzz |2 rdacontent | ||
| 337 | |a nicht spezifiziert |b z |2 rdamedia | ||
| 338 | |a nicht spezifiziert |b zu |2 rdacarrier | ||
| 520 | |a Delaunay refinement is a technique for generating unstructured meshes of triangles for use in interpolation, the finite element method, and the finite volume method. In theory and practice, meshes produced by Delaunay refinement satisfy guaranteed bounds on angles, edge lengths, the number of triangles, and the grading of triangles from small to large sizes. This article presents an intuitive framework for analyzing Delaunay refinement algorithms that unifies the pioneering mesh generation algorithms of L. Paul Chew and Jim Ruppert, improves the algorithms in several minor ways, and most importantly, helps to solve the difficult problem of meshing nonmanifold domains with small angles. | ||
| 520 | |a Delaunay refinement is a technique for generating unstructured meshes of triangles for use in interpolation, the finite element method, and the finite volume method. In theory and practice, meshes produced by Delaunay refinement satisfy guaranteed bounds on angles, edge lengths, the number of triangles, and the grading of triangles from small to large sizes. This article presents an intuitive framework for analyzing Delaunay refinement algorithms that unifies the pioneering mesh generation algorithms of L. Paul Chew and Jim Ruppert, improves the algorithms in several minor ways, and most importantly, helps to solve the difficult problem of meshing nonmanifold domains with small angles. | ||
| 650 | 7 | |a Triangular mesh generation |2 Elsevier | |
| 650 | 7 | |a Computational geometry |2 Elsevier | |
| 650 | 7 | |a Delaunay refinement |2 Elsevier | |
| 650 | 7 | |a Delaunay triangulation |2 Elsevier | |
| 650 | 7 | |a Constrained Delaunay triangulation |2 Elsevier | |
| 773 | 0 | 8 | |i Enthalten in |n Elsevier |a Yao, Yifei ELSEVIER |t Enhancement in median nerve mobility during radioulnar wrist compression in carpal tunnel syndrome patients |d 2018 |d theory and applications |g Amsterdam |w (DE-627)ELV001116886 |
| 773 | 1 | 8 | |g volume:47 |g year:2014 |g number:7 |g pages:741-778 |g extent:38 |
| 856 | 4 | 0 | |u https://doi.org/10.1016/j.comgeo.2014.02.005 |3 Volltext |
| 912 | |a GBV_USEFLAG_U | ||
| 912 | |a GBV_ELV | ||
| 912 | |a SYSFLAG_U | ||
| 912 | |a SSG-OLC-PHA | ||
| 936 | b | k | |a 44.09 |j Medizintechnik |q VZ |
| 951 | |a AR | ||
| 952 | |d 47 |j 2014 |e 7 |h 741-778 |g 38 | ||
| 953 | |2 045F |a 004 | ||
| author_variant |
j r s jr jrs |
|---|---|
| matchkey_str |
shewchukjonathanrichard:2014----:ernodluarfnmnagrtmfrragl |
| hierarchy_sort_str |
2014transfer abstract |
| bklnumber |
44.09 |
| publishDate |
2014 |
| allfields |
10.1016/j.comgeo.2014.02.005 doi GBVA2014015000009.pica (DE-627)ELV039416054 (ELSEVIER)S0925-7721(14)00038-8 DE-627 ger DE-627 rakwb eng 004 004 DE-600 610 796 VZ 31 ssgn 44.09 bkl Shewchuk, Jonathan Richard verfasserin aut Reprint of: Delaunay refinement algorithms for triangular mesh generation 2014transfer abstract 38 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Delaunay refinement is a technique for generating unstructured meshes of triangles for use in interpolation, the finite element method, and the finite volume method. In theory and practice, meshes produced by Delaunay refinement satisfy guaranteed bounds on angles, edge lengths, the number of triangles, and the grading of triangles from small to large sizes. This article presents an intuitive framework for analyzing Delaunay refinement algorithms that unifies the pioneering mesh generation algorithms of L. Paul Chew and Jim Ruppert, improves the algorithms in several minor ways, and most importantly, helps to solve the difficult problem of meshing nonmanifold domains with small angles. Delaunay refinement is a technique for generating unstructured meshes of triangles for use in interpolation, the finite element method, and the finite volume method. In theory and practice, meshes produced by Delaunay refinement satisfy guaranteed bounds on angles, edge lengths, the number of triangles, and the grading of triangles from small to large sizes. This article presents an intuitive framework for analyzing Delaunay refinement algorithms that unifies the pioneering mesh generation algorithms of L. Paul Chew and Jim Ruppert, improves the algorithms in several minor ways, and most importantly, helps to solve the difficult problem of meshing nonmanifold domains with small angles. Triangular mesh generation Elsevier Computational geometry Elsevier Delaunay refinement Elsevier Delaunay triangulation Elsevier Constrained Delaunay triangulation Elsevier Enthalten in Elsevier Yao, Yifei ELSEVIER Enhancement in median nerve mobility during radioulnar wrist compression in carpal tunnel syndrome patients 2018 theory and applications Amsterdam (DE-627)ELV001116886 volume:47 year:2014 number:7 pages:741-778 extent:38 https://doi.org/10.1016/j.comgeo.2014.02.005 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA 44.09 Medizintechnik VZ AR 47 2014 7 741-778 38 045F 004 |
| spelling |
10.1016/j.comgeo.2014.02.005 doi GBVA2014015000009.pica (DE-627)ELV039416054 (ELSEVIER)S0925-7721(14)00038-8 DE-627 ger DE-627 rakwb eng 004 004 DE-600 610 796 VZ 31 ssgn 44.09 bkl Shewchuk, Jonathan Richard verfasserin aut Reprint of: Delaunay refinement algorithms for triangular mesh generation 2014transfer abstract 38 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Delaunay refinement is a technique for generating unstructured meshes of triangles for use in interpolation, the finite element method, and the finite volume method. In theory and practice, meshes produced by Delaunay refinement satisfy guaranteed bounds on angles, edge lengths, the number of triangles, and the grading of triangles from small to large sizes. This article presents an intuitive framework for analyzing Delaunay refinement algorithms that unifies the pioneering mesh generation algorithms of L. Paul Chew and Jim Ruppert, improves the algorithms in several minor ways, and most importantly, helps to solve the difficult problem of meshing nonmanifold domains with small angles. Delaunay refinement is a technique for generating unstructured meshes of triangles for use in interpolation, the finite element method, and the finite volume method. In theory and practice, meshes produced by Delaunay refinement satisfy guaranteed bounds on angles, edge lengths, the number of triangles, and the grading of triangles from small to large sizes. This article presents an intuitive framework for analyzing Delaunay refinement algorithms that unifies the pioneering mesh generation algorithms of L. Paul Chew and Jim Ruppert, improves the algorithms in several minor ways, and most importantly, helps to solve the difficult problem of meshing nonmanifold domains with small angles. Triangular mesh generation Elsevier Computational geometry Elsevier Delaunay refinement Elsevier Delaunay triangulation Elsevier Constrained Delaunay triangulation Elsevier Enthalten in Elsevier Yao, Yifei ELSEVIER Enhancement in median nerve mobility during radioulnar wrist compression in carpal tunnel syndrome patients 2018 theory and applications Amsterdam (DE-627)ELV001116886 volume:47 year:2014 number:7 pages:741-778 extent:38 https://doi.org/10.1016/j.comgeo.2014.02.005 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA 44.09 Medizintechnik VZ AR 47 2014 7 741-778 38 045F 004 |
| allfields_unstemmed |
10.1016/j.comgeo.2014.02.005 doi GBVA2014015000009.pica (DE-627)ELV039416054 (ELSEVIER)S0925-7721(14)00038-8 DE-627 ger DE-627 rakwb eng 004 004 DE-600 610 796 VZ 31 ssgn 44.09 bkl Shewchuk, Jonathan Richard verfasserin aut Reprint of: Delaunay refinement algorithms for triangular mesh generation 2014transfer abstract 38 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Delaunay refinement is a technique for generating unstructured meshes of triangles for use in interpolation, the finite element method, and the finite volume method. In theory and practice, meshes produced by Delaunay refinement satisfy guaranteed bounds on angles, edge lengths, the number of triangles, and the grading of triangles from small to large sizes. This article presents an intuitive framework for analyzing Delaunay refinement algorithms that unifies the pioneering mesh generation algorithms of L. Paul Chew and Jim Ruppert, improves the algorithms in several minor ways, and most importantly, helps to solve the difficult problem of meshing nonmanifold domains with small angles. Delaunay refinement is a technique for generating unstructured meshes of triangles for use in interpolation, the finite element method, and the finite volume method. In theory and practice, meshes produced by Delaunay refinement satisfy guaranteed bounds on angles, edge lengths, the number of triangles, and the grading of triangles from small to large sizes. This article presents an intuitive framework for analyzing Delaunay refinement algorithms that unifies the pioneering mesh generation algorithms of L. Paul Chew and Jim Ruppert, improves the algorithms in several minor ways, and most importantly, helps to solve the difficult problem of meshing nonmanifold domains with small angles. Triangular mesh generation Elsevier Computational geometry Elsevier Delaunay refinement Elsevier Delaunay triangulation Elsevier Constrained Delaunay triangulation Elsevier Enthalten in Elsevier Yao, Yifei ELSEVIER Enhancement in median nerve mobility during radioulnar wrist compression in carpal tunnel syndrome patients 2018 theory and applications Amsterdam (DE-627)ELV001116886 volume:47 year:2014 number:7 pages:741-778 extent:38 https://doi.org/10.1016/j.comgeo.2014.02.005 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA 44.09 Medizintechnik VZ AR 47 2014 7 741-778 38 045F 004 |
| allfieldsGer |
10.1016/j.comgeo.2014.02.005 doi GBVA2014015000009.pica (DE-627)ELV039416054 (ELSEVIER)S0925-7721(14)00038-8 DE-627 ger DE-627 rakwb eng 004 004 DE-600 610 796 VZ 31 ssgn 44.09 bkl Shewchuk, Jonathan Richard verfasserin aut Reprint of: Delaunay refinement algorithms for triangular mesh generation 2014transfer abstract 38 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Delaunay refinement is a technique for generating unstructured meshes of triangles for use in interpolation, the finite element method, and the finite volume method. In theory and practice, meshes produced by Delaunay refinement satisfy guaranteed bounds on angles, edge lengths, the number of triangles, and the grading of triangles from small to large sizes. This article presents an intuitive framework for analyzing Delaunay refinement algorithms that unifies the pioneering mesh generation algorithms of L. Paul Chew and Jim Ruppert, improves the algorithms in several minor ways, and most importantly, helps to solve the difficult problem of meshing nonmanifold domains with small angles. Delaunay refinement is a technique for generating unstructured meshes of triangles for use in interpolation, the finite element method, and the finite volume method. In theory and practice, meshes produced by Delaunay refinement satisfy guaranteed bounds on angles, edge lengths, the number of triangles, and the grading of triangles from small to large sizes. This article presents an intuitive framework for analyzing Delaunay refinement algorithms that unifies the pioneering mesh generation algorithms of L. Paul Chew and Jim Ruppert, improves the algorithms in several minor ways, and most importantly, helps to solve the difficult problem of meshing nonmanifold domains with small angles. Triangular mesh generation Elsevier Computational geometry Elsevier Delaunay refinement Elsevier Delaunay triangulation Elsevier Constrained Delaunay triangulation Elsevier Enthalten in Elsevier Yao, Yifei ELSEVIER Enhancement in median nerve mobility during radioulnar wrist compression in carpal tunnel syndrome patients 2018 theory and applications Amsterdam (DE-627)ELV001116886 volume:47 year:2014 number:7 pages:741-778 extent:38 https://doi.org/10.1016/j.comgeo.2014.02.005 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA 44.09 Medizintechnik VZ AR 47 2014 7 741-778 38 045F 004 |
| allfieldsSound |
10.1016/j.comgeo.2014.02.005 doi GBVA2014015000009.pica (DE-627)ELV039416054 (ELSEVIER)S0925-7721(14)00038-8 DE-627 ger DE-627 rakwb eng 004 004 DE-600 610 796 VZ 31 ssgn 44.09 bkl Shewchuk, Jonathan Richard verfasserin aut Reprint of: Delaunay refinement algorithms for triangular mesh generation 2014transfer abstract 38 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Delaunay refinement is a technique for generating unstructured meshes of triangles for use in interpolation, the finite element method, and the finite volume method. In theory and practice, meshes produced by Delaunay refinement satisfy guaranteed bounds on angles, edge lengths, the number of triangles, and the grading of triangles from small to large sizes. This article presents an intuitive framework for analyzing Delaunay refinement algorithms that unifies the pioneering mesh generation algorithms of L. Paul Chew and Jim Ruppert, improves the algorithms in several minor ways, and most importantly, helps to solve the difficult problem of meshing nonmanifold domains with small angles. Delaunay refinement is a technique for generating unstructured meshes of triangles for use in interpolation, the finite element method, and the finite volume method. In theory and practice, meshes produced by Delaunay refinement satisfy guaranteed bounds on angles, edge lengths, the number of triangles, and the grading of triangles from small to large sizes. This article presents an intuitive framework for analyzing Delaunay refinement algorithms that unifies the pioneering mesh generation algorithms of L. Paul Chew and Jim Ruppert, improves the algorithms in several minor ways, and most importantly, helps to solve the difficult problem of meshing nonmanifold domains with small angles. Triangular mesh generation Elsevier Computational geometry Elsevier Delaunay refinement Elsevier Delaunay triangulation Elsevier Constrained Delaunay triangulation Elsevier Enthalten in Elsevier Yao, Yifei ELSEVIER Enhancement in median nerve mobility during radioulnar wrist compression in carpal tunnel syndrome patients 2018 theory and applications Amsterdam (DE-627)ELV001116886 volume:47 year:2014 number:7 pages:741-778 extent:38 https://doi.org/10.1016/j.comgeo.2014.02.005 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA 44.09 Medizintechnik VZ AR 47 2014 7 741-778 38 045F 004 |
| language |
English |
| source |
Enthalten in Enhancement in median nerve mobility during radioulnar wrist compression in carpal tunnel syndrome patients Amsterdam volume:47 year:2014 number:7 pages:741-778 extent:38 |
| sourceStr |
Enthalten in Enhancement in median nerve mobility during radioulnar wrist compression in carpal tunnel syndrome patients Amsterdam volume:47 year:2014 number:7 pages:741-778 extent:38 |
| format_phy_str_mv |
Article |
| bklname |
Medizintechnik |
| institution |
findex.gbv.de |
| topic_facet |
Triangular mesh generation Computational geometry Delaunay refinement Delaunay triangulation Constrained Delaunay triangulation |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Enhancement in median nerve mobility during radioulnar wrist compression in carpal tunnel syndrome patients |
| authorswithroles_txt_mv |
Shewchuk, Jonathan Richard @@aut@@ |
| publishDateDaySort_date |
2014-01-01T00:00:00Z |
| hierarchy_top_id |
ELV001116886 |
| dewey-sort |
14 |
| id |
ELV039416054 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">ELV039416054</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230625224834.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">180603s2014 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.comgeo.2014.02.005</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">GBVA2014015000009.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV039416054</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0925-7721(14)00038-8</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">DE-600</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">610</subfield><subfield code="a">796</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">31</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">44.09</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Shewchuk, Jonathan Richard</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Reprint of: Delaunay refinement algorithms for triangular mesh generation</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2014transfer abstract</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">38</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Delaunay refinement is a technique for generating unstructured meshes of triangles for use in interpolation, the finite element method, and the finite volume method. In theory and practice, meshes produced by Delaunay refinement satisfy guaranteed bounds on angles, edge lengths, the number of triangles, and the grading of triangles from small to large sizes. This article presents an intuitive framework for analyzing Delaunay refinement algorithms that unifies the pioneering mesh generation algorithms of L. Paul Chew and Jim Ruppert, improves the algorithms in several minor ways, and most importantly, helps to solve the difficult problem of meshing nonmanifold domains with small angles.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Delaunay refinement is a technique for generating unstructured meshes of triangles for use in interpolation, the finite element method, and the finite volume method. In theory and practice, meshes produced by Delaunay refinement satisfy guaranteed bounds on angles, edge lengths, the number of triangles, and the grading of triangles from small to large sizes. This article presents an intuitive framework for analyzing Delaunay refinement algorithms that unifies the pioneering mesh generation algorithms of L. Paul Chew and Jim Ruppert, improves the algorithms in several minor ways, and most importantly, helps to solve the difficult problem of meshing nonmanifold domains with small angles.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Triangular mesh generation</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computational geometry</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Delaunay refinement</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Delaunay triangulation</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Constrained Delaunay triangulation</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="n">Elsevier</subfield><subfield code="a">Yao, Yifei ELSEVIER</subfield><subfield code="t">Enhancement in median nerve mobility during radioulnar wrist compression in carpal tunnel syndrome patients</subfield><subfield code="d">2018</subfield><subfield code="d">theory and applications</subfield><subfield code="g">Amsterdam</subfield><subfield code="w">(DE-627)ELV001116886</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:47</subfield><subfield code="g">year:2014</subfield><subfield code="g">number:7</subfield><subfield code="g">pages:741-778</subfield><subfield code="g">extent:38</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.comgeo.2014.02.005</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-PHA</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">44.09</subfield><subfield code="j">Medizintechnik</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">47</subfield><subfield code="j">2014</subfield><subfield code="e">7</subfield><subfield code="h">741-778</subfield><subfield code="g">38</subfield></datafield><datafield tag="953" ind1=" " ind2=" "><subfield code="2">045F</subfield><subfield code="a">004</subfield></datafield></record></collection>
|
| author |
Shewchuk, Jonathan Richard |
| spellingShingle |
Shewchuk, Jonathan Richard ddc 004 ddc 610 ssgn 31 bkl 44.09 Elsevier Triangular mesh generation Elsevier Computational geometry Elsevier Delaunay refinement Elsevier Delaunay triangulation Elsevier Constrained Delaunay triangulation Reprint of: Delaunay refinement algorithms for triangular mesh generation |
| authorStr |
Shewchuk, Jonathan Richard |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)ELV001116886 |
| format |
electronic Article |
| dewey-ones |
004 - Data processing & computer science 610 - Medicine & health 796 - Athletic & outdoor sports & games |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
elsevier |
| remote_str |
true |
| illustrated |
Not Illustrated |
| topic_title |
004 004 DE-600 610 796 VZ 31 ssgn 44.09 bkl Reprint of: Delaunay refinement algorithms for triangular mesh generation Triangular mesh generation Elsevier Computational geometry Elsevier Delaunay refinement Elsevier Delaunay triangulation Elsevier Constrained Delaunay triangulation Elsevier |
| topic |
ddc 004 ddc 610 ssgn 31 bkl 44.09 Elsevier Triangular mesh generation Elsevier Computational geometry Elsevier Delaunay refinement Elsevier Delaunay triangulation Elsevier Constrained Delaunay triangulation |
| topic_unstemmed |
ddc 004 ddc 610 ssgn 31 bkl 44.09 Elsevier Triangular mesh generation Elsevier Computational geometry Elsevier Delaunay refinement Elsevier Delaunay triangulation Elsevier Constrained Delaunay triangulation |
| topic_browse |
ddc 004 ddc 610 ssgn 31 bkl 44.09 Elsevier Triangular mesh generation Elsevier Computational geometry Elsevier Delaunay refinement Elsevier Delaunay triangulation Elsevier Constrained Delaunay triangulation |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
zu |
| hierarchy_parent_title |
Enhancement in median nerve mobility during radioulnar wrist compression in carpal tunnel syndrome patients |
| hierarchy_parent_id |
ELV001116886 |
| dewey-tens |
000 - Computer science, knowledge & systems 610 - Medicine & health 790 - Sports, games & entertainment |
| hierarchy_top_title |
Enhancement in median nerve mobility during radioulnar wrist compression in carpal tunnel syndrome patients |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)ELV001116886 |
| title |
Reprint of: Delaunay refinement algorithms for triangular mesh generation |
| ctrlnum |
(DE-627)ELV039416054 (ELSEVIER)S0925-7721(14)00038-8 |
| title_full |
Reprint of: Delaunay refinement algorithms for triangular mesh generation |
| author_sort |
Shewchuk, Jonathan Richard |
| journal |
Enhancement in median nerve mobility during radioulnar wrist compression in carpal tunnel syndrome patients |
| journalStr |
Enhancement in median nerve mobility during radioulnar wrist compression in carpal tunnel syndrome patients |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works 600 - Technology 700 - Arts & recreation |
| recordtype |
marc |
| publishDateSort |
2014 |
| contenttype_str_mv |
zzz |
| container_start_page |
741 |
| author_browse |
Shewchuk, Jonathan Richard |
| container_volume |
47 |
| physical |
38 |
| class |
004 004 DE-600 610 796 VZ 31 ssgn 44.09 bkl |
| format_se |
Elektronische Aufsätze |
| author-letter |
Shewchuk, Jonathan Richard |
| doi_str_mv |
10.1016/j.comgeo.2014.02.005 |
| dewey-full |
004 610 796 |
| title_sort |
reprint of: delaunay refinement algorithms for triangular mesh generation |
| title_auth |
Reprint of: Delaunay refinement algorithms for triangular mesh generation |
| abstract |
Delaunay refinement is a technique for generating unstructured meshes of triangles for use in interpolation, the finite element method, and the finite volume method. In theory and practice, meshes produced by Delaunay refinement satisfy guaranteed bounds on angles, edge lengths, the number of triangles, and the grading of triangles from small to large sizes. This article presents an intuitive framework for analyzing Delaunay refinement algorithms that unifies the pioneering mesh generation algorithms of L. Paul Chew and Jim Ruppert, improves the algorithms in several minor ways, and most importantly, helps to solve the difficult problem of meshing nonmanifold domains with small angles. |
| abstractGer |
Delaunay refinement is a technique for generating unstructured meshes of triangles for use in interpolation, the finite element method, and the finite volume method. In theory and practice, meshes produced by Delaunay refinement satisfy guaranteed bounds on angles, edge lengths, the number of triangles, and the grading of triangles from small to large sizes. This article presents an intuitive framework for analyzing Delaunay refinement algorithms that unifies the pioneering mesh generation algorithms of L. Paul Chew and Jim Ruppert, improves the algorithms in several minor ways, and most importantly, helps to solve the difficult problem of meshing nonmanifold domains with small angles. |
| abstract_unstemmed |
Delaunay refinement is a technique for generating unstructured meshes of triangles for use in interpolation, the finite element method, and the finite volume method. In theory and practice, meshes produced by Delaunay refinement satisfy guaranteed bounds on angles, edge lengths, the number of triangles, and the grading of triangles from small to large sizes. This article presents an intuitive framework for analyzing Delaunay refinement algorithms that unifies the pioneering mesh generation algorithms of L. Paul Chew and Jim Ruppert, improves the algorithms in several minor ways, and most importantly, helps to solve the difficult problem of meshing nonmanifold domains with small angles. |
| collection_details |
GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA |
| container_issue |
7 |
| title_short |
Reprint of: Delaunay refinement algorithms for triangular mesh generation |
| url |
https://doi.org/10.1016/j.comgeo.2014.02.005 |
| remote_bool |
true |
| ppnlink |
ELV001116886 |
| mediatype_str_mv |
z |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1016/j.comgeo.2014.02.005 |
| up_date |
2024-07-06T20:33:39.874Z |
| _version_ |
1803863216488448000 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">ELV039416054</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230625224834.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">180603s2014 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.comgeo.2014.02.005</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">GBVA2014015000009.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV039416054</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0925-7721(14)00038-8</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">DE-600</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">610</subfield><subfield code="a">796</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">31</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">44.09</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Shewchuk, Jonathan Richard</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Reprint of: Delaunay refinement algorithms for triangular mesh generation</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2014transfer abstract</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">38</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Delaunay refinement is a technique for generating unstructured meshes of triangles for use in interpolation, the finite element method, and the finite volume method. In theory and practice, meshes produced by Delaunay refinement satisfy guaranteed bounds on angles, edge lengths, the number of triangles, and the grading of triangles from small to large sizes. This article presents an intuitive framework for analyzing Delaunay refinement algorithms that unifies the pioneering mesh generation algorithms of L. Paul Chew and Jim Ruppert, improves the algorithms in several minor ways, and most importantly, helps to solve the difficult problem of meshing nonmanifold domains with small angles.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Delaunay refinement is a technique for generating unstructured meshes of triangles for use in interpolation, the finite element method, and the finite volume method. In theory and practice, meshes produced by Delaunay refinement satisfy guaranteed bounds on angles, edge lengths, the number of triangles, and the grading of triangles from small to large sizes. This article presents an intuitive framework for analyzing Delaunay refinement algorithms that unifies the pioneering mesh generation algorithms of L. Paul Chew and Jim Ruppert, improves the algorithms in several minor ways, and most importantly, helps to solve the difficult problem of meshing nonmanifold domains with small angles.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Triangular mesh generation</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computational geometry</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Delaunay refinement</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Delaunay triangulation</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Constrained Delaunay triangulation</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="n">Elsevier</subfield><subfield code="a">Yao, Yifei ELSEVIER</subfield><subfield code="t">Enhancement in median nerve mobility during radioulnar wrist compression in carpal tunnel syndrome patients</subfield><subfield code="d">2018</subfield><subfield code="d">theory and applications</subfield><subfield code="g">Amsterdam</subfield><subfield code="w">(DE-627)ELV001116886</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:47</subfield><subfield code="g">year:2014</subfield><subfield code="g">number:7</subfield><subfield code="g">pages:741-778</subfield><subfield code="g">extent:38</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.comgeo.2014.02.005</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-PHA</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">44.09</subfield><subfield code="j">Medizintechnik</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">47</subfield><subfield code="j">2014</subfield><subfield code="e">7</subfield><subfield code="h">741-778</subfield><subfield code="g">38</subfield></datafield><datafield tag="953" ind1=" " ind2=" "><subfield code="2">045F</subfield><subfield code="a">004</subfield></datafield></record></collection>
|
| score |
7.3989286 |