Abstract
In this paper, we study a new problem of finding a convex drawing of graphs with a non-convex boundary. It is proved that every triconnected plane graph whose boundary is fixed with a star-shaped polygon admits a drawing in which every inner facial cycle is drawn as a convex polygon. Such a drawing, called an inner-convex drawing, can be obtained in linear time. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Hong, S. H., & Nagamochi, H. (2006). Convex drawings of graphs with non-convex boundary. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4271 LNCS, pp. 113–124). Springer Verlag. https://doi.org/10.1007/11917496_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
