Drawing Planar Graphs on Points Inside a Polygon
(2012) 37th International Symposium, MFSC 2012 In Lecture Notes in Computer Science (Mathematical Foundations of Computer Science 2012) 7464. p.172183 Abstract
 In this paper, we study the problem of drawing a given planar
graph such that vertices are at prespecified points and the
entire drawing is inside a given polygon. We give a method that shows that for
an $n$vertex graph and a $k$sided polygon, $\Theta(kn^2)$ bends
are always sufficient. We also give an example of a graph where
$\Theta(kn^2)$ bends is necessary for such a drawing.
Please use this url to cite or link to this publication:
http://lup.lub.lu.se/record/7867589
 author
 Biedl, Therese and Floderus, Peter ^{LU}
 organization
 publishing date
 2012
 type
 Chapter in Book/Report/Conference proceeding
 publication status
 published
 subject
 keywords
 Graph drawing, Specified point set, Bounding polygon
 in
 Lecture Notes in Computer Science (Mathematical Foundations of Computer Science 2012)
 editor
 Rovan, Branislav; Sassone, Vladimiro; Widmayer, Peter; ; and
 volume
 7464
 pages
 11 pages
 publisher
 Springer
 conference name
 37th International Symposium, MFSC 2012
 external identifiers

 scopus:84865034932
 ISSN
 03029743
 16113349
 ISBN
 9783642325892
 9783642325885
 DOI
 10.1007/9783642325892_18
 language
 English
 LU publication?
 yes
 id
 f4fc71f5e906469294fb7a467835be08 (old id 7867589)
 date added to LUP
 20160120 17:01:54
 date last changed
 20180107 03:40:26
@inproceedings{f4fc71f5e906469294fb7a467835be08, abstract = {In this paper, we study the problem of drawing a given planar<br/><br> graph such that vertices are at prespecified points and the<br/><br> entire drawing is inside a given polygon. We give a method that shows that for<br/><br> an $n$vertex graph and a $k$sided polygon, $\Theta(kn^2)$ bends<br/><br> are always sufficient. We also give an example of a graph where <br/><br> $\Theta(kn^2)$ bends is necessary for such a drawing.}, author = {Biedl, Therese and Floderus, Peter}, booktitle = {Lecture Notes in Computer Science (Mathematical Foundations of Computer Science 2012)}, editor = {Rovan, Branislav and Sassone, Vladimiro and Widmayer, Peter}, isbn = {9783642325892}, issn = {03029743}, keyword = {Graph drawing,Specified point set,Bounding polygon}, language = {eng}, pages = {172183}, publisher = {Springer}, title = {Drawing Planar Graphs on Points Inside a Polygon}, url = {http://dx.doi.org/10.1007/9783642325892_18}, volume = {7464}, year = {2012}, }