Skip to main content
Conference Proceedings

A more compact visibility representation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1994) 790 LNCS 411-424
DOI: 10.1007/3-540-57899-4_70
16Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we present a linear time and space algorithm for constructing a visibility representation of a planar graph on an [formula presented] × (n−1) grid, thereby improving the previous bound of (2n−5)×(n−1). To this end we build in linear time the 4-block tree of a triangulated planar graph.

Cite

CITATION STYLE

APA

Kant, G. (1994). A more compact visibility representation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 790 LNCS, pp. 411–424). Springer Verlag. https://doi.org/10.1007/3-540-57899-4_70

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free