Discrete and computational geometry

Boris Aronov

at 250 WPM

14h 13m

The average reader, reading at a speed of 250 WPM, would take 14h 13m to read Discrete and computational geometry.

Personalise your estimate by entering your reading speed below

Test my reading speed

29

days at 30 min/day

853

total minutes

Buy on Amazon

Discrete and computational geometry

by Boris Aronov

2012

Springer London, Limited

853

9783642555664

Description

This is an impressive collection of original research papers in discrete and computational geometry, contributed by many leading researchers in these fields, as a tribute to Jacob E. Goodman and Richard Pollack, two of the `founding fathers' of the area, on the occasion of their 2/3 x 100 birthdays. The topics covered by the 41 papers provide professionals and graduate students with a comprehensive presentation of the state of the art in most aspects of discrete and computational geometry, including geometric algorithms, arrangements, geometric graph theory and quantitative and algorithmic real algebraic geometry, with important connections to algebraic geometry, convexity, polyhedral combinatorics, and the theory of packing, covering, and tiling. The book will serve as an invaluable source of reference in this discipline, and an indispensible component of the library of anyone working in the above areas.

Frequently Asked Questions

How many pages are in Discrete and computational geometry?

This edition of Discrete and computational geometry has approximately 853 pages. Please note, this is an estimate and the exact page count can vary between hardcover, paperback, and e-book versions.

How long does it take to read Discrete and computational geometry?

For most readers, Discrete and computational geometry typically takes between 17h 46m and 11h 51m to complete. This is based on the book's length of approximately 213,250 words and common reading speeds.

Here's a detailed breakdown: • Continuous reading at 250 WPM: approximately 14h 13m of focused reading • Casual reading (30 minutes/day): you could finish in roughly 29 days • Estimated word count: 213,250 words

Your individual reading time will vary based on your personal reading pace, the amount of daily reading time, and your familiarity with the subject matter.

What is the word count of Discrete and computational geometry?

The estimated word count for Discrete and computational geometry is approximately 213,250 words. This figure is calculated using industry-standard methods that consider genre-specific word density patterns, typical formatting and layout characteristics, and standard words-per-page ratios for published books.

This is an approximation — actual word count may vary based on font size, formatting, edition, and the presence of illustrations or charts.

Who is the author of Discrete and computational geometry?

Discrete and computational geometry was written by Boris Aronov.

When was Discrete and computational geometry published?

The publication date for this specific edition is 2012. The original work may have been published on a different date.