A Linear Algorithm for Convex Drawing of a Planar Graph

§ Chittagong University of Engineering & Technology, B...

Send Message

To: Author

A Linear Algorithm for Convex Drawing of a Planar Graph

Article Fingerprint

ReserarchID

CST88663

A Linear Algorithm for Convex Drawing of a Planar Graph Banner

Key Research Insights

Synthesized scholarly intelligence & interactive research assistant
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu
Reading Preferences
Font Size
Line Spacing
Background

References

7 Cites in Article
  1. Shaidur Md,Takao Rahman,Nishizeki Planar Graph Drawing.
  2. A Habib,M Rahman (2007). 1-bend orthogonal drawing from tri-connected planar 4graph.
  3. Mia Arefin (2008). which crossing number is it anyway? , On the minimum ranking edge tree problem series parallei graph.
  4. M Gray,D Johnson (1983). Crossing number is NP-complete.
  5. W Tutte (1960). Convex Representations of Graphs.
  6. W Tutte (1963). How to draw a graph.
  7. R Lipton,D Rose,R Tarjan (1979). Generalized nested dissections.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

Dr. Thanvir Ahmad. 2012. "A Linear Algorithm for Convex Drawing of a Planar Graph". Global Journal of Computer Science and Technology - F: Graphics & Vision GJCST-F Volume 12 (GJCST Volume 12 Issue F13).

Download Citation

Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Keywords
Classification
GJCST-F Classification I.4.7
Version of record

v1.2

Issue date
October 22, 2012

Language
English
Experiance in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

Article Matrices
Total Views: 2K
Total Downloads: 122
All Trends

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

A Linear Algorithm for Convex Drawing of a Planar Graph

Dr. Ahmad
Dr. Ahmad Chittagong University of Engineering & Technology, Bangladesh.