Skip to main content
Conference ProceedingsOPEN ACCESS

Linear-size universal point sets for one-bend drawings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2015) 9411 423-429
DOI: 10.1007/978-3-319-27261-0_35
6Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

For every integer n ≥ 4, we construct a planar point set Sn of size 6n − 10 such that every n-vertex planar graph G admits a plane embedding in which the vertices are mapped to points in Sn, and every edge is either a line segment or a polyline with one bend, where the bend point is also in Sn.

Cite

CITATION STYLE

APA

Löffler, M., & Tóth, C. D. (2015). Linear-size universal point sets for one-bend drawings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9411, pp. 423–429). Springer Verlag. https://doi.org/10.1007/978-3-319-27261-0_35

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