Name: Intersection and Decomposition Algorithms for Planar Arrangements
SKU: 19188604
Price: 6125.00 TWD
Availability: InStock
Author: Agarwal

Select your country

Americas

Europe

Rest of the world

portada Intersection and Decomposition Algorithms for Planar Arrangements

Intersection and Decomposition Algorithms for Planar Arrangements

Type

Physical Book

Publisher

Cambridge University Press

Author

Agarwal

Year

1991

Language

English

Pages

294

Format

Hardcover

ISBN

0521404460

ISBN13

9780521404464

Edition No.

Synopsis "Intersection and Decomposition Algorithms for Planar Arrangements "

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.

Customers reviews

Have you read this book? Login to add your review.

More customer reviews

0% (0)
0% (0)
0% (0)
0% (0)
0% (0)

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews

Intersection and Decomposition Algorithms for Planar Arrangements - Agarwal

Synopsis "Intersection and Decomposition Algorithms for Planar Arrangements "

Customers reviews

Frequently Asked Questions about the Book

Is the book original?

In what language is the book written?

What is the format of this book?

Questions and Answers about the Book

Opinions about Bookdelivery