9783642648731-3642648738-Algorithms in Combinatorial Geometry (Monographs in Theoretical Computer Science. An EATCS Series, 10)

Algorithms in Combinatorial Geometry (Monographs in Theoretical Computer Science. An EATCS Series, 10)

ISBN-13: 9783642648731
ISBN-10: 3642648738
Edition: Softcover reprint of the original 1st ed. 1987
Author: Herbert Edelsbrunner
Publication date: 2011
Publisher: Springer
Format: Paperback 438 pages
FREE US shipping

Book details

ISBN-13: 9783642648731
ISBN-10: 3642648738
Edition: Softcover reprint of the original 1st ed. 1987
Author: Herbert Edelsbrunner
Publication date: 2011
Publisher: Springer
Format: Paperback 438 pages

Summary

Algorithms in Combinatorial Geometry (Monographs in Theoretical Computer Science. An EATCS Series, 10) (ISBN-13: 9783642648731 and ISBN-10: 3642648738), written by authors Herbert Edelsbrunner, was published by Springer in 2011. With an overall rating of 4.2 stars, it's a notable title among other Computer Science (Graphics & Design, Algorithms, Programming, Graphics & Multimedia, Software Design, Testing & Engineering) books. You can easily purchase or rent Algorithms in Combinatorial Geometry (Monographs in Theoretical Computer Science. An EATCS Series, 10) (Paperback) from BooksRun, along with many other new and used Computer Science books and textbooks. And, if you're looking to sell your copy, our current buyback offer is $0.43.

Description

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 strong connections of various kinds exist to questions studied in the considerably older field of combinatorial geometry. For example, the combinatorial structure of a geometric problem usually decides which algorithmic method solves the problem most efficiently. Furthermore, the analysis of an algorithm often requires a great deal of combinatorial knowledge. As it turns out, however, the connection between the two research areas commonly referred to as computa tional geometry and combinatorial geometry is not as lop-sided as it appears. Indeed, the interest in computational issues in geometry gives a new and con structive direction to the combinatorial study of geometry. It is the intention of this book to demonstrate that computational and com binatorial investigations in geometry are doomed to profit from each other. To reach this goal, I designed this book to consist of three parts, acorn binatorial part, a computational part, and one that presents applications of the results of the first two parts. The choice of the topics covered in this book was guided by my attempt to describe the most fundamental algorithms in computational geometry that have an interesting combinatorial structure. In this early stage geometric transforms played an important role as they reveal connections between seemingly unrelated problems and thus help to structure the field.
Rate this book Rate this book

We would LOVE it if you could help us and other readers by reviewing the book