Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices
Identifieur interne : 004396 ( Main/Merge ); précédent : 004395; suivant : 004397Universal 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
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 002102
- to stream Istex, to step Curation: 002074
- to stream Istex, to step Checkpoint: 000D13
- to stream Hal, to step Corpus: 005073
- to stream Hal, to step Curation: 005073
- to stream Hal, to step Checkpoint: 003876
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><idno type="wicri:doubleKey">0302-9743:2008:Everett H:universal:sets:of</idno><idno type="wicri:source">HAL</idno><idno type="RBID">Hal:inria-00189036</idno><idno type="url">https://hal.inria.fr/inria-00189036</idno><idno type="wicri:Area/Hal/Corpus">005073</idno><idno type="wicri:Area/Hal/Curation">005073</idno><idno type="wicri:Area/Hal/Checkpoint">003876</idno><idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">003876</idno><idno type="wicri:Area/Main/Merge">004396</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><double doi="10.1007/978-3-540-77537-9_34"><HAL><TEI><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><affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-2573" status="OLD"><idno type="RNSR">200518305E</idno><orgName>Effective Geometric Algorithms for Surfaces and Visibility</orgName><orgName type="acronym">VEGAS</orgName><desc><address><country key="FR"></country></address><ref type="url">http://www.inria.fr/equipes/vegas</ref></desc><listRelation><relation active="#struct-160" type="direct"></relation><relation name="UMR7503" active="#struct-441569" type="indirect"></relation><relation active="#struct-300009" type="indirect"></relation><relation active="#struct-300291" type="indirect"></relation><relation active="#struct-300292" type="indirect"></relation><relation active="#struct-300293" type="indirect"></relation><relation active="#struct-2496" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-160" type="direct"><org type="laboratory" xml:id="struct-160" status="OLD"><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName><orgName type="acronym">LORIA</orgName><desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.loria.fr</ref></desc><listRelation><relation name="UMR7503" active="#struct-441569" type="direct"></relation><relation active="#struct-300009" type="direct"></relation><relation active="#struct-300291" type="direct"></relation><relation active="#struct-300292" type="direct"></relation><relation active="#struct-300293" type="direct"></relation></listRelation></org></tutelle><tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno><idno type="IdRef">02636817X</idno><orgName>Centre National de la Recherche Scientifique</orgName><orgName type="acronym">CNRS</orgName><date type="start">1939-10-19</date><desc><address><country key="FR"></country></address><ref type="url">http://www.cnrs.fr/</ref></desc></org></tutelle><tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName><orgName type="acronym">Inria</orgName><desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.inria.fr/en/</ref></desc></org></tutelle><tutelle active="#struct-300291" type="indirect"><org type="institution" xml:id="struct-300291" status="OLD"><orgName>Université Henri Poincaré - Nancy 1</orgName><orgName type="acronym">UHP</orgName><date type="end">2011-12-31</date><desc><address><addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-300292" type="indirect"><org type="institution" xml:id="struct-300292" status="OLD"><orgName>Université Nancy 2</orgName><date type="end">2011-12-31</date><desc><address><addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-300293" type="indirect"><org type="institution" xml:id="struct-300293" status="OLD"><orgName>Institut National Polytechnique de Lorraine</orgName><orgName type="acronym">INPL</orgName><date type="end">2011-12-31</date><desc><address><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-2496" type="direct"><org type="laboratory" xml:id="struct-2496" status="OLD"><orgName>INRIA Lorraine</orgName><desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine><country key="FR"></country></address><ref type="url">http://www.inria.fr/centre-de-recherche-inria/nancy-grand-est</ref></desc><listRelation><relation active="#struct-300009" type="direct"></relation></listRelation></org></tutelle></tutelles></hal:affiliation><country>France</country><placeName><settlement type="city">Nancy</settlement><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region></placeName><orgName type="university">Université Nancy 2</orgName><orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName><placeName><settlement type="city">Nancy</settlement><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region></placeName><orgName type="university">Institut national polytechnique de Lorraine</orgName><orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName></affiliation></author><author><name sortKey="Lazard, Sylvain" sort="Lazard, Sylvain" uniqKey="Lazard S" first="Sylvain" last="Lazard">Sylvain Lazard</name><affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-2573" status="OLD"><idno type="RNSR">200518305E</idno><orgName>Effective Geometric Algorithms for Surfaces and Visibility</orgName><orgName type="acronym">VEGAS</orgName><desc><address><country key="FR"></country></address><ref type="url">http://www.inria.fr/equipes/vegas</ref></desc><listRelation><relation active="#struct-160" type="direct"></relation><relation name="UMR7503" active="#struct-441569" type="indirect"></relation><relation active="#struct-300009" type="indirect"></relation><relation active="#struct-300291" type="indirect"></relation><relation active="#struct-300292" type="indirect"></relation><relation active="#struct-300293" type="indirect"></relation><relation active="#struct-2496" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-160" type="direct"><org type="laboratory" xml:id="struct-160" status="OLD"><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName><orgName type="acronym">LORIA</orgName><desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.loria.fr</ref></desc><listRelation><relation name="UMR7503" active="#struct-441569" type="direct"></relation><relation active="#struct-300009" type="direct"></relation><relation active="#struct-300291" type="direct"></relation><relation active="#struct-300292" type="direct"></relation><relation active="#struct-300293" type="direct"></relation></listRelation></org></tutelle><tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno><idno type="IdRef">02636817X</idno><orgName>Centre National de la Recherche Scientifique</orgName><orgName type="acronym">CNRS</orgName><date type="start">1939-10-19</date><desc><address><country key="FR"></country></address><ref type="url">http://www.cnrs.fr/</ref></desc></org></tutelle><tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName><orgName type="acronym">Inria</orgName><desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.inria.fr/en/</ref></desc></org></tutelle><tutelle active="#struct-300291" type="indirect"><org type="institution" xml:id="struct-300291" status="OLD"><orgName>Université Henri Poincaré - Nancy 1</orgName><orgName type="acronym">UHP</orgName><date type="end">2011-12-31</date><desc><address><addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-300292" type="indirect"><org type="institution" xml:id="struct-300292" status="OLD"><orgName>Université Nancy 2</orgName><date type="end">2011-12-31</date><desc><address><addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-300293" type="indirect"><org type="institution" xml:id="struct-300293" status="OLD"><orgName>Institut National Polytechnique de Lorraine</orgName><orgName type="acronym">INPL</orgName><date type="end">2011-12-31</date><desc><address><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-2496" type="direct"><org type="laboratory" xml:id="struct-2496" status="OLD"><orgName>INRIA Lorraine</orgName><desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine><country key="FR"></country></address><ref type="url">http://www.inria.fr/centre-de-recherche-inria/nancy-grand-est</ref></desc><listRelation><relation active="#struct-300009" type="direct"></relation></listRelation></org></tutelle></tutelles></hal:affiliation><country>France</country><placeName><settlement type="city">Nancy</settlement><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region></placeName><orgName type="university">Université Nancy 2</orgName><orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName><placeName><settlement type="city">Nancy</settlement><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region></placeName><orgName type="university">Institut national polytechnique de Lorraine</orgName><orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName></affiliation></author><author><name sortKey="Liotta, Giuseppe" sort="Liotta, Giuseppe" uniqKey="Liotta G" first="Giuseppe" last="Liotta">Giuseppe Liotta</name><affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-48497" status="INCOMING"><orgName>Dip. di Ingegneria Elettronica e dell'Informazione</orgName><desc><address><country key="IT"></country></address></desc><listRelation><relation active="#struct-366004" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-366004" type="direct"><org type="institution" xml:id="struct-366004" status="INCOMING"><orgName>Università degli Studi di Perugia</orgName><desc><address><country key="FR"></country></address></desc></org></tutelle></tutelles></hal:affiliation><country>Italie</country></affiliation></author><author><name sortKey="Wismath, Steve" sort="Wismath, Steve" uniqKey="Wismath S" first="Steve" last="Wismath">Steve Wismath</name><affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-7216" status="VALID"><orgName>Department of Mathematics and Computer Science</orgName><desc><address><addrLine>4401 University Drive Lethbridge, Alberta, Canada T1K 3M4</addrLine><country key="CA"></country></address><ref type="url">http://www.uleth.ca/fas/mcs/</ref></desc><listRelation><relation active="#struct-364773" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-364773" type="direct"><org type="institution" xml:id="struct-364773" status="INCOMING"><orgName>UNIVERSITY OF LETHBRIDGE</orgName><desc><address><country key="FR"></country></address></desc></org></tutelle></tutelles></hal:affiliation><country>Canada</country></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">HAL</idno><idno type="RBID">Hal:inria-00189036</idno><idno type="halId">inria-00189036</idno><idno type="halUri">https://hal.inria.fr/inria-00189036</idno><idno type="url">https://hal.inria.fr/inria-00189036</idno><idno type="doi">10.1007/978-3-540-77537-9_34</idno><date when="2007-09">2007-09</date><idno type="wicri:Area/Hal/Corpus">005073</idno><idno type="wicri:Area/Hal/Curation">005073</idno><idno type="wicri:Area/Hal/Checkpoint">003876</idno><idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">003876</idno></publicationStmt><sourceDesc><biblStruct><analytic><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><affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-2573" status="OLD"><idno type="RNSR">200518305E</idno><orgName>Effective Geometric Algorithms for Surfaces and Visibility</orgName><orgName type="acronym">VEGAS</orgName><desc><address><country key="FR"></country></address><ref type="url">http://www.inria.fr/equipes/vegas</ref></desc><listRelation><relation active="#struct-160" type="direct"></relation><relation name="UMR7503" active="#struct-441569" type="indirect"></relation><relation active="#struct-300009" type="indirect"></relation><relation active="#struct-300291" type="indirect"></relation><relation active="#struct-300292" type="indirect"></relation><relation active="#struct-300293" type="indirect"></relation><relation active="#struct-2496" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-160" type="direct"><org type="laboratory" xml:id="struct-160" status="OLD"><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName><orgName type="acronym">LORIA</orgName><desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.loria.fr</ref></desc><listRelation><relation name="UMR7503" active="#struct-441569" type="direct"></relation><relation active="#struct-300009" type="direct"></relation><relation active="#struct-300291" type="direct"></relation><relation active="#struct-300292" type="direct"></relation><relation active="#struct-300293" type="direct"></relation></listRelation></org></tutelle><tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno><idno type="IdRef">02636817X</idno><orgName>Centre National de la Recherche Scientifique</orgName><orgName type="acronym">CNRS</orgName><date type="start">1939-10-19</date><desc><address><country key="FR"></country></address><ref type="url">http://www.cnrs.fr/</ref></desc></org></tutelle><tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName><orgName type="acronym">Inria</orgName><desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.inria.fr/en/</ref></desc></org></tutelle><tutelle active="#struct-300291" type="indirect"><org type="institution" xml:id="struct-300291" status="OLD"><orgName>Université Henri Poincaré - Nancy 1</orgName><orgName type="acronym">UHP</orgName><date type="end">2011-12-31</date><desc><address><addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-300292" type="indirect"><org type="institution" xml:id="struct-300292" status="OLD"><orgName>Université Nancy 2</orgName><date type="end">2011-12-31</date><desc><address><addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-300293" type="indirect"><org type="institution" xml:id="struct-300293" status="OLD"><orgName>Institut National Polytechnique de Lorraine</orgName><orgName type="acronym">INPL</orgName><date type="end">2011-12-31</date><desc><address><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-2496" type="direct"><org type="laboratory" xml:id="struct-2496" status="OLD"><orgName>INRIA Lorraine</orgName><desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine><country key="FR"></country></address><ref type="url">http://www.inria.fr/centre-de-recherche-inria/nancy-grand-est</ref></desc><listRelation><relation active="#struct-300009" type="direct"></relation></listRelation></org></tutelle></tutelles></hal:affiliation><country>France</country><placeName><settlement type="city">Nancy</settlement><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region></placeName><orgName type="university">Université Nancy 2</orgName><orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName><placeName><settlement type="city">Nancy</settlement><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region></placeName><orgName type="university">Institut national polytechnique de Lorraine</orgName><orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName></affiliation></author><author><name sortKey="Lazard, Sylvain" sort="Lazard, Sylvain" uniqKey="Lazard S" first="Sylvain" last="Lazard">Sylvain Lazard</name><affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-2573" status="OLD"><idno type="RNSR">200518305E</idno><orgName>Effective Geometric Algorithms for Surfaces and Visibility</orgName><orgName type="acronym">VEGAS</orgName><desc><address><country key="FR"></country></address><ref type="url">http://www.inria.fr/equipes/vegas</ref></desc><listRelation><relation active="#struct-160" type="direct"></relation><relation name="UMR7503" active="#struct-441569" type="indirect"></relation><relation active="#struct-300009" type="indirect"></relation><relation active="#struct-300291" type="indirect"></relation><relation active="#struct-300292" type="indirect"></relation><relation active="#struct-300293" type="indirect"></relation><relation active="#struct-2496" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-160" type="direct"><org type="laboratory" xml:id="struct-160" status="OLD"><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName><orgName type="acronym">LORIA</orgName><desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.loria.fr</ref></desc><listRelation><relation name="UMR7503" active="#struct-441569" type="direct"></relation><relation active="#struct-300009" type="direct"></relation><relation active="#struct-300291" type="direct"></relation><relation active="#struct-300292" type="direct"></relation><relation active="#struct-300293" type="direct"></relation></listRelation></org></tutelle><tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno><idno type="IdRef">02636817X</idno><orgName>Centre National de la Recherche Scientifique</orgName><orgName type="acronym">CNRS</orgName><date type="start">1939-10-19</date><desc><address><country key="FR"></country></address><ref type="url">http://www.cnrs.fr/</ref></desc></org></tutelle><tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName><orgName type="acronym">Inria</orgName><desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.inria.fr/en/</ref></desc></org></tutelle><tutelle active="#struct-300291" type="indirect"><org type="institution" xml:id="struct-300291" status="OLD"><orgName>Université Henri Poincaré - Nancy 1</orgName><orgName type="acronym">UHP</orgName><date type="end">2011-12-31</date><desc><address><addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-300292" type="indirect"><org type="institution" xml:id="struct-300292" status="OLD"><orgName>Université Nancy 2</orgName><date type="end">2011-12-31</date><desc><address><addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-300293" type="indirect"><org type="institution" xml:id="struct-300293" status="OLD"><orgName>Institut National Polytechnique de Lorraine</orgName><orgName type="acronym">INPL</orgName><date type="end">2011-12-31</date><desc><address><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-2496" type="direct"><org type="laboratory" xml:id="struct-2496" status="OLD"><orgName>INRIA Lorraine</orgName><desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine><country key="FR"></country></address><ref type="url">http://www.inria.fr/centre-de-recherche-inria/nancy-grand-est</ref></desc><listRelation><relation active="#struct-300009" type="direct"></relation></listRelation></org></tutelle></tutelles></hal:affiliation><country>France</country><placeName><settlement type="city">Nancy</settlement><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region></placeName><orgName type="university">Université Nancy 2</orgName><orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName><placeName><settlement type="city">Nancy</settlement><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region></placeName><orgName type="university">Institut national polytechnique de Lorraine</orgName><orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName></affiliation></author><author><name sortKey="Liotta, Giuseppe" sort="Liotta, Giuseppe" uniqKey="Liotta G" first="Giuseppe" last="Liotta">Giuseppe Liotta</name><affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-48497" status="INCOMING"><orgName>Dip. di Ingegneria Elettronica e dell'Informazione</orgName><desc><address><country key="IT"></country></address></desc><listRelation><relation active="#struct-366004" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-366004" type="direct"><org type="institution" xml:id="struct-366004" status="INCOMING"><orgName>Università degli Studi di Perugia</orgName><desc><address><country key="FR"></country></address></desc></org></tutelle></tutelles></hal:affiliation><country>Italie</country></affiliation></author><author><name sortKey="Wismath, Steve" sort="Wismath, Steve" uniqKey="Wismath S" first="Steve" last="Wismath">Steve Wismath</name><affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-7216" status="VALID"><orgName>Department of Mathematics and Computer Science</orgName><desc><address><addrLine>4401 University Drive Lethbridge, Alberta, Canada T1K 3M4</addrLine><country key="CA"></country></address><ref type="url">http://www.uleth.ca/fas/mcs/</ref></desc><listRelation><relation active="#struct-364773" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-364773" type="direct"><org type="institution" xml:id="struct-364773" status="INCOMING"><orgName>UNIVERSITY OF LETHBRIDGE</orgName><desc><address><country key="FR"></country></address></desc></org></tutelle></tutelles></hal:affiliation><country>Canada</country></affiliation></author></analytic><idno type="DOI">10.1007/978-3-540-77537-9_34</idno></biblStruct></sourceDesc></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">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></HAL><ISTEX><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><idno type="wicri:doubleKey">0302-9743:2008:Everett H:universal:sets:of</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></ISTEX></double></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 004396 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 004396 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Merge
|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. |  |