Kontakt
Ako nakupovať
Doručenie
Nákupný poradca
Intersection and Decomposition Algorithms for Planar Arrangements
Angličtina
115 b
30 dní na vrátenie tovaru
Zákazníci tiež kúpili
/
Brožovaná
22.91
€
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.
Informácie o knihe
Angličtina
Kategórie
Darujte túto knihu ešte dnes
Je to jednoduché
1 Pridajte knihu do košíka a vyberte možnosť doručiť ako darček 2 Obratom Vám zašleme poukaz 3 Knihu zašleme na adresu obdarovanéhoMohlo by vás tiež zaujímať
/
Brožovaná
14.93
€
/
Brožovaná
9.78
€
/
Brožovaná
9.78
€
/
Brožovaná
23.42
€
Ahoj! Som Libroamiko, tvoj knižný radca.
Ako ti môžem pomôcť?