Intersection and Decomposition Algorithms for Planar Arrangements

Name: Intersection and Decomposition Algorithms for Planar Arrangements
Brand: Cambridge University Press
SKU: 9780521404464
Price: 824.91 RON
Availability: InStock

Autor: Pankaj K. Agarwal

Limbă:

Legare: Copertă tare

Editura: Cambridge University Press

Disponibilitate: În depozitul extern

Expediem în 9-15 zile

824.91 lei

Several geometric problems can be formulated in terms of the arrangement of a collection of curves i...

Informații despre carte

Autor

Pankaj K. Agarwal

Limbă

engleză

Legare

Carte - Copertă tare

Publicat

1991

Pagini

294

EAN

9780521404464

ISBN

0521404460

Enbook ID

02029781

Editura

Cambridge University Press

Greutate

556

Dimensiuni

156 x 238 x 19

Descriere completă

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.

S-ar putea să te intereseze

Clienții care au cumpărat această carte au mai cumpărat și

Cele mai căutate

Categories

Authors

Publishers

Produse

Produse

Cele mai căutate

Categories

Authors

Publishers

Produse

Produse

Intersection and Decomposition Algorithms for Planar Arrangements

Informații despre carte

Descriere completă

S-ar putea să te intereseze

Clienții care au cumpărat această carte au mai cumpărat și