InforLorV4, PascalFrancis, Corpus, bibRecord, 000284

Minimal arithmetic thickness connecting discrete planes

Identifieur interne : 000284 ( PascalFrancis/Corpus ); précédent : 000283; suivant : 000285

Minimal arithmetic thickness connecting discrete planes

Auteurs : Damien Jamet ; Jean-Luc Toutant

Source :

Discrete applied mathematics [ 0166-218X ] ; 2009.

RBID : Pascal:09-0067432

Descripteurs français

Pascal (Inist)
- Arithmétique, Plan, Hyperplan, Calcul 3 dimensions, Vecteur, Algorithme, Géométrie discrète, Connexité, Informatique théorique, Optimisation, Combinatoire, 68Wxx, 52XX.

English descriptors

KwdEn :
- Algorithm, Arithmetics, Combinatorics, Computer theory, Connectedness, Discrete geometry, Hyperplane, Optimization, Plane, Three-dimensional calculations, Vector.

Abstract

While connected arithmetic discrete lines are entirely characterized, only partial results exist for the more general case of arithmetic discrete hyperplanes. In the present paper, we focus on the three-dimensional case, that is on arithmetic discrete planes. Thanks to arithmetic reductions on a vector n, we provide algorithms either to determine whether a given arithmetic discrete plane with n as normal vector is connected, or to compute the minimal thickness for which an arithmetic discrete plane with normal vector n is connected.

Notice en format standard (ISO 2709)

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

