InforLorV4, PascalFrancis, Curation, bibRecord, 000887

Obtuse triangle suppression in anisotropic meshes

Identifieur interne : 000887 ( PascalFrancis/Curation ); précédent : 000886; suivant : 000888

Obtuse triangle suppression in anisotropic meshes

Auteurs : FENG SUN [Hong Kong] ; Yi-King Choi [Hong Kong] ; WENPING WANG [Hong Kong] ; Dong-Ming Yan [Hong Kong, France, Arabie saoudite] ; YANG LIU [France, République populaire de Chine] ; Bruno Levy [France]

Source :

Computer aided geometric design [ 0167-8396 ] ; 2011.

RBID : Pascal:12-0080675

Descripteurs français

Pascal (Inist)
- Géométrie algorithmique, Discrétisation, Anisotropie, Modélisation, Calcul variationnel, Métrique Minkowski, Orientation, Barycentre, Pavage, Diagramme Voronoï, Méthode maille, Triangulation, Analyse flux donnée, Génération maille.

English descriptors

KwdEn :
- Anisotropy, Barycenter, Computational geometry, Data flow analysis, Discretization, Mesh generation, Mesh method, Minkowski metric, Modeling, Orientation, Tiling, Triangulation, Variational calculus, Voronoï diagram.

Abstract

Anisotropic triangle meshes are used for efficient approximation of surfaces and flow data in finite element analysis, and in these applications it is desirable to have as few obtuse triangles as possible to reduce the discretization error. We present a variational approach to suppressing obtuse triangles in anisotropic meshes. Specifically, we introduce a hexagonal Minkowski metric, which is sensitive to triangle orientation, to give a new formulation of the centroidal Voronoi tessellation (CVT) method. Furthermore, we prove several relevant properties of the CVT method with the newly introduced metric. Experiments show that our algorithm produces anisotropic meshes with much fewer obtuse triangles than using existing methods while maintaining mesh anisotropy.

