This 2005 book deals with interest topics in Discrete and Algorithmic aspects of Geometry.

A complete, self-contained introduction to a powerful and resurgingmathematical discipline . Combinatorial Geometry presents andexplains with complete proofs so

Computational geometry as an area of research in its own right emerged in the early seventies of this century. Right from the beginning, it was obvious that str

LEDA is a library of efficient data types and algorithms and a platform for combinatorial and geometric computing on which application programs can be built. In

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 com