InforLorV4, PascalFrancis, Corpus, bibRecord, 000530

Visualization of grids conforming to geological structures : a topological approach

Identifieur interne : 000530 ( PascalFrancis/Corpus ); précédent : 000529; suivant : 000531

Visualization of grids conforming to geological structures : a topological approach

Auteurs : Guillaume Caumon ; Bruno Levy ; Laurent Castanie ; Jean-Claude Paul

Source :

Computers & geosciences [ 0098-3004 ] ; 2005.

RBID : Pascal:05-0369135

Descripteurs français

Pascal (Inist)
- Algorithme, Efficacité, Catalogue, Modèle, Ordinateur, Traitement donnée, Topologie, Stratigraphie, Haute résolution, Carte, Cartographie, Modèle 3 dimensions.

English descriptors

KwdEn :
- algorithms, cartography, catalogs, computers, data processing, efficiency, high resolution, maps, models, stratigraphy, three-dimensional models, topology.

Abstract

Flexible grids are used in many Geoscience applications because they can accurately adapt to the great diversity of shapes encountered in nature. These grids raise a number difficult challenges, in particular for fast volume visualization. We propose a generic incremental slicing algorithm for versatile visualization of unstructured grids, these being constituted of arbitrary convex cells. The tradeoff between the complexity of the grid and the efficiency of the method is addressed by special-purpose data structures and customizations. A general structure based on oriented edges is defined to address the general case. When only a limited number of polyhedron types is present in the grid (zoo grids), memory usage and rendering time are reduced by using a catalog of cell types generated automatically. This data structure is further optimized to deal with stratigraphic grids made of hexahedral cells. The visualization method is applied to several gridded subsurface models conforming to geological structures.

Notice en format standard (ISO 2709)

Pour connaître la documentation sur le format Inist Standard.

