DeepRead
Cover of Computational Geometry in C

Computational Geometry in C

Joseph O'Rourke · 1994

Mathematics and physics › Geometry and geometric algebra

#9,516 most recommended

About the book

A textbook on algorithms for geometric problems in two and three dimensions, covering the representation of points, lines, polygons and polyhedra, and problems such as convex hulls, triangulation, intersection, point location, and Voronoi and Delaunay diagrams. Each algorithm is presented with a C implementation, and the material is aimed at students and practitioners who want working code as well as the underlying theory. The book holds that computational geometry is best learned by implementing its algorithms, since the working code exposes details that pseudocode hides. It treats the gap between exact geometric theory and floating-point arithmetic as a practical concern, and discusses degenerate cases such as collinear or coincident points that naive implementations often mishandle. Its main claim is that a sound geometric algorithm needs both a correct combinatorial design and careful handling of numerical and degenerate input.

Written by Claude from what it knows of this book.

What Hacker News says 100% recommend · 0% critical

00.5120082015202020252008 peak · 1
This bookAverage book in Geometry and geometric algebra

In the commenters’ own words

What Open Library readers say

No Open Library reader has rated it yet.

  • 3 want to read
  • 0 reading
  • 0 have read

Open Library’s page for the book

What critics say, via Wikipedia

No Wikipedia article about this book yet, so no critics to quote.

Reddit communities — coming later

Details

First published
1994
ISBN
9780521440349
Editions known
12 at Open Library
Open Library
OL7211580W

C (Computer program language)Data processingGeometryGeometry, data processing

Explore in the mosaic

Read next: its neighbours on the mosaic