Recognizing Visibility Graphs of Triangulated Irregular Networks

A Triangulated Irregular Network (TIN) is a data structure that is usually used for representing and storing monotone geographic surfaces, approximately. In this representation, the surface is approximated by a set of triangular faces whose projection on the XY-plane is a triangulation. The visibili...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2021-01
Main Author: Hossein Boomari Mojtaba Ostovari Alireza Zarei
Format: Article
Language:English
Subjects:
Apexes
Data structures
Graph theory
Triangulation
Visibility
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Hossein Boomari Mojtaba Ostovari Alireza Zarei
description A Triangulated Irregular Network (TIN) is a data structure that is usually used for representing and storing monotone geographic surfaces, approximately. In this representation, the surface is approximated by a set of triangular faces whose projection on the XY-plane is a triangulation. The visibility graph of a TIN is a graph whose vertices correspond to the vertices of the TIN and there is an edge between two vertices if their corresponding vertices on TIN see each other, i.e. the segment that connects these vertices completely lies above the TIN. Computing the visibility graph of a TIN and its properties have been considered thoroughly in the literature. In this paper, we consider this problem in reverse: Given a graph G, is there a TIN with the same visibility graph as G? We show that this problem is Complete for Existential Theory of The Reals.
format article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2480952879</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2480952879</sourcerecordid><originalsourceid>FETCH-proquest_journals_24809528793</originalsourceid><addsrcrecordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mRwCEpNzk_Py6zKzEtXCMsszkzKzMksqVRwL0osyChWyE9TCCnKTMxLL81JLElNUfAsKkoFsYsU_FJLyvOLsot5GFjTEnOKU3mhNDeDsptriLOHbkFRfmFpanFJfFZ-aVEeUCreyMTCwNLUyMLc0pg4VQCEQTnA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2480952879</pqid></control><display><type>article</type><title>Recognizing Visibility Graphs of Triangulated Irregular Networks</title><source>Publicly Available Content Database</source><creator>Hossein Boomari Mojtaba Ostovari Alireza Zarei</creator><creatorcontrib>Hossein Boomari Mojtaba Ostovari Alireza Zarei</creatorcontrib><description>A Triangulated Irregular Network (TIN) is a data structure that is usually used for representing and storing monotone geographic surfaces, approximately. In this representation, the surface is approximated by a set of triangular faces whose projection on the XY-plane is a triangulation. The visibility graph of a TIN is a graph whose vertices correspond to the vertices of the TIN and there is an edge between two vertices if their corresponding vertices on TIN see each other, i.e. the segment that connects these vertices completely lies above the TIN. Computing the visibility graph of a TIN and its properties have been considered thoroughly in the literature. In this paper, we consider this problem in reverse: Given a graph G, is there a TIN with the same visibility graph as G? We show that this problem is Complete for Existential Theory of The Reals.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Apexes ; Data structures ; Graph theory ; Triangulation ; Visibility</subject><ispartof>arXiv.org, 2021-01</ispartof><rights>2021. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/2480952879?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>780,784,25753,37012,44590</link.rule.ids></links><search><creatorcontrib>Hossein Boomari Mojtaba Ostovari Alireza Zarei</creatorcontrib><title>Recognizing Visibility Graphs of Triangulated Irregular Networks</title><title>arXiv.org</title><description>A Triangulated Irregular Network (TIN) is a data structure that is usually used for representing and storing monotone geographic surfaces, approximately. In this representation, the surface is approximated by a set of triangular faces whose projection on the XY-plane is a triangulation. The visibility graph of a TIN is a graph whose vertices correspond to the vertices of the TIN and there is an edge between two vertices if their corresponding vertices on TIN see each other, i.e. the segment that connects these vertices completely lies above the TIN. Computing the visibility graph of a TIN and its properties have been considered thoroughly in the literature. In this paper, we consider this problem in reverse: Given a graph G, is there a TIN with the same visibility graph as G? We show that this problem is Complete for Existential Theory of The Reals.</description><subject>Apexes</subject><subject>Data structures</subject><subject>Graph theory</subject><subject>Triangulation</subject><subject>Visibility</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><recordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mRwCEpNzk_Py6zKzEtXCMsszkzKzMksqVRwL0osyChWyE9TCCnKTMxLL81JLElNUfAsKkoFsYsU_FJLyvOLsot5GFjTEnOKU3mhNDeDsptriLOHbkFRfmFpanFJfFZ-aVEeUCreyMTCwNLUyMLc0pg4VQCEQTnA</recordid><startdate>20210124</startdate><enddate>20210124</enddate><creator>Hossein Boomari Mojtaba Ostovari Alireza Zarei</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20210124</creationdate><title>Recognizing Visibility Graphs of Triangulated Irregular Networks</title><author>Hossein Boomari Mojtaba Ostovari Alireza Zarei</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_24809528793</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Apexes</topic><topic>Data structures</topic><topic>Graph theory</topic><topic>Triangulation</topic><topic>Visibility</topic><toplevel>online_resources</toplevel><creatorcontrib>Hossein Boomari Mojtaba Ostovari Alireza Zarei</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>ProQuest Central Essentials</collection><collection>AUTh Library subscriptions: ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Hossein Boomari Mojtaba Ostovari Alireza Zarei</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Recognizing Visibility Graphs of Triangulated Irregular Networks</atitle><jtitle>arXiv.org</jtitle><date>2021-01-24</date><risdate>2021</risdate><eissn>2331-8422</eissn><abstract>A Triangulated Irregular Network (TIN) is a data structure that is usually used for representing and storing monotone geographic surfaces, approximately. In this representation, the surface is approximated by a set of triangular faces whose projection on the XY-plane is a triangulation. The visibility graph of a TIN is a graph whose vertices correspond to the vertices of the TIN and there is an edge between two vertices if their corresponding vertices on TIN see each other, i.e. the segment that connects these vertices completely lies above the TIN. Computing the visibility graph of a TIN and its properties have been considered thoroughly in the literature. In this paper, we consider this problem in reverse: Given a graph G, is there a TIN with the same visibility graph as G? We show that this problem is Complete for Existential Theory of The Reals.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2021-01
issn 2331-8422
language eng
recordid cdi_proquest_journals_2480952879
source Publicly Available Content Database
subjects Apexes
Data structures
Graph theory
Triangulation
Visibility
title Recognizing Visibility Graphs of Triangulated Irregular Networks
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T00%3A12%3A14IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Recognizing%20Visibility%20Graphs%20of%20Triangulated%20Irregular%20Networks&rft.jtitle=arXiv.org&rft.au=Hossein%20Boomari%20Mojtaba%20Ostovari%20Alireza%20Zarei&rft.date=2021-01-24&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2480952879%3C/proquest%3E%3Cgrp_id%3Ecdi_FETCH-proquest_journals_24809528793%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2480952879&rft_id=info:pmid/&rfr_iscdi=true