Can visibility graphs be represented compactly?
type: Item
instance of: scholarly article
title: Can visibility graphs be represented compactly?
zbMATH Open document ID: 0819.68134
DOI: 10.1007/BF02574385
author: Noga Alon
author: Subhash Suri
author: Pankaj K. Agarwal
author: Boris Aronov
published in: Discrete \& Computational Geometry
publication date: 1994-11-27T00:00:00Z
full work available at URL: https://eudml.org/doc/131336
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 695541
zbMATH Keywords: visibility graph
zbMATH Keywords: clique cover
Wikidata QID: Q56001794
MaRDI profile type: Publication
cites work: Q4763391
cites work: Computing the longest diagonal of a simple polygon
cites work: Lower Bounds on the Complexity of Polytope Range Searching
cites work: Lower bounds for orthogonal range searching: part II. The arithmetic model
cites work: Algorithms for bichromatic line-segment problems and polyhedral terrains
cites work: Visibility and intersection problems in plane geometry
cites work: THE COMPLEXITY OF COMPUTING PARTIAL SUMS OFF-LINE
cites work: On a Problem of Sidon in Additive Number Theory, and on some Related Problems
cites work: A Lower Bound on the Complexity of Orthogonal Range Queries
cites work: An Output-Sensitive Algorithm for Computing Visibility Graphs
cites work: Q5525916
cites work: Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
cites work: Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
DBLP publication ID: journals/dcg/AgarwalAAS94
description: scientific article; zbMATH DE number 695541