Textbook Discounter: Computer: Intersection and Decomposition Algorithms for Planar Arrangements

StudentUniverse.com - Travel More. Spend Less

Intersection and Decomposition Algorithms for Planar Arrangements
	Author: Pankaj K. Agarwal Publisher: Cambridge University Press Category: Book List Price: ~~$95.00~~ Buy New: $14.40 You Save: $80.60 (85%) New (6) Used (18) from $7.95 Sales Rank: 2832026 Media: Hardcover Pages: 293 Number Of Items: 1 Shipping Weight (lbs): 1.2 Dimensions (in): 9.1 x 6.1 x 0.8 ISBN: 0521404460 Dewey Decimal Number: 516.13 EAN: 9780521404464 ASIN: 0521404460 Publication Date: April 26, 1991 Availability: Usually ships in 1-2 business days Shipping: Expedited shipping available Condition: New. 1.0 x 6.5 x 9.5 inches. Still in shrinkwrap.


Editorial Reviews: Product Description 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. Book Description Several geometric problems can be formulated in terms of the arrangements of a collection of curves in a plane, making this one of the most widely studied topics in computational geometry. This book presents a study of problems related to arrangements of lines or curves in the plane.