This book demonstrates that classical problems of computational geometry can be solved when the input and output data are on surfaces other than the plane, but that planar techniques cannot always be adapted successfully, and new techniques must be considered. Well-known problems from computational geometry are adapted to cases where the objects are on surfaces, and an attempt is made to answer questions that arise in the growing list of areas in which the results of computational geometry are applicable. These areas are, among others, engineering, computer aided design, manufacturing, geographic information systems, operations research, robotics, computer graphics, and solid modelling. Audience: This volume will be of interest to postgraduate students and researchers whose work involves computational geometry, algorithms, combinatorics, and graph theory.
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)
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:
Since the main subject of this book is Computational Geometry, it seems necessary to cite some classical texts on this discipline which constitute basic reference works on the objectives and methods used here: amongst them we can cite several titles such as: Computational Geometry [Preparata and Shamos, 1985], Computational Geometry in C [O'Rourke, 1994] and Algorithms in Combinatorial Geometry [Edels-brunner, 1987]. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
essential polygon, planar convex hull algorithm, upper polygon, planar algorithms, dividing chain, equatorial arc, enclosing polygon, map ant, lower polygon, extreme vertex, diagonal flips, convex vertex, infinite copies, planar methods, central copy, unbounded face, extreme vertices, two triangulations, antipodal pair, flat torus, proximity problems, shortest geodesic, voronoi diagrams, planar representation, computational geometry Key Phrases - Capitalized Phrases (CAPs): (learn more)
Computational Geometry, Operations Research New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Since the main subject of this book is Computational Geometry, it seems necessary to cite some classical texts on this discipline which constitute basic reference works on the objectives and methods used here: amongst them we can cite several titles such as: Computational Geometry [Preparata and Shamos, 1985], Computational Geometry in C [O'Rourke, 1994] and Algorithms in Combinatorial Geometry [Edels-brunner, 1987]. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
essential polygon, planar convex hull algorithm, upper polygon, planar algorithms, dividing chain, equatorial arc, enclosing polygon, map ant, lower polygon, extreme vertex, diagonal flips, convex vertex, infinite copies, planar methods, central copy, unbounded face, extreme vertices, two triangulations, antipodal pair, flat torus, proximity problems, shortest geodesic, voronoi diagrams, planar representation, computational geometry Key Phrases - Capitalized Phrases (CAPs): (learn more)
Computational Geometry, Operations Research 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 12
books:
See all 12 books this book cites
- Computational Geometry: Algorithms and Applications, Second Edition by Mark de Berg on 4 pages
- Handbook of Discrete and Computational Geometry, Second Edition (Discrete Mathematics and Its Applications) by Jacob E. Goodman in Back Matter (1), and Back Matter (2)
- Algorithmic Geometry by Jean-Daniel Boissonnat in Back Matter
- Mathematical Ecology by E. C. Pielou in Back Matter
- An Analysis of the Finite Element Method by William Gilbert Strang in Back Matter
See all 12 books this book cites
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
|
Listmania!
So You'd Like to...
Look for Similar Items by Category
- Books > Computers & Technology > Programming > Algorithms
- Books > Computers & Technology > Programming > Graphics & Multimedia
- Books > Education & Reference > Education
- Books > New & Used Textbooks > Computer Science > Algorithms
- Books > New & Used Textbooks > Computer Science > Graphics & Visualization
- Books > New & Used Textbooks > Computer Science > Programming Languages
- Books > New & Used Textbooks > Science & Mathematics > Mathematics > Geometry
- Books > Science & Math > Mathematics
