Items related to Intersection and Decomposition Algorithms for Planar...

Intersection and Decomposition Algorithms for Planar Arrangements - Softcover

Agarwal, Pankaj K.

 
9780521168472: Intersection and Decomposition Algorithms for Planar Arrangements
Softcover
ISBN 10: 0521168473 ISBN 13: 9780521168472
Publisher: Cambridge University Press, 2011

Synopsis

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.

"synopsis" may belong to another edition of this title.

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 1991 book presents a study of problems related to arrangements of lines or curves in the plane.

"About this title" may belong to another edition of this title.

Publisher
Cambridge University Press
Publication date
2011
Language
English
ISBN 10 
0521168473
ISBN 13 
9780521168472
Binding
Paperback
Edition number
1
Number of pages
296