Can visibility graphs Be represented compactly?
- 1 September 1994
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 12 (3) , 347-365
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Applications of Parametric Searching in Geometric OptimizationJournal of Algorithms, 1994
- Algorithms for bichromatic line-segment problems and polyhedral terrainsAlgorithmica, 1994
- An Output-Sensitive Algorithm for Computing Visibility GraphsSIAM Journal on Computing, 1991
- THE COMPLEXITY OF COMPUTING PARTIAL SUMS OFF-LINEInternational Journal of Computational Geometry & Applications, 1991
- Computing the longest diagonal of a simple polygonInformation Processing Letters, 1990
- Lower bounds on the complexity of polytope range searchingJournal of the American Mathematical Society, 1989
- Constructing the visibility graph for n-line segments in O(n2) timeInformation Processing Letters, 1985
- A Lower Bound on the Complexity of Orthogonal Range QueriesJournal of the ACM, 1981
- On a Problem of Sidon in Additive Number Theory, and on some Related ProblemsJournal of the London Mathematical Society, 1941
- A theorem in finite projective geometry and some applications to number theoryTransactions of the American Mathematical Society, 1938