Intersection and Decomposition Algorithms for Planar Arrangements (Hardcover, New)

Several geometric problems can be formulated in terms of the arrangement of a collection of curves in a plane, which has made this one of the most widely studied topics in computational geometry. This book, first published in 1991, 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. Researchers in computational and combinatorial geometry should find much to interest them in this book.

General

Imprint:	Cambridge UniversityPress
Country of origin:	United Kingdom
Release date:	April 1991
First published:	1991
Authors:	Pankaj K. Agarwal
Dimensions:	238 x 156 x 19mm (L x W x T)
Format:	Hardcover
Pages:	294
Edition:	New
ISBN-13:	978-0-521-40446-4
Categories:	Books > Science & Mathematics > Mathematics > Combinatorics & graph theory Promotions
LSN:	0-521-40446-0
Barcode:	9780521404464

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!