: algorithms and applications Mark de Berg creator Mark de Berg text Berlin ; New York : Springer , ©2000 3rd Edition monographic eng

print

xii, 367 pages ; 25 cm An introduction to computational geometry, this is a textbook for high-level undergraduate and low-level graduate courses. Focusing on algorithms, it is useful for students in computer science and engineering. It uses modern insights in computational geometry to provide solutions. 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. /Mark de Berg Geometry--Data processing 516.002 BER 9788184898750 Variety Books Publishers Distributors ;B-10,Street No-2 ,West Vinod Nagar,Delhi-110092 191128 20200115123753.0