Computational geometry : an introduction
A fundamental task of computational geometry is identifying concepts, properties and techniques which help efficient algorithmic implementations for geometric problems. The approach taken here is the presentations of algorithms and the evaluation of their worst case complexity. The particular problems addressed include geometric searching and retrieval, convex hull construction and related problems, proximity, intersection and the geometry of rectangles
Print Book, English, ©1985
Springer-Verlag, New York, ©1985