Intersection and decomposition algorithms for planar arrangements
著者
書誌事項
Intersection and decomposition algorithms for planar arrangements
Cambridge University Press, 1991
大学図書館所蔵 件 / 全20件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references (p. 259-271) and index
内容説明・目次
内容説明
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.
目次
- Introduction
- 1. Davenport-Schinzel sequences
- 2. Red-blue intersection detection algorithms
- 3. Partitioning arrangements of lines
- 4. Applications of the partitioning algorithm
- 5. Spanning trees with low stabbing number
- Bibliography
- Index of symbols
- Index of keywords.
「Nielsen BookData」 より