Computational Geometry: An Introduction
Springer Science & Business Media, Dec 6, 2012 - Mathematics - 398 pages
From the reviews: "This book offers a coherent treatment, at the graduate textbook level, of the field that has come to be known in the last decade or so as computational geometry. ... ... The book is well organized and lucidly written; a timely contribution by two founders of the field. It clearly demonstrates that computational geometry in the plane is now a fairly well-understood branch of computer science and mathematics. It also points the way to the solution of the more challenging problems in dimensions higher than two." #Mathematical Reviews#1 "... This remarkable book is a comprehensive and systematic study on research results obtained especially in the last ten years. The very clear presentation concentrates on basic ideas, fundamental combinatorial structures, and crucial algorithmic techniques. The plenty of results is clever organized following these guidelines and within the framework of some detailed case studies. A large number of figures and examples also aid the understanding of the material. Therefore, it can be highly recommended as an early graduate text but it should prove also to be essential to researchers and professionals in applied fields of computer-aided design, computer graphics, and robotics." #Biometrical Journal#2
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
abscissae assume begin binary search boundary bridge CH(S chain component computational geometry consider construction contains contour convex hull algorithm convex polygon convex set coordinates corresponding d-dimensional data structure defined Delaunay triangulation deleted denote determined dimensions divide-and-conquer dominance edge elements end end Euclidean extreme points facet following theorem function geometric gift-wrapping given Graham scan half-planes half-space hyperplane insertion interior intersection interval linear linear programming lower bound maps method minimum spanning tree node Note number of vertices O(log O(NlogN obtain operations optimal pair partition performance planar graph plane point set pointers polyhedron polytope preprocessing problem procedure PSLG query queue range searching recursively refer to Figure region result scan Section segment tree sequence set of points simple polygon solve sorting space star-shaped polygon step storage subfacets subset subtree supporting lines sweep-line technique transformation trapezoid triangulation U-hull update vector vertex Voronoi diagram Voronoi polygon worst-case