Algorithms in Combinatorial Geometry
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 combin…
Mehr
CHF 130.00
Preise inkl. MwSt. und Versandkosten (Portofrei ab CHF 40.00)
V103:
Folgt in ca. 5 Arbeitstagen
Produktdetails
- ISBN: 978-3-642-64873-1
- EAN: 9783642648731
- Produktnummer: 13337203
- Verlag: Springer Berlin Heidelberg
- Sprache: Englisch
- Erscheinungsjahr: 2011
- Seitenangabe: 444 S.
- Masse: H23.5 cm x B15.5 cm x D2.3 cm 668 g
- Auflage: Softcover reprint of the original 1st ed. 1987
- Abbildungen: Paperback
- Gewicht: 668
11 weitere Werke von Herbert Edelsbrunner:
Bewertungen
Anmelden