Book: Computational Geometry, An Introduction by Franco P. Preparata, Michael Ian Shamos (1985)
Product description: A fundamental task of computational geometry is identifying concepts, properties, and techniques which aid efficient algorithmic implementations from geometric problems. The approach taken here is the presentation of algorithms and the evaluation of their worst-case complexity. The particular classes of problems addressed include geometric searching and retrieval, convex hull construction and related problems, proximity, intersection, and the geometry of rectangles. Computational Geometry: An Introduction presents its methodology through detailed case studies. The book, primarily conceived as an early graduate text, should also be essential to researchers and professionals in the fields of computer-aided design, computer graphics and robotics.
This book was for many years the standard textbook in computational geometry.
Computational geometry is a branch of computer science devoted to the study of algorithms which can be stated in terms of geometry. Some purely geometrical problems arise out of the study of computational geometric algorithms, and such problems are also considered to be part of computational geometry.
The main impetus for the development of computational geometry as a discipline was progress in computer graphics and computer-aided design and manufacturing (CAD/CAM), but many problems in computational geometry are classical in nature, and may come from mathematical visualization.
Wikipedia, Computational geometry.
Graphic organizers are visual
representations of knowledge, concepts or ideas.
To see a note, hover over a note button
To scroll the mindmap above, click and drag the map's background and move
it around , or click on background and use the arrow keys.
link to another page, click a link button
To Fold/Unfold a node, click the node
or right click a Node and select Fold/Unfold all from Node.
in or CTRL '+',
out or CTRL '-', Reset
(center), Shadow On/