<?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-00795079</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-19T08:58:25+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Scalable algorithms for bichromatic line segment intersection problems on coarse grained multicomputers</title>
            <author role="aut">
              <persName>
                <forename type="first">Olivier</forename>
                <surname>Devillers</surname>
              </persName>
              <email type="md5">84567043a7422b2d5b62fbb616826026</email>
              <email type="domain">inria.fr</email>
              <idno type="idhal" notation="string">olivierdevillers</idno>
              <idno type="idhal" notation="numeric">2232</idno>
              <idno type="halauthorid" notation="string">26407-2232</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-4275-5068</idno>
              <idno type="GOOGLE SCHOLAR">http://scholar.google.com/citations?user=oD-iXjcAAAAJ</idno>
              <idno type="IDREF">https://www.idref.fr/033684162</idno>
              <orgName ref="#struct-300009"/>
              <affiliation ref="#struct-2476"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Andreas</forename>
                <surname>Fabri</surname>
              </persName>
              <email type="md5">c7835085073a6a4f31703b222a7d98e8</email>
              <email type="domain">geometryfactory.com</email>
              <idno type="idhal" notation="numeric">833595</idno>
              <idno type="halauthorid" notation="string">144661-833595</idno>
              <affiliation ref="#struct-2476"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Olivier</forename>
                <surname>Devillers</surname>
              </persName>
              <email type="md5">84567043a7422b2d5b62fbb616826026</email>
              <email type="domain">inria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2013-02-27 11:30:14</date>
              <date type="whenModified">2025-08-26 15:21:01</date>
              <date type="whenReleased">2013-02-27 11:30:14</date>
              <date type="whenProduced">1996</date>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="102611">
                <persName>
                  <forename>Olivier</forename>
                  <surname>Devillers</surname>
                </persName>
                <email type="md5">84567043a7422b2d5b62fbb616826026</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-00795079</idno>
            <idno type="halUri">https://inria.hal.science/hal-00795079</idno>
            <idno type="halBibtex">devillers:hal-00795079</idno>
            <idno type="halRefHtml">&lt;i&gt;International Journal of Computational Geometry and Applications&lt;/i&gt;, 1996, 6 (4), pp.487-506. &lt;a target="_blank" href="https://dx.doi.org/10.1142/S0218195996000307"&gt;&amp;#x27E8;10.1142/S0218195996000307&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">International Journal of Computational Geometry and Applications, 1996, 6 (4), pp.487-506. &amp;#x27E8;10.1142/S0218195996000307&amp;#x27E9;</idno>
            <availability status="restricted"/>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="INRIA-SOPHIA">INRIA Sophia Antipolis - Méditerranée</idno>
            <idno type="stamp" n="INRIASO">INRIA-SOPHIA</idno>
            <idno type="stamp" n="INRIA_TEST">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="TESTALAIN1">TESTALAIN1</idno>
            <idno type="stamp" n="INRIA2">INRIA 2</idno>
            <idno type="stamp" n="UNIV-COTEDAZUR">Université Côte d'Azur</idno>
            <idno type="stamp" n="INRIA-300009">Inria 300009</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Scalable algorithms for bichromatic line segment intersection problems on coarse grained multicomputers</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Olivier</forename>
                    <surname>Devillers</surname>
                  </persName>
                  <email type="md5">84567043a7422b2d5b62fbb616826026</email>
                  <email type="domain">inria.fr</email>
                  <idno type="idhal" notation="string">olivierdevillers</idno>
                  <idno type="idhal" notation="numeric">2232</idno>
                  <idno type="halauthorid" notation="string">26407-2232</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-4275-5068</idno>
                  <idno type="GOOGLE SCHOLAR">http://scholar.google.com/citations?user=oD-iXjcAAAAJ</idno>
                  <idno type="IDREF">https://www.idref.fr/033684162</idno>
                  <orgName ref="#struct-300009"/>
                  <affiliation ref="#struct-2476"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Andreas</forename>
                    <surname>Fabri</surname>
                  </persName>
                  <email type="md5">c7835085073a6a4f31703b222a7d98e8</email>
                  <email type="domain">geometryfactory.com</email>
                  <idno type="idhal" notation="numeric">833595</idno>
                  <idno type="halauthorid" notation="string">144661-833595</idno>
                  <affiliation ref="#struct-2476"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">14376</idno>
                <idno type="issn">0218-1959</idno>
                <idno type="eissn">0218-1959</idno>
                <title level="j">International Journal of Computational Geometry and Applications</title>
                <imprint>
                  <publisher>World Scientific Publishing</publisher>
                  <biblScope unit="volume">6</biblScope>
                  <biblScope unit="issue">4</biblScope>
                  <biblScope unit="pp">487-506</biblScope>
                  <date type="datePub">1996</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1142/S0218195996000307</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info.info-cg">Computer Science [cs]/Computational Geometry [cs.CG]</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>We present output-sensitive scalable parallel algorithms for bichromatic line segment intersection problems for the coarse grained multicomputer model. Under the assumption that n≥p^2, where n is the number of line segments and p the number of processors, we obtain an intersection counting algorithm with a time complexity of O( (n log n log p)/p + Ts(n log p,p) ), where Ts(m, p) is the time used to sort m items on a p processor machine. The first term captures the time spent in sequential computation performed locally by each processor. The second term captures the interprocessor communication time. An additional O(k/p) time in sequential computation is spent on the reporting of the k intersections. As the sequential time complexity is O(n log n) for counting and an additional time O(k) for reporting, we obtain a speedup of p/log p in the sequential part of the algorithm. The speedup in the communication part obviously depends on the underlying architecture. For example for a hypercube it ranges between p/log^2p and p/log p depending on the ratio of n and p. As the reporting does not involve more interprocessor communication than the counting, the algorithm achieves a full speedup of p for k≥ O(max(n log n log p, n log^3 p)) even on a hypercube.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-2476" status="OLD">
          <idno type="RNSR">198721510S</idno>
          <orgName>Geometry, Algorithms and Robotics</orgName>
          <orgName type="acronym">PRISME</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-34586" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-34586" status="VALID">
          <idno type="RNSR">198318250R</idno>
          <idno type="ROR">https://ror.org/01nzkaw91</idno>
          <orgName>Centre Inria d'Université Côte d'Azur</orgName>
          <desc>
            <address>
              <addrLine>2004 route des Lucioles BP 93 06902 Sophia Antipolis</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/centre/sophia/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300009" status="VALID">
          <idno type="ROR">https://ror.org/02kvxyf05</idno>
          <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"/>
            </address>
            <ref type="url">http://www.inria.fr/en/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>