Algorithms in Combinatorial Geometry

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

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.

Author(s): Herbert Edelsbrunner
Series: EATCS Monographs in Theoretical Computer Science, Volume 10
Publisher: Springer
Year: 1987

Language: English
Pages: 424