Computational geometry. An introduction

From MaRDI portal





This is the second printing (death-line in 1988) of a central and excellent book on computational geometry [first printing in 1985 by \textit{F. P. Preparata} and \textit{M. I. Shamos}, Text and monographs in computer science, New York, Springer-Verlag (1985; Zbl 0575.68059)]. Minor errors are corrected and additional comments are given. Also some new topics are discussed. Among others this are the following: The bridged chain method in geometric searching (optimal techniques), iterated search and fractional cascading, an expanded discussion of fractional cascading, and the linear-time construction of the Voronoi diagram of a convex polygon. In the meantime several other open questions have been solved, for instance optimal triangulation, so further work will be necessary to give an up-to-date third printing. Some new papers are added in the list of references.




Cited in
(only showing first 100 items - show all)








This page was built for publication: Computational geometry. An introduction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3992847)