A01	`01`	`1`		`@0 0167-8396`
A02	`01`			`@0 CAGDEX`
A03		`1`		`@0 Comput. aided geom. des.`
A05				`@2 28`
A06				`@2 9`
A08	`01`	`1`	`ENG`	`@1 Obtuse triangle suppression in anisotropic meshes`
A11	`01`	`1`		`@1 FENG SUN`
A11	`02`	`1`		`@1 CHOI (Yi-King)`
A11	`03`	`1`		`@1 WENPING WANG`
A11	`04`	`1`		`@1 YAN (Dong-Ming)`
A11	`05`	`1`		`@1 YANG LIU`
A11	`06`	`1`		`@1 LEVY (Bruno)`
A14	`01`			`@1 Department of Computer Science, The University of HongKong, Pokfulam Road @3 HKG @Z 1 aut. @Z 2 aut. @Z 3 aut. @Z 4 aut.`
A14	`02`			`@1 LORIA/INRIA Lorraine, Project ALICE, Campus scientifique 615, rue du Jardin Botanique @2 54600, Villers les Nancy @3 FRA @Z 4 aut. @Z 5 aut. @Z 6 aut.`
A14	`03`			`@1 Geometric Modeling and Scientific Visualization Center, KAUST @2 Thuwal 23955-6900 @3 SAU @Z 4 aut.`
A14	`04`			`@1 Microsoft Research Asia, 5/F, Beijing Sigma Center, No. 49, Zhichun Road @2 Haidian District, Beijing, 100190 @3 CHN @Z 5 aut.`
A20				`@1 537-548`
A21				`@1 2011`
A23	`01`			`@0 ENG`
A43	`01`			`@1 INIST @2 20700 @5 354000507360660030`
A44				`@0 0000 @1 © 2012 INIST-CNRS. All rights reserved.`
A45				`@0 3/4 p.`
A47	`01`	`1`		`@0 12-0080675`
A60				`@1 P`
A61				`@0 A`
A64	`01`	`1`		`@0 Computer aided geometric design`
A66	`01`			`@0 GBR`
C01	`01`		`ENG`	@0 Anisotropic triangle meshes are used for efficient approximation of surfaces and flow data in finite element analysis, and in these applications it is desirable to have as few obtuse triangles as possible to reduce the discretization error. We present a variational approach to suppressing obtuse triangles in anisotropic meshes. Specifically, we introduce a hexagonal Minkowski metric, which is sensitive to triangle orientation, to give a new formulation of the centroidal Voronoi tessellation (CVT) method. Furthermore, we prove several relevant properties of the CVT method with the newly introduced metric. Experiments show that our algorithm produces anisotropic meshes with much fewer obtuse triangles than using existing methods while maintaining mesh anisotropy.
C02	`01`	`X`		`@0 001D02A05`
C03	`01`	`X`	`FRE`	`@0 Géométrie algorithmique @5 06`
C03	`01`	`X`	`ENG`	`@0 Computational geometry @5 06`
C03	`01`	`X`	`SPA`	`@0 Geometría computacional @5 06`
C03	`02`	`X`	`FRE`	`@0 Discrétisation @5 18`
C03	`02`	`X`	`ENG`	`@0 Discretization @5 18`
C03	`02`	`X`	`SPA`	`@0 Discretización @5 18`
C03	`03`	`X`	`FRE`	`@0 Anisotropie @5 19`
C03	`03`	`X`	`ENG`	`@0 Anisotropy @5 19`
C03	`03`	`X`	`SPA`	`@0 Anisotropía @5 19`
C03	`04`	`X`	`FRE`	`@0 Modélisation @5 23`
C03	`04`	`X`	`ENG`	`@0 Modeling @5 23`
C03	`04`	`X`	`SPA`	`@0 Modelización @5 23`
C03	`05`	`X`	`FRE`	`@0 Calcul variationnel @5 24`
C03	`05`	`X`	`ENG`	`@0 Variational calculus @5 24`
C03	`05`	`X`	`SPA`	`@0 Cálculo de variaciones @5 24`
C03	`06`	`X`	`FRE`	`@0 Métrique Minkowski @5 25`
C03	`06`	`X`	`ENG`	`@0 Minkowski metric @5 25`
C03	`06`	`X`	`SPA`	`@0 Métrico Minkowski @5 25`
C03	`07`	`X`	`FRE`	`@0 Orientation @5 26`
C03	`07`	`X`	`ENG`	`@0 Orientation @5 26`
C03	`07`	`X`	`SPA`	`@0 Orientación @5 26`
C03	`08`	`X`	`FRE`	`@0 Barycentre @5 27`
C03	`08`	`X`	`ENG`	`@0 Barycenter @5 27`
C03	`08`	`X`	`SPA`	`@0 Baricentro @5 27`
C03	`09`	`X`	`FRE`	`@0 Pavage @5 28`
C03	`09`	`X`	`ENG`	`@0 Tiling @5 28`
C03	`10`	`X`	`FRE`	`@0 Diagramme Voronoï @5 29`
C03	`10`	`X`	`ENG`	`@0 Voronoï diagram @5 29`
C03	`10`	`X`	`SPA`	`@0 Diagrama Voronoi @5 29`
C03	`11`	`X`	`FRE`	`@0 Méthode maille @5 30`
C03	`11`	`X`	`ENG`	`@0 Mesh method @5 30`
C03	`11`	`X`	`SPA`	`@0 Método malla @5 30`
C03	`12`	`X`	`FRE`	`@0 Triangulation @5 31`
C03	`12`	`X`	`ENG`	`@0 Triangulation @5 31`
C03	`12`	`X`	`SPA`	`@0 Triangulación @5 31`
C03	`13`	`X`	`FRE`	`@0 Analyse flux donnée @4 CD @5 96`
C03	`13`	`X`	`ENG`	`@0 Data flow analysis @4 CD @5 96`
C03	`13`	`X`	`SPA`	`@0 Análisis de flujo de datos @4 CD @5 96`
C03	`14`	`X`	`FRE`	`@0 Génération maille @4 CD @5 97`
C03	`14`	`X`	`ENG`	`@0 Mesh generation @4 CD @5 97`
C03	`14`	`X`	`SPA`	`@0 Generación red @4 CD @5 97`
N21				`@1 058`
N44	`01`			`@1 OTO`
N82				`@1 OTO`

