Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices
Identifieur interne : 000D13 ( Istex/Checkpoint ); précédent : 000D12; suivant : 000D14Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices
Auteurs : Hazel Everett [France] ; Sylvain Lazard [France] ; Giuseppe Liotta [Italie] ; Stephen Wismath [Canada]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: This paper shows that any planar graph with n vertices can be point-set embedded with at most one bend per edge on a universal set of n points in the plane. An implication of this result is that any number of planar graphs admit a simultaneous embedding without mapping with at most one bend per edge.
Url:
DOI: 10.1007/978-3-540-77537-9_34
Affiliations:
Links toward previous steps (curation, corpus...)
Links to Exploration step
ISTEX:8E4B141DD3D0873017BCAE95A15787A00A7E698FLe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices</title><author><name sortKey="Everett, Hazel" sort="Everett, Hazel" uniqKey="Everett H" first="Hazel" last="Everett">Hazel Everett</name></author><author><name sortKey="Lazard, Sylvain" sort="Lazard, Sylvain" uniqKey="Lazard S" first="Sylvain" last="Lazard">Sylvain Lazard</name></author><author><name sortKey="Liotta, Giuseppe" sort="Liotta, Giuseppe" uniqKey="Liotta G" first="Giuseppe" last="Liotta">Giuseppe Liotta</name></author><author><name sortKey="Wismath, Stephen" sort="Wismath, Stephen" uniqKey="Wismath S" first="Stephen" last="Wismath">Stephen Wismath</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:8E4B141DD3D0873017BCAE95A15787A00A7E698F</idno><date when="2008" year="2008">2008</date><idno type="doi">10.1007/978-3-540-77537-9_34</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-CRJTBWFR-H/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">002102</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002102</idno><idno type="wicri:Area/Istex/Curation">002074</idno><idno type="wicri:Area/Istex/Checkpoint">000D13</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000D13</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Universal Sets of <hi rend="italic">n</hi> Points for 1-Bend Drawings of Planar Graphs with <hi rend="italic">n</hi> Vertices </title><author><name sortKey="Everett, Hazel" sort="Everett, Hazel" uniqKey="Everett H" first="Hazel" last="Everett">Hazel Everett</name><affiliation wicri:level="4"><country xml:lang="fr">France</country><wicri:regionArea>LORIA, INRIA Lorraine, Nancy Université, Nancy</wicri:regionArea><placeName><region type="region">Grand Est</region><region type="old region">Lorraine (région)</region><settlement type="city">Nancy</settlement></placeName><orgName type="university">Nancy-Université</orgName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author><author><name sortKey="Lazard, Sylvain" sort="Lazard, Sylvain" uniqKey="Lazard S" first="Sylvain" last="Lazard">Sylvain Lazard</name><affiliation wicri:level="4"><country xml:lang="fr">France</country><wicri:regionArea>LORIA, INRIA Lorraine, Nancy Université, Nancy</wicri:regionArea><placeName><region type="region">Grand Est</region><region type="old region">Lorraine (région)</region><settlement type="city">Nancy</settlement></placeName><orgName type="university">Nancy-Université</orgName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author><author><name sortKey="Liotta, Giuseppe" sort="Liotta, Giuseppe" uniqKey="Liotta G" first="Giuseppe" last="Liotta">Giuseppe Liotta</name><affiliation></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Italie</country></affiliation></author><author><name sortKey="Wismath, Stephen" sort="Wismath, Stephen" uniqKey="Wismath S" first="Stephen" last="Wismath">Stephen Wismath</name><affiliation wicri:level="1"><country xml:lang="fr">Canada</country><wicri:regionArea>Department of Mathematics and Computer Science, University of Lethbridge, Lethbridge, Alberta</wicri:regionArea><wicri:noRegion>Alberta</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Canada</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: This paper shows that any planar graph with n vertices can be point-set embedded with at most one bend per edge on a universal set of n points in the plane. An implication of this result is that any number of planar graphs admit a simultaneous embedding without mapping with at most one bend per edge.</div></front></TEI><affiliations><list><country><li>Canada</li><li>France</li><li>Italie</li></country><region><li>Grand Est</li><li>Lorraine (région)</li></region><settlement><li>Nancy</li></settlement><orgName><li>Nancy-Université</li></orgName></list><tree><country name="France"><region name="Grand Est"><name sortKey="Everett, Hazel" sort="Everett, Hazel" uniqKey="Everett H" first="Hazel" last="Everett">Hazel Everett</name></region><name sortKey="Everett, Hazel" sort="Everett, Hazel" uniqKey="Everett H" first="Hazel" last="Everett">Hazel Everett</name><name sortKey="Lazard, Sylvain" sort="Lazard, Sylvain" uniqKey="Lazard S" first="Sylvain" last="Lazard">Sylvain Lazard</name><name sortKey="Lazard, Sylvain" sort="Lazard, Sylvain" uniqKey="Lazard S" first="Sylvain" last="Lazard">Sylvain Lazard</name></country><country name="Italie"><noRegion><name sortKey="Liotta, Giuseppe" sort="Liotta, Giuseppe" uniqKey="Liotta G" first="Giuseppe" last="Liotta">Giuseppe Liotta</name></noRegion></country><country name="Canada"><noRegion><name sortKey="Wismath, Stephen" sort="Wismath, Stephen" uniqKey="Wismath S" first="Stephen" last="Wismath">Stephen Wismath</name></noRegion><name sortKey="Wismath, Stephen" sort="Wismath, Stephen" uniqKey="Wismath S" first="Stephen" last="Wismath">Stephen Wismath</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000D13 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Checkpoint/biblio.hfd -nk 000D13 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Istex
|étape= Checkpoint
|type= RBID
|clé= ISTEX:8E4B141DD3D0873017BCAE95A15787A00A7E698F
|texte= Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices
}}
| This area was generated with Dilib version V0.6.33. |  |