株式会社極東書店トップ ＞ 商品一覧 ＞ Intersection and Decomposition Algorithms for Planar Arrangements.
商品詳細
Intersection and Decomposition Algorithms for Planar Arrangements.
・ISBN 978-0-521-40446-4 hard GB£ 120.00
￥38,016.- (税込) ※（※）価格はご注文時の参考価格となります。
納品価格につきましては書籍の入荷時点で確定となります。
版元の原価改定、外国為替の変動等により異なる場合がございますので、予めご了承下さい。
お気に入り
★★★
| 著者・編者 | Agarwal, Pankaj K., |
|---|---|
| 出版社 | (Cambridge University Press, UK) |
| 出版年月 | 1991 |
| ページ数 | 294 pp. |
| 言語 | ENG |
| ニュース番号 | ＜M25-9426＞ |
解説
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.