<?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-03165378</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-14T05:07:28+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Computing Boundary Cycle of a Pseudo-Triangle Polygon from Its Visibility Graph</title>
            <author role="aut">
              <persName>
                <forename type="first">Hossein</forename>
                <surname>Boomari</surname>
              </persName>
              <email type="md5">7167272d9a6f4509aef648d11c8382b2</email>
              <email type="domain">student.sharif.ir</email>
              <idno type="idhal" notation="numeric">1093215</idno>
              <idno type="halauthorid" notation="string">1118151-1093215</idno>
              <affiliation ref="#struct-104432"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Soheila</forename>
                <surname>Farokhi</surname>
              </persName>
              <email type="md5">d769de1c0ec9ef519304a85e6928ae0f</email>
              <email type="domain">gmail.com</email>
              <idno type="idhal" notation="numeric">1093216</idno>
              <idno type="halauthorid" notation="string">2168527-1093216</idno>
              <affiliation ref="#struct-104432"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Hal</forename>
                <surname>Ifip</surname>
              </persName>
              <email type="md5">2073ac78024b6e13f2714db96e9b1e63</email>
              <email type="domain">inria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2021-03-10 16:05:01</date>
              <date type="whenModified">2021-03-10 16:15:02</date>
              <date type="whenReleased">2021-03-10 16:15:02</date>
              <date type="whenProduced">2020-07-01</date>
              <date type="whenEndEmbargoed">2023-01-01</date>
              <ref type="file" target="https://inria.hal.science/hal-03165378v1/document">
                <date notBefore="2023-01-01"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-03165378v1/file/495613_1_En_5_Chapter.pdf" id="file-3165378-2775447">
                <date notBefore="2023-01-01"/>
              </ref>
              <ref type="externalLink" target="http://arxiv.org/pdf/2002.06712"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="200187">
                <persName>
                  <forename>Hal</forename>
                  <surname>Ifip</surname>
                </persName>
                <email type="md5">2073ac78024b6e13f2714db96e9b1e63</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-03165378</idno>
            <idno type="halUri">https://inria.hal.science/hal-03165378</idno>
            <idno type="halBibtex">boomari:hal-03165378</idno>
            <idno type="halRefHtml">&lt;i&gt;3rd International Conference on Topics in Theoretical Computer Science (TTCS)&lt;/i&gt;, Jul 2020, Tehran, Iran. pp.61-71, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-030-57852-7_5"&gt;&amp;#x27E8;10.1007/978-3-030-57852-7_5&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">3rd International Conference on Topics in Theoretical Computer Science (TTCS), Jul 2020, Tehran, Iran. pp.61-71, &amp;#x27E8;10.1007/978-3-030-57852-7_5&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-3165378-2775447"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="IFIP-LNCS" corresp="IFIP">IFIP - Lecture Notes in Computer Science</idno>
            <idno type="stamp" n="IFIP">IFIP - International Federation for Information Processing</idno>
            <idno type="stamp" n="IFIP-TC" corresp="IFIP">IFIP Technical Committees </idno>
            <idno type="stamp" n="IFIP-TC1" corresp="IFIP-TC">IFIP TC1: Foundations of Computer Science</idno>
            <idno type="stamp" n="IFIP-WG1-8">IFIP-WG1-8</idno>
            <idno type="stamp" n="IFIP-TTCS">IFIP-TTCS</idno>
            <idno type="stamp" n="IFIP-LNCS-12281" corresp="IFIP-LNCS">Topics in Theoretical Computer Science</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>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Computing Boundary Cycle of a Pseudo-Triangle Polygon from Its Visibility Graph</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Hossein</forename>
                    <surname>Boomari</surname>
                  </persName>
                  <email type="md5">7167272d9a6f4509aef648d11c8382b2</email>
                  <email type="domain">student.sharif.ir</email>
                  <idno type="idhal" notation="numeric">1093215</idno>
                  <idno type="halauthorid" notation="string">1118151-1093215</idno>
                  <affiliation ref="#struct-104432"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Soheila</forename>
                    <surname>Farokhi</surname>
                  </persName>
                  <email type="md5">d769de1c0ec9ef519304a85e6928ae0f</email>
                  <email type="domain">gmail.com</email>
                  <idno type="idhal" notation="numeric">1093216</idno>
                  <idno type="halauthorid" notation="string">2168527-1093216</idno>
                  <affiliation ref="#struct-104432"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Lecture Notes in Computer Science</title>
                <meeting>
                  <title>3rd International Conference on Topics in Theoretical Computer Science (TTCS)</title>
                  <date type="start">2020-07-01</date>
                  <date type="end">2020-07-02</date>
                  <settlement>Tehran</settlement>
                  <country key="IR">Iran</country>
                </meeting>
                <editor>Luís S. Barbosa</editor>
                <editor>Mohammad Ali Abam</editor>
                <imprint>
                  <publisher>Springer International Publishing</publisher>
                  <biblScope unit="serie">Topics in Theoretical Computer Science</biblScope>
                  <biblScope unit="volume">LNCS-12281</biblScope>
                  <biblScope unit="pp">61-71</biblScope>
                  <date type="datePub">2020</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-030-57852-7_5</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info">Computer Science [cs]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>Visibility graph of a simple polygon is a graph with the same vertex set in which there is an edge between a pair of vertices if and only if the segment through them lies completely inside the polygon. Each pair of adjacent vertices on the boundary of the polygon are assumed to be visible. Therefore, the visibility graph of each polygon always contains its boundary edges. This implies that we have always a Hamiltonian cycle in a visibility graph which determines the order of vertices on the boundary of the corresponding polygon. In this paper, we propose a polynomial time algorithm for determining such a Hamiltonian cycle for a pseudo-triangle polygon from its visibility graph.</p>
            </abstract>
            <particDesc>
              <org type="consortium">TC 1</org>
              <org type="consortium">WG 1.8</org>
            </particDesc>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-104432" status="VALID">
          <orgName>Department of Mathematical Sciences</orgName>
          <desc>
            <address>
              <addrLine>Department of Mathematical Sciences Sharif University of Technology P.O.Box 11155-9415 Azadi St., Tehran, Iran,</addrLine>
              <country key="IR"/>
            </address>
            <ref type="url">http://math.sharif.ir/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-310035" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-310035" status="VALID">
          <idno type="IdRef">15499460X</idno>
          <idno type="ROR">https://ror.org/024c2fq17</idno>
          <orgName>Sharif University of Technology [Tehran]</orgName>
          <orgName type="acronym">SUT</orgName>
          <date type="start">1965-01-01</date>
          <desc>
            <address>
              <addrLine>Sharif University of TechnologyAzadi AveTehran, IranPO Box: 11365-11155</addrLine>
              <country key="IR"/>
            </address>
            <ref type="url">http://www.en.sharif.edu/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>