Algorithms in Combinatorial Geometry
- 423 Seiten
- 15 Lesestunden
This book offers a modern approach to computational geometry, an area that studies the computational complexity of geometric problems. Combinatorial investigations play an important role in this study.
