Skip to main content
Conference ProceedingsOPEN ACCESS

An algorithm to construct greedy drawings of triangulations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2009) 5417 LNCS 26-37
DOI: 10.1007/978-3-642-00219-9_4
14Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We show an algorithm to construct greedy drawings of every given triangulation. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Angelini, P., Frati, F., & Grilli, L. (2009). An algorithm to construct greedy drawings of triangulations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5417 LNCS, pp. 26–37). Springer Verlag. https://doi.org/10.1007/978-3-642-00219-9_4

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