Algorithms in Combinatorial Geometry - Info and Reading Options
By Herbert Edelsbrunner
"Algorithms in Combinatorial Geometry" is published by Springer in Sep 23, 2011 - Berlin Heidelberg and it has 438 pages.
“Algorithms in Combinatorial Geometry” Metadata:
- Title: ➤ Algorithms in Combinatorial Geometry
- Author: Herbert Edelsbrunner
- Number of Pages: 438
- Publisher: Springer
- Publish Date: Sep 23, 2011
- Publish Location: Berlin Heidelberg
“Algorithms in Combinatorial Geometry” Subjects and Themes:
- Subjects: Geometry, data processing - Algorithms
Edition Specifications:
- Format: paperback
Edition Identifiers:
- The Open Library ID: OL28276785M - OL19825557W
- ISBN-13: 9783642648731 - 9783642615689
- ISBN-10: 3642648738
- All ISBNs: 3642648738 - 9783642648731 - 9783642615689
AI-generated Review of “Algorithms in Combinatorial Geometry”:
"Algorithms in Combinatorial Geometry" Description:
Open Data:
This book offers a modern approach to computational geo- metry, an area thatstudies the computational complexity of geometric problems. Combinatorial investigations play an important role in this study
Read “Algorithms in Combinatorial Geometry”:
Read “Algorithms in Combinatorial Geometry” by choosing from the options below.
Search for “Algorithms in Combinatorial Geometry” downloads:
Visit our Downloads Search page to see if downloads are available.
Find “Algorithms in Combinatorial Geometry” in Libraries Near You:
Read or borrow “Algorithms in Combinatorial Geometry” from your local library.
- The WorldCat Libraries Catalog: Find a copy of “Algorithms in Combinatorial Geometry” at a library near you.
Buy “Algorithms in Combinatorial Geometry” online:
Shop for “Algorithms in Combinatorial Geometry” on popular online marketplaces.
- Ebay: New and used books.