A01	`01`	`1`		`@0 0098-3004`
A03		`1`		`@0 Comput. geosci.`
A05				`@2 31`
A06				`@2 6`
A08	`01`	`1`	`ENG`	`@1 Visualization of grids conforming to geological structures : a topological approach`
A11	`01`	`1`		`@1 CAUMON (Guillaume)`
A11	`02`	`1`		`@1 LEVY (Bruno)`
A11	`03`	`1`		`@1 CASTANIE (Laurent)`
A11	`04`	`1`		`@1 PAUL (Jean-Claude)`
A14	`01`			`@1 ENSG, INPL-CRPG, rue du Doyen M. Roubault @2 54501 Vandoeuvre @3 FRA @Z 1 aut. @Z 3 aut.`
A14	`02`			`@1 ISA Loria, rue du Jardin Botanique @2 54500 Vandoeuvre @3 FRA @Z 2 aut. @Z 4 aut.`
A14	`03`			`@1 LIAMA, School of Software, Tsinghua University @2 100084 Beijing @3 CHN @Z 4 aut.`
A20				`@1 671-680`
A21				`@1 2005`
A23	`01`			`@0 ENG`
A43	`01`			`@1 INIST @2 17165 @5 354000138365650010`
A44				`@0 0000 @1 © 2005 INIST-CNRS. All rights reserved.`
A45				`@0 29 ref.`
A47	`01`	`1`		`@0 05-0369135`
A60				`@1 P`
A61				`@0 A`
A64	`01`	`1`		`@0 Computers & geosciences`
A66	`01`			`@0 GBR`
C01	`01`		`ENG`	@0 Flexible grids are used in many Geoscience applications because they can accurately adapt to the great diversity of shapes encountered in nature. These grids raise a number difficult challenges, in particular for fast volume visualization. We propose a generic incremental slicing algorithm for versatile visualization of unstructured grids, these being constituted of arbitrary convex cells. The tradeoff between the complexity of the grid and the efficiency of the method is addressed by special-purpose data structures and customizations. A general structure based on oriented edges is defined to address the general case. When only a limited number of polyhedron types is present in the grid (zoo grids), memory usage and rendering time are reduced by using a catalog of cell types generated automatically. This data structure is further optimized to deal with stratigraphic grids made of hexahedral cells. The visualization method is applied to several gridded subsurface models conforming to geological structures.
C02	`01`	`2`		`@0 224A`
C02	`02`	`2`		`@0 001E01I`
C03	`01`	`2`	`FRE`	`@0 Algorithme @5 01`
C03	`01`	`2`	`ENG`	`@0 algorithms @5 01`
C03	`01`	`2`	`SPA`	`@0 Algoritmo @5 01`
C03	`02`	`2`	`FRE`	`@0 Efficacité @5 02`
C03	`02`	`2`	`ENG`	`@0 efficiency @5 02`
C03	`03`	`2`	`FRE`	`@0 Catalogue @5 03`
C03	`03`	`2`	`ENG`	`@0 catalogs @5 03`
C03	`03`	`2`	`SPA`	`@0 Catálogo @5 03`
C03	`04`	`2`	`FRE`	`@0 Modèle @5 04`
C03	`04`	`2`	`ENG`	`@0 models @5 04`
C03	`04`	`2`	`SPA`	`@0 Modelo @5 04`
C03	`05`	`2`	`FRE`	`@0 Ordinateur @5 05`
C03	`05`	`2`	`ENG`	`@0 computers @5 05`
C03	`05`	`2`	`SPA`	`@0 Computadora @5 05`
C03	`06`	`2`	`FRE`	`@0 Traitement donnée @5 06`
C03	`06`	`2`	`ENG`	`@0 data processing @5 06`
C03	`06`	`2`	`SPA`	`@0 Tratamiento datos @5 06`
C03	`07`	`2`	`FRE`	`@0 Topologie @5 07`
C03	`07`	`2`	`ENG`	`@0 topology @5 07`
C03	`07`	`2`	`SPA`	`@0 Topología @5 07`
C03	`08`	`2`	`FRE`	`@0 Stratigraphie @5 08`
C03	`08`	`2`	`ENG`	`@0 stratigraphy @5 08`
C03	`08`	`2`	`SPA`	`@0 Estratigrafía @5 08`
C03	`09`	`2`	`FRE`	`@0 Haute résolution @5 09`
C03	`09`	`2`	`ENG`	`@0 high resolution @5 09`
C03	`09`	`2`	`SPA`	`@0 Alta resolucion @5 09`
C03	`10`	`2`	`FRE`	`@0 Carte @5 10`
C03	`10`	`2`	`ENG`	`@0 maps @5 10`
C03	`10`	`2`	`SPA`	`@0 Mapa @5 10`
C03	`11`	`2`	`FRE`	`@0 Cartographie @5 11`
C03	`11`	`2`	`ENG`	`@0 cartography @5 11`
C03	`11`	`2`	`SPA`	`@0 Cartografía @5 11`
C03	`12`	`2`	`FRE`	`@0 Modèle 3 dimensions @5 12`
C03	`12`	`2`	`ENG`	`@0 three-dimensional models @5 12`
C03	`12`	`2`	`SPA`	`@0 Modelo 3 dimensiones @5 12`
N21				`@1 255`

Format Inist (serveur)

