A Linear Algorithm for Convex Drawing of a Planar Graph
Keywords:
Planar graph, convex drawing, linear algorithm
Abstract
A straight line drawing of a planar graph is called a convex drawing if the boundaries of all faces of that graph are drawn as convex polygon. A graph is planar if it has at least one embedding in the plane such that no two edges intersect at any point except at their common end vertex. Not all planar graphs have convex drawing. In this thesis, we study the characteristics of convex drawing of a planar graph. We develop a method for examining whether a face is drawn as a convex polygon or not. Finally, using that method we develop a linear algorithm for examining whether a planar graph has a convex drawing or not.
Downloads
- Article PDF
- TEI XML Kaleidoscope (download in zip)* (Beta by AI)
- Lens* NISO JATS XML (Beta by AI)
- HTML Kaleidoscope* (Beta by AI)
- DBK XML Kaleidoscope (download in zip)* (Beta by AI)
- LaTeX pdf Kaleidoscope* (Beta by AI)
- EPUB Kaleidoscope* (Beta by AI)
- MD Kaleidoscope* (Beta by AI)
- FO Kaleidoscope* (Beta by AI)
- BIB Kaleidoscope* (Beta by AI)
- LaTeX Kaleidoscope* (Beta by AI)
How to Cite
Published
2012-03-15
Issue
Section
License
Copyright (c) 2012 Authors and Global Journals Private Limited
This work is licensed under a Creative Commons Attribution 4.0 International License.