Skip to main content
Conference ProceedingsOPEN ACCESS

Straight-line drawing of quadrangulations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2007) 4372 LNCS 234-239
DOI: 10.1007/978-3-540-70904-6_23
7Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This article introduces a straight-line drawing algorithm for quadrangulations, in the family of the face-counting algorithms. It out-puts in linear time a drawing on a regular W×H grid such that W+H = n -1 - Δ, where n is the number of vertices and Δ is an explicit combinatorial parameter of the quadrangulation. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Fusy, É. (2007). Straight-line drawing of quadrangulations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4372 LNCS, pp. 234–239). Springer Verlag. https://doi.org/10.1007/978-3-540-70904-6_23

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