A01	`01`	`1`		`@0 0166-218X`
A02	`01`			`@0 DAMADU`
A03		`1`		`@0 Discrete appl. math.`
A05				`@2 157`
A06				`@2 3`
A08	`01`	`1`	`ENG`	`@1 Minimal arithmetic thickness connecting discrete planes`
A09	`01`	`1`	`ENG`	`@1 International Conference on Discrete Geometry for Computer Imagery DGCI 2006`
A11	`01`	`1`		`@1 JAMET (Damien)`
A11	`02`	`1`		`@1 TOUTANT (Jean-Luc)`
A12	`01`	`1`		`@1 NYUL (L. G.) @9 ed.`
A12	`02`	`1`		`@1 PALAGYI (K.) @9 ed.`
A14	`01`			`@1 Loria -Univ. Nancy 1, Campus Scientifique, BP 239 @2 54506 Vandœuvre-lès-Nancy @3 FRA @Z 1 aut.`
A14	`02`			`@1 LIRMM. Univ. Montpellier2, CNRS; 161 rue Ada @2 34392 Montpellier @3 FRA @Z 2 aut.`
A20				`@1 500-509`
A21				`@1 2009`
A23	`01`			`@0 ENG`
A43	`01`			`@1 INIST @2 18287 @5 354000185136640060`
A44				`@0 0000 @1 © 2009 INIST-CNRS. All rights reserved.`
A45				`@0 7 ref.`
A47	`01`	`1`		`@0 09-0067432`
A60				`@1 P @2 C`
A61				`@0 A`
A64	`01`	`1`		`@0 Discrete applied mathematics`
A66	`01`			`@0 NLD`
C01	`01`		`ENG`	@0 While connected arithmetic discrete lines are entirely characterized, only partial results exist for the more general case of arithmetic discrete hyperplanes. In the present paper, we focus on the three-dimensional case, that is on arithmetic discrete planes. Thanks to arithmetic reductions on a vector n, we provide algorithms either to determine whether a given arithmetic discrete plane with n as normal vector is connected, or to compute the minimal thickness for which an arithmetic discrete plane with normal vector n is connected.
C02	`01`	`X`		`@0 001D02A05`
C02	`02`	`X`		`@0 001A02B01`
C02	`03`	`X`		`@0 001A02F02`
C03	`01`	`X`	`FRE`	`@0 Arithmétique @5 17`
C03	`01`	`X`	`ENG`	`@0 Arithmetics @5 17`
C03	`01`	`X`	`SPA`	`@0 Aritmética @5 17`
C03	`02`	`X`	`FRE`	`@0 Plan @5 18`
C03	`02`	`X`	`ENG`	`@0 Plane @5 18`
C03	`02`	`X`	`SPA`	`@0 Plano @5 18`
C03	`03`	`X`	`FRE`	`@0 Hyperplan @5 19`
C03	`03`	`X`	`ENG`	`@0 Hyperplane @5 19`
C03	`03`	`X`	`SPA`	`@0 Hiperplano @5 19`
C03	`04`	`3`	`FRE`	`@0 Calcul 3 dimensions @5 20`
C03	`04`	`3`	`ENG`	`@0 Three-dimensional calculations @5 20`
C03	`05`	`X`	`FRE`	`@0 Vecteur @5 21`
C03	`05`	`X`	`ENG`	`@0 Vector @5 21`
C03	`05`	`X`	`SPA`	`@0 Vector @5 21`
C03	`06`	`X`	`FRE`	`@0 Algorithme @5 22`
C03	`06`	`X`	`ENG`	`@0 Algorithm @5 22`
C03	`06`	`X`	`SPA`	`@0 Algoritmo @5 22`
C03	`07`	`X`	`FRE`	`@0 Géométrie discrète @5 23`
C03	`07`	`X`	`ENG`	`@0 Discrete geometry @5 23`
C03	`07`	`X`	`SPA`	`@0 Geometría discreta @5 23`
C03	`08`	`X`	`FRE`	`@0 Connexité @5 24`
C03	`08`	`X`	`ENG`	`@0 Connectedness @5 24`
C03	`08`	`X`	`SPA`	`@0 Conexidad @5 24`
C03	`09`	`X`	`FRE`	`@0 Informatique théorique @5 25`
C03	`09`	`X`	`ENG`	`@0 Computer theory @5 25`
C03	`09`	`X`	`SPA`	`@0 Informática teórica @5 25`
C03	`10`	`X`	`FRE`	`@0 Optimisation @5 26`
C03	`10`	`X`	`ENG`	`@0 Optimization @5 26`
C03	`10`	`X`	`SPA`	`@0 Optimización @5 26`
C03	`11`	`X`	`FRE`	`@0 Combinatoire @5 27`
C03	`11`	`X`	`ENG`	`@0 Combinatorics @5 27`
C03	`11`	`X`	`SPA`	`@0 Combinatoria @5 27`
C03	`12`	`X`	`FRE`	`@0 68Wxx @4 INC @5 70`
C03	`13`	`X`	`FRE`	`@0 52XX @4 INC @5 71`
N21				`@1 047`
N44	`01`			`@1 OTO`
N82				`@1 OTO`

A30	`01`	`1`	`ENG`	`@1 International Conference on Discrete Geometry for Computer Imagery DGCI 2006 @2 13 @3 Szeged HUN @4 2006-10-25`

Format Inist (serveur)

