Intersection and Decomposition Algorithms for Planar Arrangements
No Customer Reviews
Select Format
Select Condition 
Book Overview
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.
Format:Paperback
Language:English
ISBN:0521168473
ISBN13:9780521168472
Release Date:August 2011
Publisher:Cambridge University Press
Length:296 Pages
Weight:0.96 lbs.
Dimensions:0.7" x 6.0" x 9.0"
Customer Reviews
0 rating
Copyright © 2025 Thriftbooks.com
Terms of Use | Privacy Policy | Do Not Sell/Share My Personal Information | Cookie Policy | Cookie Preferences | Accessibility Statement
ThriftBooks ® and the ThriftBooks ® logo are registered trademarks of Thrift Books Global, LLC
ThriftBooks ® and the ThriftBooks ® logo are registered trademarks of Thrift Books Global, LLC
