## Computational Geometry (1996)

Venue: | in optimization 2.5D and 3D NC surface machining. Computers in Industry |

Citations: | 9 - 0 self |

### BibTeX

@INPROCEEDINGS{Lee96computationalgeometry,

author = {D. T. Lee},

title = {Computational Geometry},

booktitle = {in optimization 2.5D and 3D NC surface machining. Computers in Industry},

year = {1996},

pages = {41--59},

publisher = {CRC Press}

}

### OpenURL

### Abstract

Introduction Computational geometry evolves from the classical discipline of design and analysis of algorithms, and has received a great deal of attention in the last two decades since its inception in 1975 by M. Shamos[108]. It is concerned with the computational complexity of geometric problems that arise in various disciplines such as pattern recognition, computer graphics, computer vision, robotics, VLSI layout, operations research, statistics, etc. In contrast with the classical approach to proving mathematical theorems about geometry-related problems, this discipline emphasizes the computational aspect of these problems and attempts to exploit the underlying geometric properties possible, e.g., the metric space, to derive efficient algorithmic solutions. The classical theorem, for instance, that a set S is convex if and only if for any 0 ff 1 the convex combination ffp + (1 \Gamma<F