- Home
-
Board
- Editorial Board
- Apply For Reviewer
-
Research Publishing Standards
- Guidelines
- Peer Review Policy
- Short Guide to New Editors
- Retraction Guidelines
- Research Institute
- Recommendations for the Board of Directors
- Editor Research Audit and Service Assessments
- Guidelines for Journals Publishers
- Code of Conduct for Journal Publishers
- Commandment in Social Media
- Suggestions
- Authorship Disputes
- Rights and Responsibilities
- Editors Home
- Visibility
- Information
- Apply for Editorial
- About
- Call for Paper
- Research Community
-
Journals
- Computer Science
-
Medical Research
- A: Neurology & Nervous System
- B: Pharma, Drug Discovery, Toxicology & Medicine
- C: Microbiology & Pathology
- D: Radiology, Diagnostic Imaging and Instrumentation
- E: Gynecology & Obstetrics
- F: Diseasescancer, ophthalmology & pediatric
- G: Veterinary Science & Veterinary Medicine
- H: Orthopedic & Musculoskeletal System
- I: Surgeries & Cardiovascular System
- J: Dentistry & Otolaryngology
- K: Interdisciplinary
- L:Nutrition and Food Science
- Engineering
- Science Frontier Research
- Management
-
Human-Social Science
- A: Arts & Humanities psychology, public administration, library sciences, sports, arts, media, music
- B: Geography, Environmental Science & Disaster Management
- C: Sociology & Culture
- D: History, Archaeology & Anthropology
- E: Economics
- F: Political Science
- G: Linguistics & Education
- H: Interdisciplinary
-
Fellow
-
Support
Account
×
A Linear Algorithm for Convex Drawing of a Planar Graph
Dr. Thanvir Ahmad, Md. Shahidul Islam
Volume 12 Issue 13
Global Journal of Computer Science and Technology
Volume 12 Issue 13
Global Journal of Computer Science and Technology
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.
