Articles liés à Drawing Planar Graphs inside Simple Polygons: Algorithms...

Drawing Planar Graphs inside Simple Polygons: Algorithms and Complexity - Couverture souple

Bagheri, Alireza; Razzazi, Mohammadreza

 
9783838361727: Drawing Planar Graphs inside Simple Polygons: Algorithms and Complexity
Couverture souple
ISBN 10 : 3838361725 ISBN 13 : 9783838361727
Editeur : LAP LAMBERT Academic Publishing, 2010

Synopsis

Graphs are known structures with many applications in various fields including computer science and information visualization. Drawing graphs makes understanding the meaning of graphs easy by geometrically representation of them. Many graph drawing algorithms have been presented in the literature. Most of them draw graphs on an unbounded surface. However, there are applications in which it is required to draw graphs on a prescribed size area. For example, consider a VLSI circuit which should be designed on a U-shaped PCB with prescribed size, or consider a software in which one would like to show a graph on a prescribed size area. In this book, we examine the complexity of this problem, and introduce new algorithms for drawing planar graphs on 2D surfaces which are bounded by simple polygons. The content of this book is suitable for use in advanced undergraduate and graduate level courses on algorithms, graph drawing, information visualization and computational geometry. The book will also serve as a useful reference for researchers and software developers in the field of graph drawing, information visualization, VLSI design and CAD.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Présentation de l'éditeur

Graphs are known structures with many applications in various fields including computer science and information visualization. Drawing graphs makes understanding the meaning of graphs easy by geometrically representation of them. Many graph drawing algorithms have been presented in the literature. Most of them draw graphs on an unbounded surface. However, there are applications in which it is required to draw graphs on a prescribed size area. For example, consider a VLSI circuit which should be designed on a U-shaped PCB with prescribed size, or consider a software in which one would like to show a graph on a prescribed size area. In this book, we examine the complexity of this problem, and introduce new algorithms for drawing planar graphs on 2D surfaces which are bounded by simple polygons. The content of this book is suitable for use in advanced undergraduate and graduate level courses on algorithms, graph drawing, information visualization and computational geometry. The book will also serve as a useful reference for researchers and software developers in the field of graph drawing, information visualization, VLSI design and CAD.

Biographie de l'auteur

Alireza Bagheri received the PhD degree in comp. eng. from Amirkabir Univ. of Tech. at Tehran. Currently he is an assistant prof. at Amirkabir Univ. of Technology. Mohammadreza Razzazi received the PhD degree in comp. scinece from the Univ. of California, Santa Barbara. Currently he is an associate prof. at Amirkabir Univ. of Technology.

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Éditeur
LAP LAMBERT Academic Publishing
Date d'édition
2010
Langue
anglais
ISBN 10 
3838361725
ISBN 13 
9783838361727
Reliure
Broché
Nombre de pages
180
Coordonnées du fabricant
non disponible
Personne responsable
KreGa Onlinehandel GmbH
4950000000000
info@krega-onlinehandel.de

Birkenweg 31
Brakel
33034
Allemagne