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.
By:
Pankaj K. Agarwal (Duke University North Carolina) Imprint: Cambridge University Press Country of Publication: United Kingdom Dimensions:
Height: 238mm,
Width: 156mm,
Spine: 19mm
Weight: 556g ISBN:9780521404464 ISBN 10: 0521404460 Pages: 294 Publication Date:26 August 1991 Audience:
Professional and scholarly
,
Undergraduate
Format:Hardback Publisher's Status: Active