null
Loading…
Skip to main content Skip to buy box

Holiday gifts by Fri, Dec 18? Order by Thu, Dec 3. Plan gifts Gifts by Dec 18? Order by Dec 3. Plan

Free shipping on most orders over $95 in the contiguous US

Specialists Mon–Fri, 8:30 am–5 pm PTSpecialists Mon–Fri, 8:30–5 PT866-522-6657

Algorithms in Combinatorial Geometry (Monographs in Theoretical Computer Science. An EATCS Series #10) book cover by Herbert Edelsbrunner
Hardcover

Algorithms in Combinatorial Geometry (Monographs in Theoretical Computer Science. An EATCS Series #10)

by Herbert Edelsbrunner

From $96.79 / copy at 25+ copies; lower per-copy prices at higher quantities (see Volume pricing) As low as $94.59 at 100+

Total $2,419.75

Hardcover · 423 pages Springer Berlin Heidelberg · 1987

Format

Hardcover
Volume pricing

The more copies, the less each one costs

Applied automatically in your cart. No code needed.

About the book

Algorithms in Combinatorial Geometry (Monographs in Theoretical Computer Science. An EATCS Series #10)

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.

Details

Publisher
Springer Berlin Heidelberg
Author
Herbert Edelsbrunner
Format
Hardcover
Published
Jul 31, 1987
ISBN-13
9783540137221
Pages
423
Buying for a group

Algorithms in Combinatorial Geometry (Monographs in Theoretical Computer Science. An EATCS Series #10) for groups: pricing

Volume pricing applies automatically in your cart. No codes, no account needed.

CopiesPrice per copyYou save
25 – 49 $96.79 12% off list
50 – 99 $95.69 13% off list
100+ $94.59 14% off list
Ways groups use it

Popular for

1
Course and classroom adoption

A copy for every student in the class or section.

2
Faculty and staff book studies

Shared reading for professional development.

3
Orientation and campus events

Common reads and first-year programs.

Where can I buy 100 copies of Algorithms in Combinatorial Geometry?

BookPal sells Algorithms in Combinatorial Geometry in quantity. At 100 copies the price is $94.59 a copy, against a list price of $109.99, and the cart applies the volume tier automatically. Free shipping on most orders over $95 in the contiguous US. A specialist can quote a larger or mixed order.

  • New books only, straight from the publisher
  • Volume prices apply automatically in the cart, with no code needed
  • Order at least 10 business days before you need the books (11 from mid-November through December)

Ask a specialist about a larger or mixed order

What does Algorithms in Combinatorial Geometry (Monographs in Theoretical Computer Science. An EATCS Series #10) cost when I buy for a group?

Volume pricing applies automatically in your cart, with no code needed. Price per copy: 25 to 49 copies, $96.79 (12% off list); 50 to 99 copies, $95.69 (13% off list); 100+ copies, $94.59 (14% off list). Need a different quantity, or a quote to forward for approval? Ask a specialist and we will confirm pricing before you pay.

How fast can I get copies of Algorithms in Combinatorial Geometry (Monographs in Theoretical Computer Science. An EATCS Series #10)?

Need them by a specific date? Request a quote and we'll confirm timing before you pay.

Can you ship to several locations or people's homes?

Yes. We ship group orders to one address, to multiple sites, or to individual recipients, in the US and internationally. See fulfillment options.

Can I get a formal quote for approval before ordering?

Yes. Request a quote and we'll send a PDF you can forward for approval.

Do you accept purchase orders and tax-exempt orders?

Yes. We accept purchase orders upon approval, as well as cards, PayPal, ACH, wire transfers and checks. BookPal is a tax-exempt supplier in all 50 states. See purchase orders and sales tax exemption.

What if I find a lower price?

Send us the link. We match prices from other booksellers and distributors on a new copy in the same edition, available to ship in the quantity you need. Clearance sales and pricing errors are the exception, and we'll tell you quickly if that's the case. Start a price match.

Send for approval

Get a yes from your approver

Algorithms in Combinatorial Geometry (Monographs in Theoretical Computer Science. An EATCS Series #10)
Email it to my approver

Your approver gets a link to this page with the quantity set and an "Approve and order" button. Nothing is sent until you press send in your email app.

Log In
Review Your Cart
Your cart is empty Your cart is empty Your cart is empty

Menu

Recently Viewed Recently Viewed
Back to top Back to top