0
Your cart

Your cart is empty

Books > Computing & IT > Applications of computing > Image processing

Buy Now

Algorithms in Combinatorial Geometry (Hardcover, 1987 ed.) Loot Price: R3,130
Discovery Miles 31 300
Algorithms in Combinatorial Geometry (Hardcover, 1987 ed.): Herbert Edelsbrunner

Algorithms in Combinatorial Geometry (Hardcover, 1987 ed.)

Herbert Edelsbrunner

Series: Monographs in Theoretical Computer Science. An EATCS Series, 10

 (sign in to rate)
Loot Price R3,130 Discovery Miles 31 300 | Repayment Terms: R293 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

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."

General

Imprint: Springer-Verlag
Country of origin: Germany
Series: Monographs in Theoretical Computer Science. An EATCS Series, 10
Release date: July 1987
First published: 1987
Authors: Herbert Edelsbrunner
Dimensions: 235 x 155 x 25mm (L x W x T)
Format: Hardcover
Pages: 423
Edition: 1987 ed.
ISBN-13: 978-3-540-13722-1
Categories: Books > Science & Mathematics > Mathematics > Combinatorics & graph theory
Books > Computing & IT > General theory of computing > Data structures
Books > Computing & IT > Computer programming > Algorithms & procedures
Books > Computing & IT > Applications of computing > Image processing > General
Promotions
LSN: 3-540-13722-X
Barcode: 9783540137221

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners