Obstructing Visibilities with One Obstacle

DOI10.1007/978-3-319-50106-2_23zbMath1478.68223arXiv1607.00278OpenAlexW2963878458MaRDI QIDQ2961523

Ji-won Park, Alexander Wolff, Steven Chaplick, Fabian Lipp

Publication date: 21 February 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1607.00278

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (7)

Combinatorial properties and recognition of unit square visibility graphs ⋮ Mutual witness Gabriel drawings of complete bipartite graphs ⋮ Mutual witness Gabriel drawings of complete bipartite graphs ⋮ Obstructing Visibilities with One Obstacle ⋮ Outside-obstacle representations with all vertices on the outer face ⋮ Drawing graphs using a small number of obstacles ⋮ Unnamed Item

Cites Work

• Lower bounds on the obstacle number of graphs
• Recognition and complexity of point visibility graphs
• On the structure of graphs with low obstacle number
• Obstacle numbers of graphs
• Drawing graphs using a small number of obstacles
• On obstacle numbers
• Convex Obstacle Numbers of Outerplanar Graphs and Bipartite Permutation Graphs
• Obstructing Visibilities with One Obstacle
• Graphs with Large Obstacle Numbers
• Graph Sandwich Problems
• Graphs with Obstacle Number Greater than One
• The complexity of satisfiability problems

This page was built for publication: Obstructing Visibilities with One Obstacle