Skip to main content
Conference ProceedingsOPEN ACCESS

Compact encodings of planar orthogonal drawings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2002) 2528 LNCS 174-186
DOI: 10.1007/3-540-36151-0_17
0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We present time-efficient algorithms for encoding (and decoding) planar orthogonal drawings of degree-4 and degree-3 biconnected and triconnected planar graphs using small number of bits. We also present time-efficient algorithms for encoding (and decoding) turn-monotone planar orthogonal drawings. © Springer-Verlag Berlin Heidelberg 2002.

Cite

CITATION STYLE

APA

Chanda, A., & Garg, A. (2002). Compact encodings of planar orthogonal drawings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2528 LNCS, pp. 174–186). Springer Verlag. https://doi.org/10.1007/3-540-36151-0_17

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