NO :	PASCAL 09-0067432 INIST
ET :	Minimal arithmetic thickness connecting discrete planes
AU :	JAMET (Damien); TOUTANT (Jean-Luc); NYUL (L. G.); PALAGYI (K.)
AF :	Loria -Univ. Nancy 1, Campus Scientifique, BP 239/54506 Vandœuvre-lès-Nancy/France (1 aut.); LIRMM. Univ. Montpellier2, CNRS; 161 rue Ada/34392 Montpellier/France (2 aut.)
DT :	Publication en série; Congrès; Niveau analytique
SO :	Discrete applied mathematics; ISSN 0166-218X; Coden DAMADU; Pays-Bas; Da. 2009; Vol. 157; No. 3; Pp. 500-509; Bibl. 7 ref.
LA :	Anglais
EA :	While connected arithmetic discrete lines are entirely characterized, only partial results exist for the more general case of arithmetic discrete hyperplanes. In the present paper, we focus on the three-dimensional case, that is on arithmetic discrete planes. Thanks to arithmetic reductions on a vector n, we provide algorithms either to determine whether a given arithmetic discrete plane with n as normal vector is connected, or to compute the minimal thickness for which an arithmetic discrete plane with normal vector n is connected.
CC :	001D02A05; 001A02B01; 001A02F02
FD :	Arithmétique; Plan; Hyperplan; Calcul 3 dimensions; Vecteur; Algorithme; Géométrie discrète; Connexité; Informatique théorique; Optimisation; Combinatoire; 68Wxx; 52XX
ED :	Arithmetics; Plane; Hyperplane; Three-dimensional calculations; Vector; Algorithm; Discrete geometry; Connectedness; Computer theory; Optimization; Combinatorics
SD :	Aritmética; Plano; Hiperplano; Vector; Algoritmo; Geometría discreta; Conexidad; Informática teórica; Optimización; Combinatoria
LO :	INIST-18287.354000185136640060
ID :	09-0067432

Links to Exploration step

