Contact
Comment faire ses achats
Livraison
Guide d'achat
Intersection and Decomposition Algorithms for Planar Arrangements
Anglais
127 b
Livraison à Autriche
Jusqu'à 30 jours pour les retours
Les clients ont également acheté
/
Livre de poche
23.69
€
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.
À propos du livre
Anglais
Offrez ce livre dès aujourd'hui
C’est simple
1 Ajouter au panier et choisir l'option Livrer comme cadeau à la caisse. 2 Nous vous enverrons un bon d'achat 3 Le livre arrivera à l'adresse du destinataireCeci pourrait également vous intéresser
/
Livre de poche
29.89
€
/
Livre de poche
16.39
€
/
Livre de poche
10.69
€
/
Livre de poche
10.69
€
Bonjour ! Je suis Libroamiko, votre conseiller littéraire.
Comment puis-je vous aider ?