Links toward previous steps (curation, corpus...)

to stream PascalFrancis, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000124

Links to Exploration step

Pascal:12-0080675

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Obtuse triangle suppression in anisotropic meshes</title>
<author><name sortKey="Feng Sun" sort="Feng Sun" uniqKey="Feng Sun" last="Feng Sun">FENG SUN</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Department of Computer Science, The University of HongKong, Pokfulam Road</s1>
<s3>HKG</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>Hong Kong</country>
</affiliation>
</author>
<author><name sortKey="Choi, Yi King" sort="Choi, Yi King" uniqKey="Choi Y" first="Yi-King" last="Choi">Yi-King Choi</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Department of Computer Science, The University of HongKong, Pokfulam Road</s1>
<s3>HKG</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>Hong Kong</country>
</affiliation>
</author>
<author><name sortKey="Wenping Wang" sort="Wenping Wang" uniqKey="Wenping Wang" last="Wenping Wang">WENPING WANG</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Department of Computer Science, The University of HongKong, Pokfulam Road</s1>
<s3>HKG</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>Hong Kong</country>
</affiliation>
</author>
<author><name sortKey="Yan, Dong Ming" sort="Yan, Dong Ming" uniqKey="Yan D" first="Dong-Ming" last="Yan">Dong-Ming Yan</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Department of Computer Science, The University of HongKong, Pokfulam Road</s1>
<s3>HKG</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>Hong Kong</country>
</affiliation>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>LORIA/INRIA Lorraine, Project ALICE, Campus scientifique 615, rue du Jardin Botanique</s1>
<s2>54600, Villers les Nancy</s2>
<s3>FRA</s3>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
<sZ>6 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
<affiliation wicri:level="1"><inist:fA14 i1="03"><s1>Geometric Modeling and Scientific Visualization Center, KAUST</s1>
<s2>Thuwal 23955-6900</s2>
<s3>SAU</s3>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>Arabie saoudite</country>
</affiliation>
</author>
<author><name sortKey="Yang Liu" sort="Yang Liu" uniqKey="Yang Liu" last="Yang Liu">YANG LIU</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>LORIA/INRIA Lorraine, Project ALICE, Campus scientifique 615, rue du Jardin Botanique</s1>
<s2>54600, Villers les Nancy</s2>
<s3>FRA</s3>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
<sZ>6 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
<affiliation wicri:level="1"><inist:fA14 i1="04"><s1>Microsoft Research Asia, 5/F, Beijing Sigma Center, No. 49, Zhichun Road</s1>
<s2>Haidian District, Beijing, 100190</s2>
<s3>CHN</s3>
<sZ>5 aut.</sZ>
</inist:fA14>
<country>République populaire de Chine</country>
</affiliation>
</author>
<author><name sortKey="Levy, Bruno" sort="Levy, Bruno" uniqKey="Levy B" first="Bruno" last="Levy">Bruno Levy</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>LORIA/INRIA Lorraine, Project ALICE, Campus scientifique 615, rue du Jardin Botanique</s1>
<s2>54600, Villers les Nancy</s2>
<s3>FRA</s3>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
<sZ>6 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">12-0080675</idno>
<date when="2011">2011</date>
<idno type="stanalyst">PASCAL 12-0080675 INIST</idno>
<idno type="RBID">Pascal:12-0080675</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000124</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000887</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Obtuse triangle suppression in anisotropic meshes</title>
<author><name sortKey="Feng Sun" sort="Feng Sun" uniqKey="Feng Sun" last="Feng Sun">FENG SUN</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Department of Computer Science, The University of HongKong, Pokfulam Road</s1>
<s3>HKG</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>Hong Kong</country>
</affiliation>
</author>
<author><name sortKey="Choi, Yi King" sort="Choi, Yi King" uniqKey="Choi Y" first="Yi-King" last="Choi">Yi-King Choi</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Department of Computer Science, The University of HongKong, Pokfulam Road</s1>
<s3>HKG</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>Hong Kong</country>
</affiliation>
</author>
<author><name sortKey="Wenping Wang" sort="Wenping Wang" uniqKey="Wenping Wang" last="Wenping Wang">WENPING WANG</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Department of Computer Science, The University of HongKong, Pokfulam Road</s1>
<s3>HKG</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>Hong Kong</country>
</affiliation>
</author>
<author><name sortKey="Yan, Dong Ming" sort="Yan, Dong Ming" uniqKey="Yan D" first="Dong-Ming" last="Yan">Dong-Ming Yan</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Department of Computer Science, The University of HongKong, Pokfulam Road</s1>
<s3>HKG</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>Hong Kong</country>
</affiliation>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>LORIA/INRIA Lorraine, Project ALICE, Campus scientifique 615, rue du Jardin Botanique</s1>
<s2>54600, Villers les Nancy</s2>
<s3>FRA</s3>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
<sZ>6 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
<affiliation wicri:level="1"><inist:fA14 i1="03"><s1>Geometric Modeling and Scientific Visualization Center, KAUST</s1>
<s2>Thuwal 23955-6900</s2>
<s3>SAU</s3>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>Arabie saoudite</country>
</affiliation>
</author>
<author><name sortKey="Yang Liu" sort="Yang Liu" uniqKey="Yang Liu" last="Yang Liu">YANG LIU</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>LORIA/INRIA Lorraine, Project ALICE, Campus scientifique 615, rue du Jardin Botanique</s1>
<s2>54600, Villers les Nancy</s2>
<s3>FRA</s3>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
<sZ>6 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
<affiliation wicri:level="1"><inist:fA14 i1="04"><s1>Microsoft Research Asia, 5/F, Beijing Sigma Center, No. 49, Zhichun Road</s1>
<s2>Haidian District, Beijing, 100190</s2>
<s3>CHN</s3>
<sZ>5 aut.</sZ>
</inist:fA14>
<country>République populaire de Chine</country>
</affiliation>
</author>
<author><name sortKey="Levy, Bruno" sort="Levy, Bruno" uniqKey="Levy B" first="Bruno" last="Levy">Bruno Levy</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>LORIA/INRIA Lorraine, Project ALICE, Campus scientifique 615, rue du Jardin Botanique</s1>
<s2>54600, Villers les Nancy</s2>
<s3>FRA</s3>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
<sZ>6 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Computer aided geometric design</title>
<title level="j" type="abbreviated">Comput. aided geom. des.</title>
<idno type="ISSN">0167-8396</idno>
<imprint><date when="2011">2011</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Computer aided geometric design</title>
<title level="j" type="abbreviated">Comput. aided geom. des.</title>
<idno type="ISSN">0167-8396</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Anisotropy</term>
<term>Barycenter</term>
<term>Computational geometry</term>
<term>Data flow analysis</term>
<term>Discretization</term>
<term>Mesh generation</term>
<term>Mesh method</term>
<term>Minkowski metric</term>
<term>Modeling</term>
<term>Orientation</term>
<term>Tiling</term>
<term>Triangulation</term>
<term>Variational calculus</term>
<term>Voronoï diagram</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Géométrie algorithmique</term>
<term>Discrétisation</term>
<term>Anisotropie</term>
<term>Modélisation</term>
<term>Calcul variationnel</term>
<term>Métrique Minkowski</term>
<term>Orientation</term>
<term>Barycentre</term>
<term>Pavage</term>
<term>Diagramme Voronoï</term>
<term>Méthode maille</term>
<term>Triangulation</term>
<term>Analyse flux donnée</term>
<term>Génération maille</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Anisotropic triangle meshes are used for efficient approximation of surfaces and flow data in finite element analysis, and in these applications it is desirable to have as few obtuse triangles as possible to reduce the discretization error. We present a variational approach to suppressing obtuse triangles in anisotropic meshes. Specifically, we introduce a hexagonal Minkowski metric, which is sensitive to triangle orientation, to give a new formulation of the centroidal Voronoi tessellation (CVT) method. Furthermore, we prove several relevant properties of the CVT method with the newly introduced metric. Experiments show that our algorithm produces anisotropic meshes with much fewer obtuse triangles than using existing methods while maintaining mesh anisotropy.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0167-8396</s0>
</fA01>
<fA02 i1="01"><s0>CAGDEX</s0>
</fA02>
<fA03 i2="1"><s0>Comput. aided geom. des.</s0>
</fA03>
<fA05><s2>28</s2>
</fA05>
<fA06><s2>9</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG"><s1>Obtuse triangle suppression in anisotropic meshes</s1>
</fA08>
<fA11 i1="01" i2="1"><s1>FENG SUN</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>CHOI (Yi-King)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>WENPING WANG</s1>
</fA11>
<fA11 i1="04" i2="1"><s1>YAN (Dong-Ming)</s1>
</fA11>
<fA11 i1="05" i2="1"><s1>YANG LIU</s1>
</fA11>
<fA11 i1="06" i2="1"><s1>LEVY (Bruno)</s1>
</fA11>
<fA14 i1="01"><s1>Department of Computer Science, The University of HongKong, Pokfulam Road</s1>
<s3>HKG</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>LORIA/INRIA Lorraine, Project ALICE, Campus scientifique 615, rue du Jardin Botanique</s1>
<s2>54600, Villers les Nancy</s2>
<s3>FRA</s3>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
<sZ>6 aut.</sZ>
</fA14>
<fA14 i1="03"><s1>Geometric Modeling and Scientific Visualization Center, KAUST</s1>
<s2>Thuwal 23955-6900</s2>
<s3>SAU</s3>
<sZ>4 aut.</sZ>
</fA14>
<fA14 i1="04"><s1>Microsoft Research Asia, 5/F, Beijing Sigma Center, No. 49, Zhichun Road</s1>
<s2>Haidian District, Beijing, 100190</s2>
<s3>CHN</s3>
<sZ>5 aut.</sZ>
</fA14>
<fA20><s1>537-548</s1>
</fA20>
<fA21><s1>2011</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>INIST</s1>
<s2>20700</s2>
<s5>354000507360660030</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2012 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>3/4 p.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>12-0080675</s0>
</fA47>
<fA60><s1>P</s1>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>Computer aided geometric design</s0>
</fA64>
<fA66 i1="01"><s0>GBR</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>Anisotropic triangle meshes are used for efficient approximation of surfaces and flow data in finite element analysis, and in these applications it is desirable to have as few obtuse triangles as possible to reduce the discretization error. We present a variational approach to suppressing obtuse triangles in anisotropic meshes. Specifically, we introduce a hexagonal Minkowski metric, which is sensitive to triangle orientation, to give a new formulation of the centroidal Voronoi tessellation (CVT) method. Furthermore, we prove several relevant properties of the CVT method with the newly introduced metric. Experiments show that our algorithm produces anisotropic meshes with much fewer obtuse triangles than using existing methods while maintaining mesh anisotropy.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02A05</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Géométrie algorithmique</s0>
<s5>06</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Computational geometry</s0>
<s5>06</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Geometría computacional</s0>
<s5>06</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Discrétisation</s0>
<s5>18</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Discretization</s0>
<s5>18</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Discretización</s0>
<s5>18</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Anisotropie</s0>
<s5>19</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Anisotropy</s0>
<s5>19</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Anisotropía</s0>
<s5>19</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Modélisation</s0>
<s5>23</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Modeling</s0>
<s5>23</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Modelización</s0>
<s5>23</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Calcul variationnel</s0>
<s5>24</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Variational calculus</s0>
<s5>24</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Cálculo de variaciones</s0>
<s5>24</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Métrique Minkowski</s0>
<s5>25</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Minkowski metric</s0>
<s5>25</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Métrico Minkowski</s0>
<s5>25</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Orientation</s0>
<s5>26</s5>
</fC03>
<fC03 i1="07" i2="X" l="ENG"><s0>Orientation</s0>
<s5>26</s5>
</fC03>
<fC03 i1="07" i2="X" l="SPA"><s0>Orientación</s0>
<s5>26</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Barycentre</s0>
<s5>27</s5>
</fC03>
<fC03 i1="08" i2="X" l="ENG"><s0>Barycenter</s0>
<s5>27</s5>
</fC03>
<fC03 i1="08" i2="X" l="SPA"><s0>Baricentro</s0>
<s5>27</s5>
</fC03>
<fC03 i1="09" i2="X" l="FRE"><s0>Pavage</s0>
<s5>28</s5>
</fC03>
<fC03 i1="09" i2="X" l="ENG"><s0>Tiling</s0>
<s5>28</s5>
</fC03>
<fC03 i1="10" i2="X" l="FRE"><s0>Diagramme Voronoï</s0>
<s5>29</s5>
</fC03>
<fC03 i1="10" i2="X" l="ENG"><s0>Voronoï diagram</s0>
<s5>29</s5>
</fC03>
<fC03 i1="10" i2="X" l="SPA"><s0>Diagrama Voronoi</s0>
<s5>29</s5>
</fC03>
<fC03 i1="11" i2="X" l="FRE"><s0>Méthode maille</s0>
<s5>30</s5>
</fC03>
<fC03 i1="11" i2="X" l="ENG"><s0>Mesh method</s0>
<s5>30</s5>
</fC03>
<fC03 i1="11" i2="X" l="SPA"><s0>Método malla</s0>
<s5>30</s5>
</fC03>
<fC03 i1="12" i2="X" l="FRE"><s0>Triangulation</s0>
<s5>31</s5>
</fC03>
<fC03 i1="12" i2="X" l="ENG"><s0>Triangulation</s0>
<s5>31</s5>
</fC03>
<fC03 i1="12" i2="X" l="SPA"><s0>Triangulación</s0>
<s5>31</s5>
</fC03>
<fC03 i1="13" i2="X" l="FRE"><s0>Analyse flux donnée</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fC03 i1="13" i2="X" l="ENG"><s0>Data flow analysis</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fC03 i1="13" i2="X" l="SPA"><s0>Análisis de flujo de datos</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fC03 i1="14" i2="X" l="FRE"><s0>Génération maille</s0>
<s4>CD</s4>
<s5>97</s5>
</fC03>
<fC03 i1="14" i2="X" l="ENG"><s0>Mesh generation</s0>
<s4>CD</s4>
<s5>97</s5>
</fC03>
<fC03 i1="14" i2="X" l="SPA"><s0>Generación red</s0>
<s4>CD</s4>
<s5>97</s5>
</fC03>
<fN21><s1>058</s1>
</fN21>
<fN44 i1="01"><s1>OTO</s1>
</fN44>
<fN82><s1>OTO</s1>
</fN82>
</pA>
</standard>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Curation

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000887 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Curation/biblio.hfd -nk 000887 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    PascalFrancis
   |étape=   Curation
   |type=    RBID
   |clé=     Pascal:12-0080675
   |texte=   Obtuse triangle suppression in anisotropic meshes
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur la recherche en informatique en Lorraine

Obtuse triangle suppression in anisotropic meshes

Obtuse triangle suppression in anisotropic meshes

Source :

Descripteurs français

English descriptors

Abstract

Links toward previous steps (curation, corpus...)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri