Skip to main content
PBS logo
 
 

Search - Intersection and Decomposition Algorithms for Planar Arrangements

Intersection and Decomposition Algorithms for Planar Arrangements
Intersection and Decomposition Algorithms for Planar Arrangements
Author: Pankaj K. Agarwal
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 ...  more »
ISBN-13: 9780521404464
ISBN-10: 0521404460
Publication Date: 4/26/1991
Pages: 293
Rating:
  ?
0 stars, based on 0 rating
Publisher: Cambridge University Press
Book Type: Hardcover
Members Wishing: 0
Reviews: Amazon | Write a Review



Back to the Top ↑
By using this Web site, you confirm that you have read, understood, and agreed to be bound by the Terms of Use. As an Amazon Associate we earn from qualifying purchases.
US Patent Number 7,877,315 | Copyright © 2004 - 2024 PaperBackSwap.com. All Rights Reserved.