Detection of the discrete convexity of polyominoes
Identifieur interne :
000984 ( PascalFrancis/Corpus );
précédent :
000983;
suivant :
000985
Detection of the discrete convexity of polyominoes
Auteurs : Isabelle Debled-Rennesson ;
Jean-Luc Remy ;
Jocelyne Rouyer-DegliSource :
-
Lecture notes in computer science [ 0302-9743 ] ; 2000.
RBID : Pascal:01-0087906
Descripteurs français
English descriptors
Abstract
The convexity of a discrete region is a property used in numerous domains of computational imagery. We study its detection in the particular case of polyominoes. We present a first method, directly relying on its definition. A second method, which is based on techniques for segmentation of curves in discrete lines, leads to a very simple algorithm whose correctness is proven. Correlatively, we obtain a characterisation of lower and upper convex hulls of a discrete line segment. Finally, we evoke some applications of these results to the problem of discrete tomography.
Notice en format standard (ISO 2709)
Pour connaître la documentation sur le format Inist Standard.
| pA |
| A01 | 01 | 1 | | @0 0302-9743 |
|---|
| A05 | | | | @2 1953 |
|---|
| A08 | 01 | 1 | ENG | @1 Detection of the discrete convexity of polyominoes |
|---|
| A09 | 01 | 1 | ENG | @1 DGCI 2000 : discrete geometry for computer imagery : Uppsala, 13-15 December 2000 |
|---|
| A11 | 01 | 1 | | @1 DEBLED-RENNESSON (Isabelle) |
|---|
| A11 | 02 | 1 | | @1 REMY (Jean-Luc) |
|---|
| A11 | 03 | 1 | | @1 ROUYER-DEGLI (Jocelyne) |
|---|
| A12 | 01 | 1 | | @1 BORGEFORS (Gunilla) @9 ed. |
|---|
| A12 | 02 | 1 | | @1 NYSTROM (Ingela) @9 ed. |
|---|
| A12 | 03 | 1 | | @1 SANNITI DI BAJA (Gabriella) @9 ed. |
|---|
| A14 | 01 | | | @1 LORIA - Laboratoire LOrrain de Recherche en Informatique et ses Applications, Institut Universitaire de Formation des Maîtres de Lorraine, Campus Scientifique, B.P. 239 @2 54506 Vandoeuvre-lès-Nancy @3 ITA @Z 1 aut. |
|---|
| A14 | 02 | | | @1 LORIA, Centre National de la Recherche Scientifique, Campus Scientifique, B.P. 239 @2 54506 Vandoeuvre-lès-Nancy @3 ITA @Z 2 aut. |
|---|
| A14 | 03 | | | @1 LORIA, Université Henri Poincaré, Nancy 1, Campus Scientifique, B.P. 239 @2 54506 Vandoeuvre-lès-Nancy @3 ITA @Z 3 aut. |
|---|
| A20 | | | | @1 491-504 |
|---|
| A21 | | | | @1 2000 |
|---|
| A23 | 01 | | | @0 ENG |
|---|
| A26 | 01 | | | @0 3-540-41396-0 |
|---|
| A43 | 01 | | | @1 INIST @2 16343 @5 354000092024000400 |
|---|
| A44 | | | | @0 0000 @1 © 2001 INIST-CNRS. All rights reserved. |
|---|
| A45 | | | | @0 20 ref. |
|---|
| A47 | 01 | 1 | | @0 01-0087906 |
|---|
| A60 | | | | @1 P @2 C |
|---|
| A61 | | | | @0 A |
|---|
| A64 | 01 | 1 | | @0 Lecture notes in computer science |
|---|
| A66 | 01 | | | @0 DEU |
|---|
| C01 | 01 | | ENG | @0 The convexity of a discrete region is a property used in numerous domains of computational imagery. We study its detection in the particular case of polyominoes. We present a first method, directly relying on its definition. A second method, which is based on techniques for segmentation of curves in discrete lines, leads to a very simple algorithm whose correctness is proven. Correlatively, we obtain a characterisation of lower and upper convex hulls of a discrete line segment. Finally, we evoke some applications of these results to the problem of discrete tomography. |
|---|
| C02 | 01 | X | | @0 001D02C03 |
|---|
| C03 | 01 | X | FRE | @0 Convexité @5 01 |
|---|
| C03 | 01 | X | ENG | @0 Convexity @5 01 |
|---|
| C03 | 01 | X | SPA | @0 Convexidad @5 01 |
|---|
| C03 | 02 | 1 | FRE | @0 Segmentation image @5 02 |
|---|
| C03 | 02 | 1 | ENG | @0 Image segmentation @5 02 |
|---|
| C03 | 03 | X | FRE | @0 Tomographie @5 03 |
|---|
| C03 | 03 | X | ENG | @0 Tomography @5 03 |
|---|
| C03 | 03 | X | SPA | @0 Tomografía @5 03 |
|---|
| C03 | 04 | X | FRE | @0 Traitement image @5 04 |
|---|
| C03 | 04 | X | ENG | @0 Image processing @5 04 |
|---|
| C03 | 04 | X | SPA | @0 Procesamiento imagen @5 04 |
|---|
| C03 | 05 | X | FRE | @0 Enveloppe convexe @5 05 |
|---|
| C03 | 05 | X | ENG | @0 Convex hull @5 05 |
|---|
| C03 | 05 | X | SPA | @0 Cápsula convexa @5 05 |
|---|
| N21 | | | | @1 063 |
|---|
|
|---|
| pR |
| A30 | 01 | 1 | ENG | @1 International conference on discrete geometry for computer imagery @2 9 @3 Uppsala SWE @4 2000-12-13 |
|---|
|
|---|
Format Inist (serveur)
| NO : | PASCAL 01-0087906 INIST |
|---|
| ET : | Detection of the discrete convexity of polyominoes |
|---|
| AU : | DEBLED-RENNESSON (Isabelle); REMY (Jean-Luc); ROUYER-DEGLI (Jocelyne); BORGEFORS (Gunilla); NYSTROM (Ingela); SANNITI DI BAJA (Gabriella) |
|---|
| AF : | LORIA - Laboratoire LOrrain de Recherche en Informatique et ses Applications, Institut Universitaire de Formation des Maîtres de Lorraine, Campus Scientifique, B.P. 239/54506 Vandoeuvre-lès-Nancy/Italie (1 aut.); LORIA, Centre National de la Recherche Scientifique, Campus Scientifique, B.P. 239/54506 Vandoeuvre-lès-Nancy/Italie (2 aut.); LORIA, Université Henri Poincaré, Nancy 1, Campus Scientifique, B.P. 239/54506 Vandoeuvre-lès-Nancy/Italie (3 aut.) |
|---|
| DT : | Publication en série; Congrès; Niveau analytique |
|---|
| SO : | Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2000; Vol. 1953; Pp. 491-504; Bibl. 20 ref. |
|---|
| LA : | Anglais |
|---|
| EA : | The convexity of a discrete region is a property used in numerous domains of computational imagery. We study its detection in the particular case of polyominoes. We present a first method, directly relying on its definition. A second method, which is based on techniques for segmentation of curves in discrete lines, leads to a very simple algorithm whose correctness is proven. Correlatively, we obtain a characterisation of lower and upper convex hulls of a discrete line segment. Finally, we evoke some applications of these results to the problem of discrete tomography. |
|---|
| CC : | 001D02C03 |
|---|
| FD : | Convexité; Segmentation image; Tomographie; Traitement image; Enveloppe convexe |
|---|
| ED : | Convexity; Image segmentation; Tomography; Image processing; Convex hull |
|---|
| SD : | Convexidad; Tomografía; Procesamiento imagen; Cápsula convexa |
|---|
| LO : | INIST-16343.354000092024000400 |
|---|
| ID : | 01-0087906 |
|---|
Links to Exploration step
Pascal:01-0087906
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Detection of the discrete convexity of polyominoes</title>
<author><name sortKey="Debled Rennesson, Isabelle" sort="Debled Rennesson, Isabelle" uniqKey="Debled Rennesson I" first="Isabelle" last="Debled-Rennesson">Isabelle Debled-Rennesson</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA - Laboratoire LOrrain de Recherche en Informatique et ses Applications, Institut Universitaire de Formation des Maîtres de Lorraine, Campus Scientifique, B.P. 239</s1>
<s2>54506 Vandoeuvre-lès-Nancy</s2>
<s3>ITA</s3>
<sZ>1 aut.</sZ>
</inist:fA14><author><name sortKey="Remy, Jean Luc" sort="Remy, Jean Luc" uniqKey="Remy J" first="Jean-Luc" last="Remy">Jean-Luc Remy</name>
<affiliation><inist:fA14 i1="02"><s1>LORIA, Centre National de la Recherche Scientifique, Campus Scientifique, B.P. 239</s1>
<s2>54506 Vandoeuvre-lès-Nancy</s2>
<s3>ITA</s3>
<sZ>2 aut.</sZ>
</inist:fA14><author><name sortKey="Rouyer Degli, Jocelyne" sort="Rouyer Degli, Jocelyne" uniqKey="Rouyer Degli J" first="Jocelyne" last="Rouyer-Degli">Jocelyne Rouyer-Degli</name>
<affiliation><inist:fA14 i1="03"><s1>LORIA, Université Henri Poincaré, Nancy 1, Campus Scientifique, B.P. 239</s1>
<s2>54506 Vandoeuvre-lès-Nancy</s2>
<s3>ITA</s3>
<sZ>3 aut.</sZ>
</inist:fA14><publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">01-0087906</idno>
<date when="2000">2000</date>
<idno type="stanalyst">PASCAL 01-0087906 INIST</idno>
<idno type="RBID">Pascal:01-0087906</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000984</idno>
</publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Detection of the discrete convexity of polyominoes</title>
<author><name sortKey="Debled Rennesson, Isabelle" sort="Debled Rennesson, Isabelle" uniqKey="Debled Rennesson I" first="Isabelle" last="Debled-Rennesson">Isabelle Debled-Rennesson</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA - Laboratoire LOrrain de Recherche en Informatique et ses Applications, Institut Universitaire de Formation des Maîtres de Lorraine, Campus Scientifique, B.P. 239</s1>
<s2>54506 Vandoeuvre-lès-Nancy</s2>
<s3>ITA</s3>
<sZ>1 aut.</sZ>
</inist:fA14><author><name sortKey="Remy, Jean Luc" sort="Remy, Jean Luc" uniqKey="Remy J" first="Jean-Luc" last="Remy">Jean-Luc Remy</name>
<affiliation><inist:fA14 i1="02"><s1>LORIA, Centre National de la Recherche Scientifique, Campus Scientifique, B.P. 239</s1>
<s2>54506 Vandoeuvre-lès-Nancy</s2>
<s3>ITA</s3>
<sZ>2 aut.</sZ>
</inist:fA14><author><name sortKey="Rouyer Degli, Jocelyne" sort="Rouyer Degli, Jocelyne" uniqKey="Rouyer Degli J" first="Jocelyne" last="Rouyer-Degli">Jocelyne Rouyer-Degli</name>
<affiliation><inist:fA14 i1="03"><s1>LORIA, Université Henri Poincaré, Nancy 1, Campus Scientifique, B.P. 239</s1>
<s2>54506 Vandoeuvre-lès-Nancy</s2>
<s3>ITA</s3>
<sZ>3 aut.</sZ>
</inist:fA14><series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="2000">2000</date>
</imprint><seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Convex hull</term>
<term>Convexity</term>
<term>Image processing</term>
<term>Image segmentation</term>
<term>Tomography</term>
</keywords><keywords scheme="Pascal" xml:lang="fr"><term>Convexité</term>
<term>Segmentation image</term>
<term>Tomographie</term>
<term>Traitement image</term>
<term>Enveloppe convexe</term>
</keywords><front><div type="abstract" xml:lang="en">The convexity of a discrete region is a property used in numerous domains of computational imagery. We study its detection in the particular case of polyominoes. We present a first method, directly relying on its definition. A second method, which is based on techniques for segmentation of curves in discrete lines, leads to a very simple algorithm whose correctness is proven. Correlatively, we obtain a characterisation of lower and upper convex hulls of a discrete line segment. Finally, we evoke some applications of these results to the problem of discrete tomography.</div>
</front><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01><fA05><s2>1953</s2>
</fA05><fA08 i1="01" i2="1" l="ENG"><s1>Detection of the discrete convexity of polyominoes</s1>
</fA08><fA09 i1="01" i2="1" l="ENG"><s1>DGCI 2000 : discrete geometry for computer imagery : Uppsala, 13-15 December 2000</s1>
</fA09><fA11 i1="01" i2="1"><s1>DEBLED-RENNESSON (Isabelle)</s1>
</fA11><fA11 i1="02" i2="1"><s1>REMY (Jean-Luc)</s1>
</fA11><fA11 i1="03" i2="1"><s1>ROUYER-DEGLI (Jocelyne)</s1>
</fA11><fA12 i1="01" i2="1"><s1>BORGEFORS (Gunilla)</s1>
<s9>ed.</s9>
</fA12><fA12 i1="02" i2="1"><s1>NYSTROM (Ingela)</s1>
<s9>ed.</s9>
</fA12><fA12 i1="03" i2="1"><s1>SANNITI DI BAJA (Gabriella)</s1>
<s9>ed.</s9>
</fA12><fA14 i1="01"><s1>LORIA - Laboratoire LOrrain de Recherche en Informatique et ses Applications, Institut Universitaire de Formation des Maîtres de Lorraine, Campus Scientifique, B.P. 239</s1>
<s2>54506 Vandoeuvre-lès-Nancy</s2>
<s3>ITA</s3>
<sZ>1 aut.</sZ>
</fA14><fA14 i1="02"><s1>LORIA, Centre National de la Recherche Scientifique, Campus Scientifique, B.P. 239</s1>
<s2>54506 Vandoeuvre-lès-Nancy</s2>
<s3>ITA</s3>
<sZ>2 aut.</sZ>
</fA14><fA14 i1="03"><s1>LORIA, Université Henri Poincaré, Nancy 1, Campus Scientifique, B.P. 239</s1>
<s2>54506 Vandoeuvre-lès-Nancy</s2>
<s3>ITA</s3>
<sZ>3 aut.</sZ>
</fA14><fA20><s1>491-504</s1>
</fA20><fA21><s1>2000</s1>
</fA21><fA23 i1="01"><s0>ENG</s0>
</fA23><fA26 i1="01"><s0>3-540-41396-0</s0>
</fA26><fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000092024000400</s5>
</fA43><fA44><s0>0000</s0>
<s1>© 2001 INIST-CNRS. All rights reserved.</s1>
</fA44><fA45><s0>20 ref.</s0>
</fA45><fA47 i1="01" i2="1"><s0>01-0087906</s0>
</fA47><fA60><s1>P</s1>
<s2>C</s2>
</fA60><fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0>
</fA64><fA66 i1="01"><s0>DEU</s0>
</fA66><fC01 i1="01" l="ENG"><s0>The convexity of a discrete region is a property used in numerous domains of computational imagery. We study its detection in the particular case of polyominoes. We present a first method, directly relying on its definition. A second method, which is based on techniques for segmentation of curves in discrete lines, leads to a very simple algorithm whose correctness is proven. Correlatively, we obtain a characterisation of lower and upper convex hulls of a discrete line segment. Finally, we evoke some applications of these results to the problem of discrete tomography.</s0>
</fC01><fC02 i1="01" i2="X"><s0>001D02C03</s0>
</fC02><fC03 i1="01" i2="X" l="FRE"><s0>Convexité</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="ENG"><s0>Convexity</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="SPA"><s0>Convexidad</s0>
<s5>01</s5>
</fC03><fC03 i1="02" i2="1" l="FRE"><s0>Segmentation image</s0>
<s5>02</s5>
</fC03><fC03 i1="02" i2="1" l="ENG"><s0>Image segmentation</s0>
<s5>02</s5>
</fC03><fC03 i1="03" i2="X" l="FRE"><s0>Tomographie</s0>
<s5>03</s5>
</fC03><fC03 i1="03" i2="X" l="ENG"><s0>Tomography</s0>
<s5>03</s5>
</fC03><fC03 i1="03" i2="X" l="SPA"><s0>Tomografía</s0>
<s5>03</s5>
</fC03><fC03 i1="04" i2="X" l="FRE"><s0>Traitement image</s0>
<s5>04</s5>
</fC03><fC03 i1="04" i2="X" l="ENG"><s0>Image processing</s0>
<s5>04</s5>
</fC03><fC03 i1="04" i2="X" l="SPA"><s0>Procesamiento imagen</s0>
<s5>04</s5>
</fC03><fC03 i1="05" i2="X" l="FRE"><s0>Enveloppe convexe</s0>
<s5>05</s5>
</fC03><fC03 i1="05" i2="X" l="ENG"><s0>Convex hull</s0>
<s5>05</s5>
</fC03><fC03 i1="05" i2="X" l="SPA"><s0>Cápsula convexa</s0>
<s5>05</s5>
</fC03><fN21><s1>063</s1>
</fN21><pR><fA30 i1="01" i2="1" l="ENG"><s1>International conference on discrete geometry for computer imagery</s1>
<s2>9</s2>
<s3>Uppsala SWE</s3>
<s4>2000-12-13</s4>
</fA30><server><NO>PASCAL 01-0087906 INIST</NO>
<ET>Detection of the discrete convexity of polyominoes</ET>
<AU>DEBLED-RENNESSON (Isabelle); REMY (Jean-Luc); ROUYER-DEGLI (Jocelyne); BORGEFORS (Gunilla); NYSTROM (Ingela); SANNITI DI BAJA (Gabriella)</AU>
<AF>LORIA - Laboratoire LOrrain de Recherche en Informatique et ses Applications, Institut Universitaire de Formation des Maîtres de Lorraine, Campus Scientifique, B.P. 239/54506 Vandoeuvre-lès-Nancy/Italie (1 aut.); LORIA, Centre National de la Recherche Scientifique, Campus Scientifique, B.P. 239/54506 Vandoeuvre-lès-Nancy/Italie (2 aut.); LORIA, Université Henri Poincaré, Nancy 1, Campus Scientifique, B.P. 239/54506 Vandoeuvre-lès-Nancy/Italie (3 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2000; Vol. 1953; Pp. 491-504; Bibl. 20 ref.</SO>
<LA>Anglais</LA>
<EA>The convexity of a discrete region is a property used in numerous domains of computational imagery. We study its detection in the particular case of polyominoes. We present a first method, directly relying on its definition. A second method, which is based on techniques for segmentation of curves in discrete lines, leads to a very simple algorithm whose correctness is proven. Correlatively, we obtain a characterisation of lower and upper convex hulls of a discrete line segment. Finally, we evoke some applications of these results to the problem of discrete tomography.</EA>
<CC>001D02C03</CC>
<FD>Convexité; Segmentation image; Tomographie; Traitement image; Enveloppe convexe</FD>
<ED>Convexity; Image segmentation; Tomography; Image processing; Convex hull</ED>
<SD>Convexidad; Tomografía; Procesamiento imagen; Cápsula convexa</SD>
<LO>INIST-16343.354000092024000400</LO>
<ID>01-0087906</ID>
</server>
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 000984 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000984 | 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:01-0087906
|texte= Detection of the discrete convexity of polyominoes
}}
| 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 |  |
