Terrain visibility graphs: persistence is not enough
In this paper, we consider the Visibility Graph Recognition and Reconstruction problems in
the context of terrains. Here, we are given a graph $ G $ with labeled vertices $ v_0 …
the context of terrains. Here, we are given a graph $ G $ with labeled vertices $ v_0 …
A universality theorem for allowable sequences with applications
U Hoffmann, K Merckx - arXiv preprint arXiv:1801.05992, 2018 - arxiv.org
Order types are a well known abstraction of combinatorial properties of a point set. By Mn\"
ev's universality theorem for each semi-algebraic set $ V $ there is an order type with a …
ev's universality theorem for each semi-algebraic set $ V $ there is an order type with a …
Recognizing visibility graphs of triangulated irregular networks
H Boomari, M Ostovari, A Zarei - Fundamenta Informaticae, 2021 - content.iospress.com
Abstract A Triangulated Irregular Network (TIN) is a data structure that is usually used for
representing and storing monotone geographic surfaces, approximately. In this …
representing and storing monotone geographic surfaces, approximately. In this …
[PDF][PDF] On the visibility graphs of pseudo-polygons: recognition and reconstruction
On the Visibility Graphs of Pseudo-Polygons: Recognition and Reconstruction Page 1 On the
Visibility Graphs of Pseudo-Polygons: Recognition and Reconstruction Safwa Ameer …
Visibility Graphs of Pseudo-Polygons: Recognition and Reconstruction Safwa Ameer …
Pseudo-Triangle Visibility Graph: Characterization and Reconstruction
S Mehrpour, A Zarei - arXiv preprint arXiv:1905.00727, 2019 - arxiv.org
The visibility graph of a simple polygon represents visibility relations between its vertices.
Knowing the correct order of the vertices around the boundary of a polygon and its visibility …
Knowing the correct order of the vertices around the boundary of a polygon and its visibility …
Recognizing and Reconstructing Pseudo Polygons and Terrains from Their Visibility Graphs
S Ameer - 2017 - search.proquest.com
The computational geometry community began studying visibility graphs (VGs) over 30
years ago. Today, visibility graphs are essential to cutting edge applications including …
years ago. Today, visibility graphs are essential to cutting edge applications including …
[图书][B] Understanding of geometric visibility in polygons
Q Wang - 2016 - search.proquest.com
Geometric covering problems have been a focus of research for decades. Most variants of
the problem are NP-hard, and therefore most research on geometric set cover focuses on …
the problem are NP-hard, and therefore most research on geometric set cover focuses on …
Reconstructing Generalized Staircase Polygons with Uniform Step Length
N Sitchinava, D Strash - International Symposium on Graph Drawing and …, 2017 - Springer
Visibility graph reconstruction, which asks us to construct a polygon that has a given visibility
graph, is a fundamental problem with unknown complexity (although visibility graph …
graph, is a fundamental problem with unknown complexity (although visibility graph …