The Stay-In Weather Sale: 20% off select books
Used, New, and Out of Print Books - We Buy and Sell - Powell's Books
Cart |
|  my account  |  wish list  |  help   |  800-878-7323
Hello, | Login
MENU
  • Browse
    • New Arrivals
    • Bestsellers
    • Award Winners
    • Signed Editions
    • Digital Audio Books
    • See All Subjects
  • Used
  • Staff Picks
    • Staff Picks
    • Picks of the Month
    • Book Club Subscriptions
    • 25 PNW Books to Read Before You Die
    • 25 Books From the 21st Century
    • 25 Memoirs to Read Before You Die
    • 25 Global Books to Read Before You Die
    • 25 Women to Read Before You Die
    • 25 Books to Read Before You Die
  • Gifts
    • Gift Cards & eGift Cards
    • Powell's Souvenirs
    • Read Rise Resist Gear
    • Journals & Notebooks
    • Games
    • Socks
  • Sell Books
  • Blog
  • Events
  • Find A Store
McAfee Secure

Don't Miss

  • Looking Forward Sale
  • The Stay-In Weather Sale
  • Indiespensable 90:
    My Year Abroad
  • Our 2021 TBR List
  • Powell's Virtual Events
  • Oregon Battle of the Books

Visit Our Stores


Emily B.: Black History Month 2021: Black Women in Science (0 comment)
The books below are a starting point for delving into the scientific legacy of Black women around the world and for inspiring the next generation to follow in their footsteps...
Read More»
  • Rhianna Walton: Black History Month 2021: Rethinking the Classics (0 comment)
  • Rachel Marks: No Bull, Just Books: Recommendations for the Year of the Ox (1 comment)

{1}
##LOC[OK]##
{1}
##LOC[OK]## ##LOC[Cancel]##
{1}
##LOC[OK]## ##LOC[Cancel]##

Intersection and Decomposition Algorithms for Planar Arrangements

by Pankaj K. Agarwal
Intersection and Decomposition Algorithms for Planar Arrangements

  • Comment on this title
  • Synopses & Reviews

ISBN13: 9780521168472
ISBN10: 0521168473



All Product Details

View Larger ImageView Larger Images
$41.95
New Trade Paperback
Ships in 1 to 3 days
Add to Cart
Add to Wishlist
QtyStore
20Remote Warehouse

Synopses & Reviews

Publisher Comments

This book presents a study of various problems related to arrangements of lines, segments, or curves in the plane. The first problem is a proof of almost tight bounds on the length of (n, s)-Davenport-Schinzel sequences, a technique for obtaining optimal bounds for numerous algorithmic problems. Then the intersection problem is treated. The final problem is improving the efficiency of partitioning algorithms, particularly those used to construct spanning trees with low stabbing numbers, a very versatile tool in solving geometric problems. A number of applications are also discussed.

What Our Readers Are Saying

Be the first to share your thoughts on this title!




Product Details

ISBN:
9780521168472
Binding:
Trade Paperback
Publication date:
04/01/2011
Publisher:
Cambridge University Press
Language:
English
Pages:
296
Height:
.67IN
Width:
6.00IN
Number of Units:
1
UPC Code:
4294967295
Author:
Pankaj K. Agarwal
Subject:
Mathematics-Geometry and Trigonometry

Ships free on qualified orders.
Add to Cart
$41.95
New Trade Paperback
Ships in 1 to 3 days
Add to Wishlist
QtyStore
20Remote Warehouse
Used Book Alert for book Receive an email when this ISBN is available used.

This title in other editions

  • New, Hardcover, $141.95
{1}
##LOC[OK]##
{1}
##LOC[OK]## ##LOC[Cancel]##
{1}
##LOC[OK]## ##LOC[Cancel]##
{1}
##LOC[OK]##
{1}
##LOC[OK]## ##LOC[Cancel]##
{1}
##LOC[OK]## ##LOC[Cancel]##
{1}
##LOC[OK]##
{1}
##LOC[OK]## ##LOC[Cancel]##
{1}
##LOC[OK]## ##LOC[Cancel]##
{1}
##LOC[OK]##
{1}
##LOC[OK]## ##LOC[Cancel]##
{1}
##LOC[OK]## ##LOC[Cancel]##
  • Twitter
  • Facebook
  • Pinterest
  • Instagram

  • Help
  • Guarantee
  • My Account
  • Careers
  • About Us
  • Security
  • Wish List
  • Partners
  • Contact Us
  • Shipping
  • Sitemap
  • © 2021 POWELLS.COM Terms

{1}
##LOC[OK]##
{1}
##LOC[OK]## ##LOC[Cancel]##
{1}
##LOC[OK]## ##LOC[Cancel]##
{1}
##LOC[OK]##
{1}
##LOC[OK]## ##LOC[Cancel]##
{1}
##LOC[OK]## ##LOC[Cancel]##
{1}
##LOC[OK]##
{1}
##LOC[OK]## ##LOC[Cancel]##
{1}
##LOC[OK]## ##LOC[Cancel]##
{1}
##LOC[OK]##
{1}
##LOC[OK]## ##LOC[Cancel]##
{1}
##LOC[OK]## ##LOC[Cancel]##