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.
FREE Two-Day Shipping for students on millions of items. Learn more |
| |||||||||||||||
Book Description
Special Offers and Product Promotions
- Buy $50 in qualifying physical textbooks, get $5 in Amazon MP3 Credit. Here's how (restrictions apply)
Editorial Reviews
Book Description
Several geometric problems can be formulated in terms of the arrangements of a collection of curves in a plane, making this one of the most widely studied topics in computational geometry. This 1991 book presents a study of problems related to arrangements of lines or curves in the plane.
Product Details
Would you like to update product info or give feedback on images?
|
More About the Author
Discover books, learn about writers, read author blogs, and more.
Customer Reviews
|
There are no customer reviews yet.
|
|||
|
Video reviews
|
Inside This Book
(learn more)
First Sentence:
Computational geometry emerged as a scientific discipline about fifteen years ago. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
low stabbing number, counting segment intersections, implicit point location, polygon containment problem, preprocessing version, computing many faces, pseudo edges, intersection detection problem, batched version, ray shooting problem, surface removal problem, leftmost intersection point, range query problem, canonical motion, approximate leveling, range search problem, query triangle, algebraic arcs, point location problem, ray shooting queries, simplex range searching, point location queries, spanning path, preprocessing time, unbounded face Key Phrases - Capitalized Phrases (CAPs): (learn more)
Davenport Schinzel, Recently Matousek New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Computational geometry emerged as a scientific discipline about fifteen years ago. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
low stabbing number, counting segment intersections, implicit point location, polygon containment problem, preprocessing version, computing many faces, pseudo edges, intersection detection problem, batched version, ray shooting problem, surface removal problem, leftmost intersection point, range query problem, canonical motion, approximate leveling, range search problem, query triangle, algebraic arcs, point location problem, ray shooting queries, simplex range searching, point location queries, spanning path, preprocessing time, unbounded face Key Phrases - Capitalized Phrases (CAPs): (learn more)
Davenport Schinzel, Recently Matousek New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Citations (learn more)
This book cites 5
books:
7
books
cite this book:
See all 7 books citing this book
- Computational Geometry: Algorithms and Applications, Second Edition by Mark de Berg in Back Matter (1), and Back Matter (2)
- Algorithms in Combinatorial Geometry (Eatcs Monographs on Theoretical Computer Science) by H. Edelsbrunner in Back Matter
- Computational Geometry: An Introduction (Monographs in Computer Science) by Franco P. Preparata in Back Matter
- Book of Curves by E. H. Lockwood in Back Matter
- Combinatorial Geometry by J?nos Pach in Back Matter
- Algorithmic Geometry by Jean-Daniel Boissonnat in Back Matter
- Geometric Spanner Networks by Giri Narasimhan in Back Matter
- Encyclopedia of Computer Science and Technology by Allen Kent on page 114
- Graph Drawing: 6th International Symposium, GD '98 Montreal, Canada, August 13-15, 1998 Proceedings (Lecture Notes in Computer Science) (v. 1547) by Sue H. Whitesides on page 222
- Graph Drawing: 5th International Symposium, GD '97, Rome, Italy, September 18-20, 1997. Proceedings (Lecture Notes in Computer Science) by Giuseppe DiBattista on page 97
See all 7 books citing this book
Books on Related Topics
(learn more)
|
Tag this product(What's this?)Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items. |
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
