Computational geometry: an introduction
Computational geometry: an introduction
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Computational geometry in C
The algorithm design manual
| Hi-index | 0.00 |
Computational geometry is the study of algorithmic problems involving geometry. Although the ruler and compass constructions of ancient Greek geometry were essentially algorithms for producing geometric objects, modern computational geometry begins with M. I. Shamos's 1975 Ph.D. dissertation, which solved several fundamental geometric problems and posed many more. Since the 1980s, computational geometry has been perhaps the most active area of algorithms research, and a recent bibliography listsover 8,000 relevant publications. The explosive growth of this field can be traced to the intuitive appeal of geometric problems as well as the wide range of practical applications.