Computational Geometry is an area that provides solutions to geometric problems which arise in applications including Geographic Information Systems, Robotics and Computer Graphics. This Handbook provides an overview of key concepts and results in Computational Geometry. It may serve as a reference and study guide to the field. Not only the most advanced methods or solutions are described, but also many alternate ways of looking at problems and how to solve them.
FREE Two-Day Shipping for students on millions of items. Learn more |
| |||||||||||||||
Book Description
Editorial Reviews
Review
H.-D. Hecker
The Handbook gives an excellent overview of the central topics of both classic and new lines of computational geometry.......The authors of the chapters are without exception excellent specialists in the topic discussed. This Handbook discusses fundamentals and the most interesting applications.
Mathematical Reviews
The Handbook gives an excellent overview of the central topics of both classic and new lines of computational geometry.......The authors of the chapters are without exception excellent specialists in the topic discussed. This Handbook discusses fundamentals and the most interesting applications.
Mathematical Reviews
Product Details
Would you like to update product info or give feedback on images?
|
More About the Authors
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)
Key Phrases - Statistically Improbable Phrases (SIPs):
(learn more)
spatial databases, combinatorial geometry, computational morphology, graph visualization, parallel random access machine, link distance problems, approach using randomization, amortized time per insertion, robber route problem, link distance queries, recognizing visibility graphs, good grid size, link path queries, dominance counting problem, geodesic distance problems, complete visibility polygon, fair split tree, feasible trapezoids, vertex floodlights, shortest link path, watchman route problem, link distance query, staircase visibility, sublogarithmic algorithms, partitioning orthogonal polygons Key Phrases - Capitalized Phrases (CAPs): (learn more)
Discrete Comput, Lecture Notes, Technical Report, New York, Discrete Algorithms, Graph Drawing, International Conference, Theory Comput, International Symposium, Foundations of Computer Science, Spatial Data Handling, Discrete Math, Elsevier Science, Theory of Computing, Art Gallery, Management of Data, Theory Ser, Boca Raton, Methods Eng, Workshop Algorithms Data Struct, Urrutia Fig, Academic Press, Control Comput, Canadian Conference, Very Large Data Bases Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Surprise Me!
spatial databases, combinatorial geometry, computational morphology, graph visualization, parallel random access machine, link distance problems, approach using randomization, amortized time per insertion, robber route problem, link distance queries, recognizing visibility graphs, good grid size, link path queries, dominance counting problem, geodesic distance problems, complete visibility polygon, fair split tree, feasible trapezoids, vertex floodlights, shortest link path, watchman route problem, link distance query, staircase visibility, sublogarithmic algorithms, partitioning orthogonal polygons Key Phrases - Capitalized Phrases (CAPs): (learn more)
Discrete Comput, Lecture Notes, Technical Report, New York, Discrete Algorithms, Graph Drawing, International Conference, Theory Comput, International Symposium, Foundations of Computer Science, Spatial Data Handling, Discrete Math, Elsevier Science, Theory of Computing, Art Gallery, Management of Data, Theory Ser, Boca Raton, Methods Eng, Workshop Algorithms Data Struct, Urrutia Fig, Academic Press, Control Comput, Canadian Conference, Very Large Data Bases Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Surprise Me!
Citations (learn more)
53
books
cite this book:
See all 53 books citing this book
- Lectures on Discrete Geometry (Graduate Texts in Mathematics) by Matousek, Jiri on 4 pages
- Algorithms - ESA 2001: 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings (Lecture Notes in Computer Science) by Friedhelm Meyer auf der Heide on 4 pages
- LATIN 2006: Theoretical Informatics: 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings (Lecture Notes in Computer Science / Theoretical Computer Science and General Issues) by José R. Correa on 4 pages
- Discrete and Computational Geometry: The Goodman-Pollack Festschrift (Algorithms and Combinatorics) by Boris Aronov on 4 pages
- Geometric Spanner Networks by Giri Narasimhan in Back Matter (1), Back Matter (2), and Back Matter (3)
See all 53 books citing this book
Suggested Tags from Similar Products(What's this?)Be the first one to add a relevant tag (keyword that's strongly related to this product).
|
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
|
