Drawing Planar Graphs inside Simple Polygons: Algorithms and Complexity,Used

Drawing Planar Graphs inside Simple Polygons: Algorithms and Complexity,Used

In Stock
SKU: DADAX3838361725
Brand: LAP Lambert Academic Publishing
Condition: New
Regular price$115.19
Quantity
Add to wishlist
Add to compare

Sold by Ergodebooks, an authorized reseller.

Returns accepted within 30 days | support@ergodebooks.com

Verified
Shipping Information
  • Free Standard Shipping — United States only
  • Processing Time: 1–3 business days
  • Estimated Delivery: 3–5 business days after dispatch
  • Double-boxed, fully insured & discreetly packaged
  • Tracking number sent via email once dispatched
  • Orders over $250 require signature upon delivery. Taxes calculated at checkout.
Returns & Refund

Returns accepted within 30 days of delivery.

Damaged or Defective Item

Free return shipping + replacement or full refund

Wrong Item Received

Free return shipping + replacement or full refund

Change of Mind

Return shipping at customer's expense · 25% restocking fee applies

All returns require a Return Authorization (RA) number before sending.

To initiate a return, contact us:

support@ergodebooks.com +1 (281) 738-1050
View Full Return & Refund Policy
Payment Option
Payment Methods

Help

If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.

Customer service

All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com

Sale & Press

If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com

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 Ushaped 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.

⚠️ WARNING (California Proposition 65):

This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.

For more information, please visit www.P65Warnings.ca.gov.

Recently Viewed