InforLorV4, Hal, Checkpoint, bibRecord, 006011

Distance segment visibility graphs

Identifieur interne : 006011 ( Hal/Checkpoint ); précédent : 006010; suivant : 006012

Distance segment visibility graphs

Auteurs : Hazel Everett [France] ; C. T. Hoang ; K. Kilakos ; M. Noy

Source :

RBID : Hal:inria-00099260

Descripteurs français

mix :
- visibility computational geometry, visibilité géométrie algorithmique.

Abstract

Given a set of disjoint line segments in the plane, the distance segment visibility graph is the segment visibility graph in which each edge is assigned a weight equal to the Euclidean distance between the corresponding segment endpoints. In this paper we provide a polynomial time recognition algorithm for distance segment visibility graphs.

Url:

https://hal.inria.fr/inria-00099260

Links toward previous steps (curation, corpus...)

to stream Hal, to step Corpus: 006B07
to stream Hal, to step Curation: 006B07

Links to Exploration step

Hal:inria-00099260

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="it">Distance segment visibility graphs</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-2350" status="OLD"><idno type="RNSR">199521440F</idno>
<orgName>Models, algorithms and geometry for computer graphics and vision</orgName>
<orgName type="acronym">ISA</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/isa</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="Hoang, C T" sort="Hoang, C T" uniqKey="Hoang C" first="C. T." last="Hoang">C. T. Hoang</name>
</author>
<author><name sortKey="Kilakos, K" sort="Kilakos, K" uniqKey="Kilakos K" first="K." last="Kilakos">K. Kilakos</name>
</author>
<author><name sortKey="Noy, M" sort="Noy, M" uniqKey="Noy M" first="M." last="Noy">M. Noy</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:inria-00099260</idno>
<idno type="halId">inria-00099260</idno>
<idno type="halUri">https://hal.inria.fr/inria-00099260</idno>
<idno type="url">https://hal.inria.fr/inria-00099260</idno>
<date when="2000">2000</date>
<idno type="wicri:Area/Hal/Corpus">006B07</idno>
<idno type="wicri:Area/Hal/Curation">006B07</idno>
<idno type="wicri:Area/Hal/Checkpoint">006011</idno>
<idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">006011</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="it">Distance segment visibility graphs</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-2350" status="OLD"><idno type="RNSR">199521440F</idno>
<orgName>Models, algorithms and geometry for computer graphics and vision</orgName>
<orgName type="acronym">ISA</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/isa</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="Hoang, C T" sort="Hoang, C T" uniqKey="Hoang C" first="C. T." last="Hoang">C. T. Hoang</name>
</author>
<author><name sortKey="Kilakos, K" sort="Kilakos, K" uniqKey="Kilakos K" first="K." last="Kilakos">K. Kilakos</name>
</author>
<author><name sortKey="Noy, M" sort="Noy, M" uniqKey="Noy M" first="M." last="Noy">M. Noy</name>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="mix" xml:lang="fr"><term>visibility computational geometry</term>
<term>visibilité géométrie algorithmique</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Given a set of disjoint line segments in the plane, the distance segment visibility graph is the segment visibility graph in which each edge is assigned a weight equal to the Euclidean distance between the corresponding segment endpoints. In this paper we provide a polynomial time recognition algorithm for distance segment visibility graphs.</div>
</front>
</TEI>
<hal api="V3"><titleStmt><title xml:lang="it">Distance segment visibility graphs</title>
<author role="aut"><persName><forename type="first">Hazel</forename>
<surname>Everett</surname>
</persName>
<email>Hazel.Everett@loria.fr</email>
<idno type="halauthor">61496</idno>
<orgName ref="#struct-300292"></orgName>
<affiliation ref="#struct-2350"></affiliation>
</author>
<author role="aut"><persName><forename type="first">C.T.</forename>
<surname>Hoang</surname>
</persName>
<email></email>
<idno type="halauthor">130440</idno>
<orgName ref="#struct-364684"></orgName>
</author>
<author role="aut"><persName><forename type="first">K.</forename>
<surname>Kilakos</surname>
</persName>
<email></email>
<idno type="halauthor">130441</idno>
<orgName ref="#struct-364685"></orgName>
</author>
<author role="aut"><persName><forename type="first">M.</forename>
<surname>Noy</surname>
</persName>
<email></email>
<idno type="halauthor">130442</idno>
<orgName ref="#struct-364686"></orgName>
</author>
<editor role="depositor"><persName><forename>Publications</forename>
<surname>Loria</surname>
</persName>
<email>publications@loria.fr</email>
</editor>
</titleStmt>
<editionStmt><edition n="v1" type="current"><date type="whenSubmitted">2006-09-26 08:52:13</date>
<date type="whenModified">2016-05-19 01:09:31</date>
<date type="whenReleased">2006-09-28 15:22:46</date>
<date type="whenProduced">2000</date>
</edition>
<respStmt><resp>contributor</resp>
<name key="108626"><persName><forename>Publications</forename>
<surname>Loria</surname>
</persName>
<email>publications@loria.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt><distributor>CCSD</distributor>
<idno type="halId">inria-00099260</idno>
<idno type="halUri">https://hal.inria.fr/inria-00099260</idno>
<idno type="halBibtex">everett:inria-00099260</idno>
<idno type="halRefHtml">[Intern report] A00-R-429 || everett00b, 2000</idno>
<idno type="halRef">[Intern report] A00-R-429 || everett00b, 2000</idno>
</publicationStmt>
<seriesStmt><idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="INPL">Institut National Polytechnique de Lorraine</idno>
<idno type="stamp" n="LORIA2">Publications du LORIA</idno>
<idno type="stamp" n="LORIA">LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications</idno>
<idno type="stamp" n="INRIA-NANCY-GRAND-EST">INRIA Nancy - Grand Est</idno>
<idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</idno>
<idno type="stamp" n="INRIA-LORRAINE">INRIA Nancy - Grand Est</idno>
<idno type="stamp" n="LABO-LORIA-SET" p="LORIA">LABO-LORIA-SET</idno>
</seriesStmt>
<notesStmt><note type="commentary">Rapport interne.</note>
<note type="audience" n="0">Not set</note>
<note type="report" n="3">Intern report</note>
</notesStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="it">Distance segment visibility graphs</title>
<author role="aut"><persName><forename type="first">Hazel</forename>
<surname>Everett</surname>
</persName>
<email>Hazel.Everett@loria.fr</email>
<idno type="halAuthorId">61496</idno>
<orgName ref="#struct-300292"></orgName>
<affiliation ref="#struct-2350"></affiliation>
</author>
<author role="aut"><persName><forename type="first">C.T.</forename>
<surname>Hoang</surname>
</persName>
<idno type="halAuthorId">130440</idno>
<orgName ref="#struct-364684"></orgName>
</author>
<author role="aut"><persName><forename type="first">K.</forename>
<surname>Kilakos</surname>
</persName>
<idno type="halAuthorId">130441</idno>
<orgName ref="#struct-364685"></orgName>
</author>
<author role="aut"><persName><forename type="first">M.</forename>
<surname>Noy</surname>
</persName>
<idno type="halAuthorId">130442</idno>
<orgName ref="#struct-364686"></orgName>
</author>
</analytic>
<monogr><idno type="reportNumber">A00-R-429 || everett00b</idno>
<imprint><date type="datePub">2000</date>
</imprint>
</monogr>
</biblStruct>
</sourceDesc>
<profileDesc><langUsage><language ident="en">English</language>
</langUsage>
<textClass><keywords scheme="author"><term xml:lang="fr">visibilité géométrie algorithmique</term>
<term xml:lang="fr">visibility computational geometry</term>
</keywords>
<classCode scheme="halDomain" n="info.info-oh">Computer Science [cs]/Other [cs.OH]</classCode>
<classCode scheme="halTypology" n="REPORT">Reports</classCode>
</textClass>
<abstract xml:lang="en">Given a set of disjoint line segments in the plane, the distance segment visibility graph is the segment visibility graph in which each edge is assigned a weight equal to the Euclidean distance between the corresponding segment endpoints. In this paper we provide a polynomial time recognition algorithm for distance segment visibility graphs.</abstract>
</profileDesc>
</hal>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Hal/Checkpoint

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

HfdSelect -h $EXPLOR_AREA/Data/Hal/Checkpoint/biblio.hfd -nk 006011 | SxmlIndent | more

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Hal
   |étape=   Checkpoint
   |type=    RBID
   |clé=     Hal:inria-00099260
   |texte=   Distance segment visibility graphs
}}

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

Distance segment visibility graphs

Distance segment visibility graphs

Source :

Descripteurs français

Abstract

Links toward previous steps (curation, corpus...)

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