Recently Viewed

New

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

No reviews yet Write a Review
RRP: £36.99
Booksplease Price: £33.88
Booksplease saves you 8%

  Bookmarks: Included free with every order
  Delivery: We ship to over 200 countries from the UK
  Range: Millions of books available
  Reviews: Booksplease rated "Excellent" on Trustpilot

  FREE UK DELIVERY: When You Buy 3 or More Books - Use code: FREEUKDELIVERY in your cart!

SKU:
9780521168472
MPN:
9780521168472
Available from Booksplease!
Global delivery available
Global delivery available
Global delivery available
Global delivery available
Global delivery available
Availability: Usually dispatched within 4 working days

Frequently Bought Together:

Total: Inc. VAT
Total: Ex. VAT

Description

Several geometric problems can be formulated in terms of the arrangement of a collection of curves in a plane, which has made this one of the most widely studied topics in computational geometry. This book, first published in 1991, 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. Researchers in computational and combinatorial geometry should find much to interest them in this book.

Book Information
ISBN 9780521168472
Author Pankaj K. Agarwal
Format Paperback
Page Count 296
Imprint Cambridge University Press
Publisher Cambridge University Press
Weight(grams) 440g

Reviews

No reviews yet Write a Review

Booksplease  Reviews