NO :	PASCAL 05-0369135 INIST
ET :	Visualization of grids conforming to geological structures : a topological approach
AU :	CAUMON (Guillaume); LEVY (Bruno); CASTANIE (Laurent); PAUL (Jean-Claude)
AF :	ENSG, INPL-CRPG, rue du Doyen M. Roubault/54501 Vandoeuvre/France (1 aut., 3 aut.); ISA Loria, rue du Jardin Botanique/54500 Vandoeuvre/France (2 aut., 4 aut.); LIAMA, School of Software, Tsinghua University/100084 Beijing/Chine (4 aut.)
DT :	Publication en série; Niveau analytique
SO :	Computers & geosciences; ISSN 0098-3004; Royaume-Uni; Da. 2005; Vol. 31; No. 6; Pp. 671-680; Bibl. 29 ref.
LA :	Anglais
EA :	Flexible grids are used in many Geoscience applications because they can accurately adapt to the great diversity of shapes encountered in nature. These grids raise a number difficult challenges, in particular for fast volume visualization. We propose a generic incremental slicing algorithm for versatile visualization of unstructured grids, these being constituted of arbitrary convex cells. The tradeoff between the complexity of the grid and the efficiency of the method is addressed by special-purpose data structures and customizations. A general structure based on oriented edges is defined to address the general case. When only a limited number of polyhedron types is present in the grid (zoo grids), memory usage and rendering time are reduced by using a catalog of cell types generated automatically. This data structure is further optimized to deal with stratigraphic grids made of hexahedral cells. The visualization method is applied to several gridded subsurface models conforming to geological structures.
CC :	224A; 001E01I
FD :	Algorithme; Efficacité; Catalogue; Modèle; Ordinateur; Traitement donnée; Topologie; Stratigraphie; Haute résolution; Carte; Cartographie; Modèle 3 dimensions
ED :	algorithms; efficiency; catalogs; models; computers; data processing; topology; stratigraphy; high resolution; maps; cartography; three-dimensional models
SD :	Algoritmo; Catálogo; Modelo; Computadora; Tratamiento datos; Topología; Estratigrafía; Alta resolucion; Mapa; Cartografía; Modelo 3 dimensiones
LO :	INIST-17165.354000138365650010
ID :	05-0369135

Links to Exploration step

Pascal:05-0369135

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Visualization of grids conforming to geological structures : a topological approach</title>
<author><name sortKey="Caumon, Guillaume" sort="Caumon, Guillaume" uniqKey="Caumon G" first="Guillaume" last="Caumon">Guillaume Caumon</name>
<affiliation><inist:fA14 i1="01"><s1>ENSG, INPL-CRPG, rue du Doyen M. Roubault</s1>
<s2>54501 Vandoeuvre</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Levy, Bruno" sort="Levy, Bruno" uniqKey="Levy B" first="Bruno" last="Levy">Bruno Levy</name>
<affiliation><inist:fA14 i1="02"><s1>ISA Loria, rue du Jardin Botanique</s1>
<s2>54500 Vandoeuvre</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Castanie, Laurent" sort="Castanie, Laurent" uniqKey="Castanie L" first="Laurent" last="Castanie">Laurent Castanie</name>
<affiliation><inist:fA14 i1="01"><s1>ENSG, INPL-CRPG, rue du Doyen M. Roubault</s1>
<s2>54501 Vandoeuvre</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Paul, Jean Claude" sort="Paul, Jean Claude" uniqKey="Paul J" first="Jean-Claude" last="Paul">Jean-Claude Paul</name>
<affiliation><inist:fA14 i1="02"><s1>ISA Loria, rue du Jardin Botanique</s1>
<s2>54500 Vandoeuvre</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
</affiliation>
<affiliation><inist:fA14 i1="03"><s1>LIAMA, School of Software, Tsinghua University</s1>
<s2>100084 Beijing</s2>
<s3>CHN</s3>
<sZ>4 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">05-0369135</idno>
<date when="2005">2005</date>
<idno type="stanalyst">PASCAL 05-0369135 INIST</idno>
<idno type="RBID">Pascal:05-0369135</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000530</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Visualization of grids conforming to geological structures : a topological approach</title>
<author><name sortKey="Caumon, Guillaume" sort="Caumon, Guillaume" uniqKey="Caumon G" first="Guillaume" last="Caumon">Guillaume Caumon</name>
<affiliation><inist:fA14 i1="01"><s1>ENSG, INPL-CRPG, rue du Doyen M. Roubault</s1>
<s2>54501 Vandoeuvre</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Levy, Bruno" sort="Levy, Bruno" uniqKey="Levy B" first="Bruno" last="Levy">Bruno Levy</name>
<affiliation><inist:fA14 i1="02"><s1>ISA Loria, rue du Jardin Botanique</s1>
<s2>54500 Vandoeuvre</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Castanie, Laurent" sort="Castanie, Laurent" uniqKey="Castanie L" first="Laurent" last="Castanie">Laurent Castanie</name>
<affiliation><inist:fA14 i1="01"><s1>ENSG, INPL-CRPG, rue du Doyen M. Roubault</s1>
<s2>54501 Vandoeuvre</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Paul, Jean Claude" sort="Paul, Jean Claude" uniqKey="Paul J" first="Jean-Claude" last="Paul">Jean-Claude Paul</name>
<affiliation><inist:fA14 i1="02"><s1>ISA Loria, rue du Jardin Botanique</s1>
<s2>54500 Vandoeuvre</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
</affiliation>
<affiliation><inist:fA14 i1="03"><s1>LIAMA, School of Software, Tsinghua University</s1>
<s2>100084 Beijing</s2>
<s3>CHN</s3>
<sZ>4 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Computers & geosciences</title>
<title level="j" type="abbreviated">Comput. geosci.</title>
<idno type="ISSN">0098-3004</idno>
<imprint><date when="2005">2005</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Computers & geosciences</title>
<title level="j" type="abbreviated">Comput. geosci.</title>
<idno type="ISSN">0098-3004</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>algorithms</term>
<term>cartography</term>
<term>catalogs</term>
<term>computers</term>
<term>data processing</term>
<term>efficiency</term>
<term>high resolution</term>
<term>maps</term>
<term>models</term>
<term>stratigraphy</term>
<term>three-dimensional models</term>
<term>topology</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Algorithme</term>
<term>Efficacité</term>
<term>Catalogue</term>
<term>Modèle</term>
<term>Ordinateur</term>
<term>Traitement donnée</term>
<term>Topologie</term>
<term>Stratigraphie</term>
<term>Haute résolution</term>
<term>Carte</term>
<term>Cartographie</term>
<term>Modèle 3 dimensions</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Flexible grids are used in many Geoscience applications because they can accurately adapt to the great diversity of shapes encountered in nature. These grids raise a number difficult challenges, in particular for fast volume visualization. We propose a generic incremental slicing algorithm for versatile visualization of unstructured grids, these being constituted of arbitrary convex cells. The tradeoff between the complexity of the grid and the efficiency of the method is addressed by special-purpose data structures and customizations. A general structure based on oriented edges is defined to address the general case. When only a limited number of polyhedron types is present in the grid (zoo grids), memory usage and rendering time are reduced by using a catalog of cell types generated automatically. This data structure is further optimized to deal with stratigraphic grids made of hexahedral cells. The visualization method is applied to several gridded subsurface models conforming to geological structures.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0098-3004</s0>
</fA01>
<fA03 i2="1"><s0>Comput. geosci.</s0>
</fA03>
<fA05><s2>31</s2>
</fA05>
<fA06><s2>6</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG"><s1>Visualization of grids conforming to geological structures : a topological approach</s1>
</fA08>
<fA11 i1="01" i2="1"><s1>CAUMON (Guillaume)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>LEVY (Bruno)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>CASTANIE (Laurent)</s1>
</fA11>
<fA11 i1="04" i2="1"><s1>PAUL (Jean-Claude)</s1>
</fA11>
<fA14 i1="01"><s1>ENSG, INPL-CRPG, rue du Doyen M. Roubault</s1>
<s2>54501 Vandoeuvre</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>ISA Loria, rue du Jardin Botanique</s1>
<s2>54500 Vandoeuvre</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
<sZ>4 aut.</sZ>
</fA14>
<fA14 i1="03"><s1>LIAMA, School of Software, Tsinghua University</s1>
<s2>100084 Beijing</s2>
<s3>CHN</s3>
<sZ>4 aut.</sZ>
</fA14>
<fA20><s1>671-680</s1>
</fA20>
<fA21><s1>2005</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>INIST</s1>
<s2>17165</s2>
<s5>354000138365650010</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2005 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>29 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>05-0369135</s0>
</fA47>
<fA60><s1>P</s1>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>Computers & geosciences</s0>
</fA64>
<fA66 i1="01"><s0>GBR</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>Flexible grids are used in many Geoscience applications because they can accurately adapt to the great diversity of shapes encountered in nature. These grids raise a number difficult challenges, in particular for fast volume visualization. We propose a generic incremental slicing algorithm for versatile visualization of unstructured grids, these being constituted of arbitrary convex cells. The tradeoff between the complexity of the grid and the efficiency of the method is addressed by special-purpose data structures and customizations. A general structure based on oriented edges is defined to address the general case. When only a limited number of polyhedron types is present in the grid (zoo grids), memory usage and rendering time are reduced by using a catalog of cell types generated automatically. This data structure is further optimized to deal with stratigraphic grids made of hexahedral cells. The visualization method is applied to several gridded subsurface models conforming to geological structures.</s0>
</fC01>
<fC02 i1="01" i2="2"><s0>224A</s0>
</fC02>
<fC02 i1="02" i2="2"><s0>001E01I</s0>
</fC02>
<fC03 i1="01" i2="2" l="FRE"><s0>Algorithme</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="2" l="ENG"><s0>algorithms</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="2" l="SPA"><s0>Algoritmo</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="2" l="FRE"><s0>Efficacité</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="2" l="ENG"><s0>efficiency</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="2" l="FRE"><s0>Catalogue</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="2" l="ENG"><s0>catalogs</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="2" l="SPA"><s0>Catálogo</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="2" l="FRE"><s0>Modèle</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="2" l="ENG"><s0>models</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="2" l="SPA"><s0>Modelo</s0>
<s5>04</s5>
</fC03>
<fC03 i1="05" i2="2" l="FRE"><s0>Ordinateur</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="2" l="ENG"><s0>computers</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="2" l="SPA"><s0>Computadora</s0>
<s5>05</s5>
</fC03>
<fC03 i1="06" i2="2" l="FRE"><s0>Traitement donnée</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="2" l="ENG"><s0>data processing</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="2" l="SPA"><s0>Tratamiento datos</s0>
<s5>06</s5>
</fC03>
<fC03 i1="07" i2="2" l="FRE"><s0>Topologie</s0>
<s5>07</s5>
</fC03>
<fC03 i1="07" i2="2" l="ENG"><s0>topology</s0>
<s5>07</s5>
</fC03>
<fC03 i1="07" i2="2" l="SPA"><s0>Topología</s0>
<s5>07</s5>
</fC03>
<fC03 i1="08" i2="2" l="FRE"><s0>Stratigraphie</s0>
<s5>08</s5>
</fC03>
<fC03 i1="08" i2="2" l="ENG"><s0>stratigraphy</s0>
<s5>08</s5>
</fC03>
<fC03 i1="08" i2="2" l="SPA"><s0>Estratigrafía</s0>
<s5>08</s5>
</fC03>
<fC03 i1="09" i2="2" l="FRE"><s0>Haute résolution</s0>
<s5>09</s5>
</fC03>
<fC03 i1="09" i2="2" l="ENG"><s0>high resolution</s0>
<s5>09</s5>
</fC03>
<fC03 i1="09" i2="2" l="SPA"><s0>Alta resolucion</s0>
<s5>09</s5>
</fC03>
<fC03 i1="10" i2="2" l="FRE"><s0>Carte</s0>
<s5>10</s5>
</fC03>
<fC03 i1="10" i2="2" l="ENG"><s0>maps</s0>
<s5>10</s5>
</fC03>
<fC03 i1="10" i2="2" l="SPA"><s0>Mapa</s0>
<s5>10</s5>
</fC03>
<fC03 i1="11" i2="2" l="FRE"><s0>Cartographie</s0>
<s5>11</s5>
</fC03>
<fC03 i1="11" i2="2" l="ENG"><s0>cartography</s0>
<s5>11</s5>
</fC03>
<fC03 i1="11" i2="2" l="SPA"><s0>Cartografía</s0>
<s5>11</s5>
</fC03>
<fC03 i1="12" i2="2" l="FRE"><s0>Modèle 3 dimensions</s0>
<s5>12</s5>
</fC03>
<fC03 i1="12" i2="2" l="ENG"><s0>three-dimensional models</s0>
<s5>12</s5>
</fC03>
<fC03 i1="12" i2="2" l="SPA"><s0>Modelo 3 dimensiones</s0>
<s5>12</s5>
</fC03>
<fN21><s1>255</s1>
</fN21>
</pA>
</standard>
<server><NO>PASCAL 05-0369135 INIST</NO>
<ET>Visualization of grids conforming to geological structures : a topological approach</ET>
<AU>CAUMON (Guillaume); LEVY (Bruno); CASTANIE (Laurent); PAUL (Jean-Claude)</AU>
<AF>ENSG, INPL-CRPG, rue du Doyen M. Roubault/54501 Vandoeuvre/France (1 aut., 3 aut.); ISA Loria, rue du Jardin Botanique/54500 Vandoeuvre/France (2 aut., 4 aut.); LIAMA, School of Software, Tsinghua University/100084 Beijing/Chine (4 aut.)</AF>
<DT>Publication en série; Niveau analytique</DT>
<SO>Computers & geosciences; ISSN 0098-3004; Royaume-Uni; Da. 2005; Vol. 31; No. 6; Pp. 671-680; Bibl. 29 ref.</SO>
<LA>Anglais</LA>
<EA>Flexible grids are used in many Geoscience applications because they can accurately adapt to the great diversity of shapes encountered in nature. These grids raise a number difficult challenges, in particular for fast volume visualization. We propose a generic incremental slicing algorithm for versatile visualization of unstructured grids, these being constituted of arbitrary convex cells. The tradeoff between the complexity of the grid and the efficiency of the method is addressed by special-purpose data structures and customizations. A general structure based on oriented edges is defined to address the general case. When only a limited number of polyhedron types is present in the grid (zoo grids), memory usage and rendering time are reduced by using a catalog of cell types generated automatically. This data structure is further optimized to deal with stratigraphic grids made of hexahedral cells. The visualization method is applied to several gridded subsurface models conforming to geological structures.</EA>
<CC>224A; 001E01I</CC>
<FD>Algorithme; Efficacité; Catalogue; Modèle; Ordinateur; Traitement donnée; Topologie; Stratigraphie; Haute résolution; Carte; Cartographie; Modèle 3 dimensions</FD>
<ED>algorithms; efficiency; catalogs; models; computers; data processing; topology; stratigraphy; high resolution; maps; cartography; three-dimensional models</ED>
<SD>Algoritmo; Catálogo; Modelo; Computadora; Tratamiento datos; Topología; Estratigrafía; Alta resolucion; Mapa; Cartografía; Modelo 3 dimensiones</SD>
<LO>INIST-17165.354000138365650010</LO>
<ID>05-0369135</ID>
</server>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

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

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

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000530 | SxmlIndent | more

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    PascalFrancis
   |étape=   Corpus
   |type=    RBID
   |clé=     Pascal:05-0369135
   |texte=   Visualization of grids conforming to geological structures : a topological approach
}}

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

Visualization of grids conforming to geological structures : a topological approach

Visualization of grids conforming to geological structures : a topological approach

Source :

Descripteurs français

English descriptors

Abstract

Notice en format standard (ISO 2709)

Format Inist (serveur)

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