or
Sign in to turn on 1-Click ordering.
or
Amazon Prime Free Trial required. Sign up when you check out. Learn More
More Buying Choices
Have one to sell? Sell yours here
Planar graph drawing (Lecture Notes Series on Computing)
 
 
Tell the Publisher!
I'd like to read this book on Kindle

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.

Planar graph drawing (Lecture Notes Series on Computing) [Paperback]

Takao Nishizeki (Author), Dr Md Saidur Rahman (Author)

Price: $99.00 & this item ships for FREE with Super Saver Shipping. Details
  Special Offers Available
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
In Stock.
Ships from and sold by Amazon.com. Gift-wrap available.
Want it delivered Monday, January 30? Choose One-Day Shipping at checkout. Details
Textbook Student FREE Two-Day Shipping for Students. Learn more


Book Description

9812560335 978-9812560339 September 23, 2004
The book presents the important fundamental theorems and algorithms on planar graph drawing with easy-to-understand and constructive proofs. Extensively illustrated and with exercises included at the end of each chapter, it is suitable for use in advanced undergraduate and graduate level courses on algorithms, graph theory, graph drawing, information visualization and computational geometry. The book will also serve as a useful reference source for researchers in the field of graph drawing and software developers in information visualization, VLSI design and CAD.

Special Offers and Product Promotions

  • Buy $50 in qualifying physical textbooks, get $5 in Amazon MP3 Credit. Here's how (restrictions apply)

Customers Who Bought This Item Also Bought


Product Details


More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews


There are no customer reviews yet.
Video reviews
Video reviews
Amazon now allows customers to upload product video reviews. Use a webcam or video camera to record and upload reviews to Amazon.



Inside This Book (learn more)
First Sentence:
A graph consists of a set of vertices and a set of edges, each joining two vertices. Read the first page
Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
critical separation pair, forbidden separation pair, triangulated plane graph, convex drawing, pertinent subtree, rectangular drawing, feasible octagon, prime separation pair, convex grid drawing, four outer vertices, plane cubic graph, orthogonal grid drawing, planar graph drawing, straight line grid drawing, outer convex polygon, slicing graph, three outer vertices, plane subgraph, same vertical grid line, facial cycle, orthogonal drawing, algorithms for drawing planar graphs, rectangular grid drawing, designated vertices, open halfline
Key Phrases - Capitalized Phrases (CAPs): (learn more)
Planar Graph Drawing, Bibliographic Notes, Algorithm Convex-Grid-Drawing, Algorithm Draw-Triangle, Algorithm Canonical-Ordering, Algorithm Orthogonal-Draw, Algorithm Realizer-Drawing, Process of Upward-Embed
New!
Books on Related Topics | Concordance | Text Stats
Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Search Inside This Book:




What Other Items Do Customers Buy After Viewing This Item?


Suggested Tags from Similar Products

 (What's this?)
Be the first one to add a relevant tag (keyword that's strongly related to this product).
 

Your tags: Add your first tag
 

Sell a Digital Version of This Book in the Kindle Store

If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store. Learn more

Customer Discussions

This product's forum
Discussion Replies Latest Post
No discussions yet

Ask questions, Share opinions, Gain insight
Start a new discussion
Topic:
First post:
Prompts for sign-in
 


Active discussions in related forums
Search Customer Discussions
Search all Amazon discussions
   
Related forums


Listmania!


Create a Listmania! list

So You'd Like to...


Create a guide


Look for Similar Items by Category


Look for Similar Items by Subject