Intersection and Decomposition Algorithms for Planar Arrangements
The feel-good place to buy books
Intersection and Decomposition Algorithms for Planar Arrangements by Pankaj K Agarwal
This book 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.
About the authors JANOS PACH is Professor of Computer Science at City College of New York and Senior Research Fellow at the Mathematical Institute of the Hungarian Academy of Sciences. He received his PhD in mathematics from Eotvos University, Budapest, in 1980 and has had visiting positions at various universities, including the University College of London, McGill University, the Courant Institute of New York University, and Tel Aviv University. He serves on the editorial boards of three mathematical and computer science journals and has been an invited speaker at many conferences. He has published more than one hundred research papers, mostly in discrete and computational geometry and in combinatorics. He received the Lester R. Ford Award in 1990 and the Renyi Prize in 1993. PANKAJ K. AGARWAL is Associate Professor in the Computer Science Department of Duke University. He received his PhD in computer science from the Courant Institute of Mathematical Sciences, New York University, in 1989. He is the author of Intersection and Decomposition Algorithms for Planar Arrangements, and a coauthor of Davenport--Schinzel Sequences and Their Geometric Applications. He has published several research papers and has given talks at many conferences. He was awarded the National Young Investigator Award in 1992.
| SKU | Unavailable |
| ISBN 13 | 9780521404464 |
| ISBN 10 | 0521404460 |
| Title | Intersection and Decomposition Algorithms for Planar Arrangements |
| Author | Pankaj K Agarwal |
| Condition | Unavailable |
| Binding Type | Hardback |
| Publisher | Cambridge University Press |
| Year published | 1991-04-26 |
| Number of pages | 294 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |