000			01787nam a22002297a 4500
999			_c56019 _d56019
005			20200115123753.0
008			191128b ||||| |||| 00| 0 eng d
020			_a9788184898750
028			_aVariety Books Publishers Distributors _b;B-10,Street No-2 ,West Vinod Nagar,Delhi-110092 _c;IM2632 _d;25/11/2019
082			_a516.002 BER
100			_aMark de Berg
245			_aComputational geometry _b : algorithms and applications _c/Mark de Berg
250			_a3rd Edition
260			_aBerlin ; New York _b: Springer _c, ©2000.
300			_axii, 367 pages _c ; 25 cm
365			_b1390
505			_a 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.
520			_aAn 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.
650			_aGeometry--Data processing
700			_aMark de Berg
942			_cBOOK