Items related to Computational Geometry: Algorithms and Applications

Computational Geometry: Algorithms and Applications - Softcover

 
9783662042465: Computational Geometry: Algorithms and Applications

This specific ISBN edition is currently not available.

Synopsis

Computational Geometry: Introduction.- Line Segment Intersection: Thematic Map Overlay.- Polygon Triangulation: Guarding an Art Gallery.- Linear Programming: Manufacturing with Molds.- Orthogonal Range Searching: Querying a Database.- Point Location: Knowing Where You Are.- Voronoi Diagrams: The Post Office Problem.- Arrangements and Duality: Supersampling in Ray Tracing.- Delaunay Triangulations: Height Interpolation.- More Geometric Data Structures: Windowing.- Convex Hulls: Mixing Things.- Binary Space Partitions: The Painter's Algorithm.- Robot Motion Planning: Getting Where You Want to Be.- Quadtrees: Non-Uniform Mesh Generation.- Visibility Graphs: Finding the Shortest Route.- Simplex Range Searching: Windowing Revisited.- Bibliography.- Index.

"synopsis" may belong to another edition of this title.

  • PublisherSpringer
  • Publication date2014
  • ISBN 10 3662042460
  • ISBN 13 9783662042465
  • BindingPaperback
  • LanguageEnglish
  • Number of pages384

(No Available Copies)

Search Books:



Create a Want

Can't find the book you're looking for? We'll keep searching for you. If one of our booksellers adds it to AbeBooks, we'll let you know!

Create a Want

Other Popular Editions of the Same Title

9783540612704: Computational Geometry: Algorithms and Applications

Featured Edition

ISBN 10:  354061270X ISBN 13:  9783540612704
Publisher: Springer, 1997
Hardcover