Happy Holidays! Over 120,000 eBooks at just 19.99 each— Pick a favorite today

Monographs in Theoretical Computer Science. An EATCS Series

Algorithms in Combinatorial Geometry

Authors: Edelsbrunner, Herbert

Buy this book

eBook $139.00
price for USA (gross)
  • ISBN 978-3-642-61568-9
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $179.00
price for USA
  • ISBN 978-3-540-13722-1
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $179.00
price for USA
  • ISBN 978-3-642-64873-1
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this Textbook

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.

Table of contents (15 chapters)

Buy this book

eBook $139.00
price for USA (gross)
  • ISBN 978-3-642-61568-9
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $179.00
price for USA
  • ISBN 978-3-540-13722-1
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $179.00
price for USA
  • ISBN 978-3-642-64873-1
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Algorithms in Combinatorial Geometry
Authors
Series Title
Monographs in Theoretical Computer Science. An EATCS Series
Series Volume
10
Copyright
1987
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-642-61568-9
DOI
10.1007/978-3-642-61568-9
Hardcover ISBN
978-3-540-13722-1
Softcover ISBN
978-3-642-64873-1
Series ISSN
1431-2654
Edition Number
1
Number of Pages
XV, 423
Topics