Pascal:09-0067432

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Minimal arithmetic thickness connecting discrete planes</title>
<author><name sortKey="Jamet, Damien" sort="Jamet, Damien" uniqKey="Jamet D" first="Damien" last="Jamet">Damien Jamet</name>
<affiliation><inist:fA14 i1="01"><s1>Loria -Univ. Nancy 1, Campus Scientifique, BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Toutant, Jean Luc" sort="Toutant, Jean Luc" uniqKey="Toutant J" first="Jean-Luc" last="Toutant">Jean-Luc Toutant</name>
<affiliation><inist:fA14 i1="02"><s1>LIRMM. Univ. Montpellier2, CNRS; 161 rue Ada</s1>
<s2>34392 Montpellier</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">09-0067432</idno>
<date when="2009">2009</date>
<idno type="stanalyst">PASCAL 09-0067432 INIST</idno>
<idno type="RBID">Pascal:09-0067432</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000284</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Minimal arithmetic thickness connecting discrete planes</title>
<author><name sortKey="Jamet, Damien" sort="Jamet, Damien" uniqKey="Jamet D" first="Damien" last="Jamet">Damien Jamet</name>
<affiliation><inist:fA14 i1="01"><s1>Loria -Univ. Nancy 1, Campus Scientifique, BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Toutant, Jean Luc" sort="Toutant, Jean Luc" uniqKey="Toutant J" first="Jean-Luc" last="Toutant">Jean-Luc Toutant</name>
<affiliation><inist:fA14 i1="02"><s1>LIRMM. Univ. Montpellier2, CNRS; 161 rue Ada</s1>
<s2>34392 Montpellier</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Discrete applied mathematics</title>
<title level="j" type="abbreviated">Discrete appl. math.</title>
<idno type="ISSN">0166-218X</idno>
<imprint><date when="2009">2009</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Discrete applied mathematics</title>
<title level="j" type="abbreviated">Discrete appl. math.</title>
<idno type="ISSN">0166-218X</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Algorithm</term>
<term>Arithmetics</term>
<term>Combinatorics</term>
<term>Computer theory</term>
<term>Connectedness</term>
<term>Discrete geometry</term>
<term>Hyperplane</term>
<term>Optimization</term>
<term>Plane</term>
<term>Three-dimensional calculations</term>
<term>Vector</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Arithmétique</term>
<term>Plan</term>
<term>Hyperplan</term>
<term>Calcul 3 dimensions</term>
<term>Vecteur</term>
<term>Algorithme</term>
<term>Géométrie discrète</term>
<term>Connexité</term>
<term>Informatique théorique</term>
<term>Optimisation</term>
<term>Combinatoire</term>
<term>68Wxx</term>
<term>52XX</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">While connected arithmetic discrete lines are entirely characterized, only partial results exist for the more general case of arithmetic discrete hyperplanes. In the present paper, we focus on the three-dimensional case, that is on arithmetic discrete planes. Thanks to arithmetic reductions on a vector n, we provide algorithms either to determine whether a given arithmetic discrete plane with n as normal vector is connected, or to compute the minimal thickness for which an arithmetic discrete plane with normal vector n is connected.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0166-218X</s0>
</fA01>
<fA02 i1="01"><s0>DAMADU</s0>
</fA02>
<fA03 i2="1"><s0>Discrete appl. math.</s0>
</fA03>
<fA05><s2>157</s2>
</fA05>
<fA06><s2>3</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG"><s1>Minimal arithmetic thickness connecting discrete planes</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>International Conference on Discrete Geometry for Computer Imagery DGCI 2006</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>JAMET (Damien)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>TOUTANT (Jean-Luc)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>NYUL (L. G.)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="02" i2="1"><s1>PALAGYI (K.)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>Loria -Univ. Nancy 1, Campus Scientifique, BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>LIRMM. Univ. Montpellier2, CNRS; 161 rue Ada</s1>
<s2>34392 Montpellier</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA20><s1>500-509</s1>
</fA20>
<fA21><s1>2009</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>INIST</s1>
<s2>18287</s2>
<s5>354000185136640060</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2009 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>7 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>09-0067432</s0>
</fA47>
<fA60><s1>P</s1>
<s2>C</s2>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>Discrete applied mathematics</s0>
</fA64>
<fA66 i1="01"><s0>NLD</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>While connected arithmetic discrete lines are entirely characterized, only partial results exist for the more general case of arithmetic discrete hyperplanes. In the present paper, we focus on the three-dimensional case, that is on arithmetic discrete planes. Thanks to arithmetic reductions on a vector n, we provide algorithms either to determine whether a given arithmetic discrete plane with n as normal vector is connected, or to compute the minimal thickness for which an arithmetic discrete plane with normal vector n is connected.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02A05</s0>
</fC02>
<fC02 i1="02" i2="X"><s0>001A02B01</s0>
</fC02>
<fC02 i1="03" i2="X"><s0>001A02F02</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Arithmétique</s0>
<s5>17</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Arithmetics</s0>
<s5>17</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Aritmética</s0>
<s5>17</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Plan</s0>
<s5>18</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Plane</s0>
<s5>18</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Plano</s0>
<s5>18</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Hyperplan</s0>
<s5>19</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Hyperplane</s0>
<s5>19</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Hiperplano</s0>
<s5>19</s5>
</fC03>
<fC03 i1="04" i2="3" l="FRE"><s0>Calcul 3 dimensions</s0>
<s5>20</s5>
</fC03>
<fC03 i1="04" i2="3" l="ENG"><s0>Three-dimensional calculations</s0>
<s5>20</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Vecteur</s0>
<s5>21</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Vector</s0>
<s5>21</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Vector</s0>
<s5>21</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Algorithme</s0>
<s5>22</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Algorithm</s0>
<s5>22</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Algoritmo</s0>
<s5>22</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Géométrie discrète</s0>
<s5>23</s5>
</fC03>
<fC03 i1="07" i2="X" l="ENG"><s0>Discrete geometry</s0>
<s5>23</s5>
</fC03>
<fC03 i1="07" i2="X" l="SPA"><s0>Geometría discreta</s0>
<s5>23</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Connexité</s0>
<s5>24</s5>
</fC03>
<fC03 i1="08" i2="X" l="ENG"><s0>Connectedness</s0>
<s5>24</s5>
</fC03>
<fC03 i1="08" i2="X" l="SPA"><s0>Conexidad</s0>
<s5>24</s5>
</fC03>
<fC03 i1="09" i2="X" l="FRE"><s0>Informatique théorique</s0>
<s5>25</s5>
</fC03>
<fC03 i1="09" i2="X" l="ENG"><s0>Computer theory</s0>
<s5>25</s5>
</fC03>
<fC03 i1="09" i2="X" l="SPA"><s0>Informática teórica</s0>
<s5>25</s5>
</fC03>
<fC03 i1="10" i2="X" l="FRE"><s0>Optimisation</s0>
<s5>26</s5>
</fC03>
<fC03 i1="10" i2="X" l="ENG"><s0>Optimization</s0>
<s5>26</s5>
</fC03>
<fC03 i1="10" i2="X" l="SPA"><s0>Optimización</s0>
<s5>26</s5>
</fC03>
<fC03 i1="11" i2="X" l="FRE"><s0>Combinatoire</s0>
<s5>27</s5>
</fC03>
<fC03 i1="11" i2="X" l="ENG"><s0>Combinatorics</s0>
<s5>27</s5>
</fC03>
<fC03 i1="11" i2="X" l="SPA"><s0>Combinatoria</s0>
<s5>27</s5>
</fC03>
<fC03 i1="12" i2="X" l="FRE"><s0>68Wxx</s0>
<s4>INC</s4>
<s5>70</s5>
</fC03>
<fC03 i1="13" i2="X" l="FRE"><s0>52XX</s0>
<s4>INC</s4>
<s5>71</s5>
</fC03>
<fN21><s1>047</s1>
</fN21>
<fN44 i1="01"><s1>OTO</s1>
</fN44>
<fN82><s1>OTO</s1>
</fN82>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>International Conference on Discrete Geometry for Computer Imagery DGCI 2006</s1>
<s2>13</s2>
<s3>Szeged HUN</s3>
<s4>2006-10-25</s4>
</fA30>
</pR>
</standard>
<server><NO>PASCAL 09-0067432 INIST</NO>
<ET>Minimal arithmetic thickness connecting discrete planes</ET>
<AU>JAMET (Damien); TOUTANT (Jean-Luc); NYUL (L. G.); PALAGYI (K.)</AU>
<AF>Loria -Univ. Nancy 1, Campus Scientifique, BP 239/54506 Vandœuvre-lès-Nancy/France (1 aut.); LIRMM. Univ. Montpellier2, CNRS; 161 rue Ada/34392 Montpellier/France (2 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Discrete applied mathematics; ISSN 0166-218X; Coden DAMADU; Pays-Bas; Da. 2009; Vol. 157; No. 3; Pp. 500-509; Bibl. 7 ref.</SO>
<LA>Anglais</LA>
<EA>While connected arithmetic discrete lines are entirely characterized, only partial results exist for the more general case of arithmetic discrete hyperplanes. In the present paper, we focus on the three-dimensional case, that is on arithmetic discrete planes. Thanks to arithmetic reductions on a vector n, we provide algorithms either to determine whether a given arithmetic discrete plane with n as normal vector is connected, or to compute the minimal thickness for which an arithmetic discrete plane with normal vector n is connected.</EA>
<CC>001D02A05; 001A02B01; 001A02F02</CC>
<FD>Arithmétique; Plan; Hyperplan; Calcul 3 dimensions; Vecteur; Algorithme; Géométrie discrète; Connexité; Informatique théorique; Optimisation; Combinatoire; 68Wxx; 52XX</FD>
<ED>Arithmetics; Plane; Hyperplane; Three-dimensional calculations; Vector; Algorithm; Discrete geometry; Connectedness; Computer theory; Optimization; Combinatorics</ED>
<SD>Aritmética; Plano; Hiperplano; Vector; Algoritmo; Geometría discreta; Conexidad; Informática teórica; Optimización; Combinatoria</SD>
<LO>INIST-18287.354000185136640060</LO>
<ID>09-0067432</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 000284 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000284 | 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:09-0067432
   |texte=   Minimal arithmetic thickness connecting discrete planes
}}

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

Minimal arithmetic thickness connecting discrete planes

Minimal arithmetic thickness connecting discrete planes

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