<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-01571212v3</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-16T14:36:08+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Continuous Average Straightness in Spatial Graphs</title>
            <author role="aut">
              <persName>
                <forename type="first">Vincent</forename>
                <surname>Labatut</surname>
              </persName>
              <email type="md5">f6c9443293474981818aafea69d142db</email>
              <email type="domain">univ-avignon.fr</email>
              <idno type="idhal" notation="string">vlabatut</idno>
              <idno type="idhal" notation="numeric">482</idno>
              <idno type="halauthorid" notation="string">23300-482</idno>
              <idno type="ARXIV">https://arxiv.org/a/labatut_v_1</idno>
              <idno type="RESEARCHERID">http://www.researcherid.com/rid/F-9873-2010</idno>
              <idno type="IDREF">https://www.idref.fr/076951375</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-2619-2835</idno>
              <idno type="VIAF">https://viaf.org/viaf/214940844</idno>
              <idno type="ISNI">http://isni.org/isni/0000000004846645</idno>
              <idno type="GOOGLE SCHOLAR">https://scholar.google.fr/citations?user=I8GnHekAAAAJ</idno>
              <idno type="RESEARCHERID">http://www.researcherid.com/rid/http://www.researcherid.com/rid/F-9873-2010</idno>
              <affiliation ref="#struct-100376"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Vincent</forename>
                <surname>Labatut</surname>
              </persName>
              <email type="md5">f6c9443293474981818aafea69d142db</email>
              <email type="domain">univ-avignon.fr</email>
            </editor>
            <funder>CNRS PEPS MoMIS Urbi&amp;OrbiUniversité d'Avignon - Projet d'excellence SpiderNetAgorantic FR 3621</funder>
          </titleStmt>
          <editionStmt>
            <edition n="v1">
              <date type="whenSubmitted">2017-08-02 15:14:21</date>
            </edition>
            <edition n="v2">
              <date type="whenSubmitted">2018-03-23 13:30:04</date>
            </edition>
            <edition n="v3" type="current">
              <date type="whenSubmitted">2023-04-30 21:29:47</date>
              <date type="whenWritten">2016-10</date>
              <date type="whenModified">2024-07-17 09:21:12</date>
              <date type="whenReleased">2023-05-30 09:16:38</date>
              <date type="whenProduced">2018-04</date>
              <date type="whenEndEmbargoed">2023-04-30</date>
              <ref type="file" target="https://hal.science/hal-01571212v3/document">
                <date notBefore="2023-04-30"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-01571212v3/file/bare_jrnl.pdf" id="file-4108476-3577022">
                <date notBefore="2023-04-30"/>
              </ref>
              <ref type="annex" n="0" target="https://hal.science/hal-01571212v3/file/straightness_pres.pdf" id="file-4108476-3577050">
                <date notBefore="2023-05-27"/>
              </ref>
              <ref type="externalLink" target="http://arxiv.org/pdf/1708.00743"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="166001">
                <persName>
                  <forename>Vincent</forename>
                  <surname>Labatut</surname>
                </persName>
                <email type="md5">f6c9443293474981818aafea69d142db</email>
                <email type="domain">univ-avignon.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01571212</idno>
            <idno type="halUri">https://hal.science/hal-01571212</idno>
            <idno type="halBibtex">labatut:hal-01571212</idno>
            <idno type="halRefHtml">&lt;i&gt;Journal of Complex Networks&lt;/i&gt;, 2018, 6 (2), pp.269-296. &lt;a target="_blank" href="https://dx.doi.org/10.1093/comnet/cnx033"&gt;&amp;#x27E8;10.1093/comnet/cnx033&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Journal of Complex Networks, 2018, 6 (2), pp.269-296. &amp;#x27E8;10.1093/comnet/cnx033&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by-nc-sa/4.0/">CC BY-NC-SA 4.0 - Attribution - Non-commercial use - ShareAlike<ref corresp="#file-4108476-3577022"/><ref corresp="#file-4108476-3577050"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UNIV-AVIGNON">Université d'Avignon</idno>
            <idno type="stamp" n="TDS-MACS">Réseau de recherche en Théorie des Systèmes Distribués, Modélisation, Analyse et Contrôle des Systèmes</idno>
            <idno type="stamp" n="LIA" corresp="UNIV-AVIGNON">Laboratoire Informatique d'Avignon</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Continuous Average Straightness in Spatial Graphs</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Vincent</forename>
                    <surname>Labatut</surname>
                  </persName>
                  <email type="md5">f6c9443293474981818aafea69d142db</email>
                  <email type="domain">univ-avignon.fr</email>
                  <idno type="idhal" notation="string">vlabatut</idno>
                  <idno type="idhal" notation="numeric">482</idno>
                  <idno type="halauthorid" notation="string">23300-482</idno>
                  <idno type="ARXIV">https://arxiv.org/a/labatut_v_1</idno>
                  <idno type="RESEARCHERID">http://www.researcherid.com/rid/F-9873-2010</idno>
                  <idno type="IDREF">https://www.idref.fr/076951375</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-2619-2835</idno>
                  <idno type="VIAF">https://viaf.org/viaf/214940844</idno>
                  <idno type="ISNI">http://isni.org/isni/0000000004846645</idno>
                  <idno type="GOOGLE SCHOLAR">https://scholar.google.fr/citations?user=I8GnHekAAAAJ</idno>
                  <idno type="RESEARCHERID">http://www.researcherid.com/rid/http://www.researcherid.com/rid/F-9873-2010</idno>
                  <affiliation ref="#struct-100376"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">105078</idno>
                <idno type="issn">2051-1310</idno>
                <idno type="eissn">2051-1329</idno>
                <title level="j">Journal of Complex Networks</title>
                <imprint>
                  <publisher>Oxford University Press</publisher>
                  <biblScope unit="volume">6</biblScope>
                  <biblScope unit="issue">2</biblScope>
                  <biblScope unit="pp">269-296</biblScope>
                  <date type="datePub">2018-04</date>
                  <date type="dateEpub">2017</date>
                </imprint>
              </monogr>
              <idno type="arxiv">1708.00743</idno>
              <idno type="doi">10.1093/comnet/cnx033</idno>
              <ref type="publisher">https://academic.oup.com/comnet/article-abstract/6/2/269/4090988</ref>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Spatial graph</term>
                <term xml:lang="en">Graph characterization</term>
                <term xml:lang="en">Straightness</term>
                <term xml:lang="en">Centrality measure</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-dm">Computer Science [cs]/Discrete Mathematics [cs.DM]</classCode>
              <classCode scheme="halTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halOldTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halTreeTypology" n="ART">Journal articles</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>The Straightness is a measure designed to characterize a pair of vertices in a spatial graph. It is defined as the ratio of the Euclidean distance to the graph distance between these vertices. It is often used as an average, for instance to describe the accessibility of a single vertex relatively to all the other vertices in the graph, or even to summarize the graph as a whole. In some cases, one needs to process the Straightness between not only vertices, but also any other points constituting the graph of interest. Suppose for instance that our graph represents a road network and we do not want to limit ourselves to crossroad-to-crossroad itineraries, but allow any street number to be a starting point or destination. In this situation, the standard approach consists in: 1) discretizing the graph edges, 2) processing the vertex-to-vertex Straightness considering the additional vertices resulting from this discretization, and 3) performing the appropriate average on the obtained values. However, this discrete approximation can be computationally expensive on large graphs, and its precision has not been clearly assessed. In this article, we adopt a continuous approach to average the Straightness over the edges of spatial graphs. This allows us to derive 5 distinct measures able to characterize precisely the accessibility of the whole graph, as well as individual vertices and edges. Our method is generic and could be applied to other measures designed for spatial graphs. We perform an experimental evaluation of our continuous average Straightness measures, and show how they behave differently from the traditional vertex-to-vertex ones. Moreover, we also study their discrete approximations, and show that our approach is globally less demanding in terms of both processing time and memory usage. Our R source code is publicly available under an open source license.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-100376" status="VALID">
          <orgName>Laboratoire Informatique d'Avignon</orgName>
          <orgName type="acronym">LIA</orgName>
          <desc>
            <address>
              <addrLine>339 Chemin des Meinajaries Agroparc BP 1228 84911 Avignon cedex 9</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://lia.univ-avignon.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-195507" type="direct"/>
            <relation active="#struct-302221" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-195507" status="VALID">
          <idno type="ROR">https://ror.org/00mfpxb84</idno>
          <orgName>Avignon Université</orgName>
          <orgName type="acronym">AU</orgName>
          <desc>
            <address>
              <addrLine>74 rue Louis Pasteur - 84 029 Avignon cedex 1</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-avignon.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-302221" status="VALID">
          <orgName>Centre d'Enseignement et de Recherche en Informatique - CERI</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>