---
_id: '3900'
abstract:
- lang: eng
  text: 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.
alternative_title:
- EATCS monographs on theoretical computer science
article_processing_charge: No
author:
- first_name: Herbert
  full_name: Edelsbrunner, Herbert
  id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
  last_name: Edelsbrunner
  orcid: 0000-0002-9823-6833
citation:
  ama: 'Edelsbrunner H. <i>Algorithms in Combinatorial Geometry</i>. Vol 10. Berlin ;
    Heidelberg: Springer; 1987. doi:<a href="https://doi.org/10.1007/978-3-642-61568-9">10.1007/978-3-642-61568-9</a>'
  apa: 'Edelsbrunner, H. (1987). <i>Algorithms in Combinatorial Geometry</i> (Vol.
    10). Berlin ; Heidelberg: Springer. <a href="https://doi.org/10.1007/978-3-642-61568-9">https://doi.org/10.1007/978-3-642-61568-9</a>'
  chicago: 'Edelsbrunner, Herbert. <i>Algorithms in Combinatorial Geometry</i>. Vol.
    10. Berlin ; Heidelberg: Springer, 1987. <a href="https://doi.org/10.1007/978-3-642-61568-9">https://doi.org/10.1007/978-3-642-61568-9</a>.'
  ieee: 'H. Edelsbrunner, <i>Algorithms in Combinatorial Geometry</i>, vol. 10. Berlin ;
    Heidelberg: Springer, 1987.'
  ista: 'Edelsbrunner H. 1987. Algorithms in Combinatorial Geometry, Berlin ; Heidelberg:
    Springer, XV, 423p.'
  mla: Edelsbrunner, Herbert. <i>Algorithms in Combinatorial Geometry</i>. Vol. 10,
    Springer, 1987, doi:<a href="https://doi.org/10.1007/978-3-642-61568-9">10.1007/978-3-642-61568-9</a>.
  short: H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer, Berlin ;
    Heidelberg, 1987.
date_created: 2018-12-11T12:05:47Z
date_published: 1987-01-01T00:00:00Z
date_updated: 2021-12-22T12:59:57Z
day: '01'
doi: 10.1007/978-3-642-61568-9
extern: '1'
intvolume: '        10'
language:
- iso: eng
month: '01'
oa_version: None
page: XV, 423
place: Berlin ; Heidelberg
publication_identifier:
  eisbn:
  - 978-3-642-61568-9
  isbn:
  - 978-3-540-13722-1
  issn:
  - 1431-2654
publication_status: published
publisher: Springer
publist_id: '2257'
quality_controlled: '1'
related_material:
  link:
  - description: available via catalog IST BookList
    relation: other
    url: https://koha.app.ist.ac.at/cgi-bin/koha/opac-detail.pl?biblionumber=4096
status: public
title: Algorithms in Combinatorial Geometry
type: book
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 10
year: '1987'
...