TY  - BOOK
AU  - Mark de Berg
AU  - Mark de Berg
TI  - Computational geometry:  : algorithms and applications
SN  - 9788184898750
U1  - 516.002 BER 
PY  - 2000///
CY  - Berlin ; New York 
PB  - : Springer
KW  - Geometry--Data processing
N1  - 	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
N2  - 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
ER  -