Discrete and Computational Geometry

by Satyan Devadoss and Joseph O'Rourke

Errata (2nd Edition)

Last Update:

Substantive Errors

Chap
Page
Location
Old
New
Explanation
Corrector
Date
     

Minor Errors: Typos, etc.

Chap
Page
Location
Old
New
Explanation
Corrector
Date
1
5
Section 1.2
 (b,c,d) nondiagonals (b,c) nondiagonals, and (d) two crossing diagonals Diagonals that cross are still diagonals.
Mario Lopez 
24Jul2026 
1
5
Figure 1.5
 (d) nondiagonal crossing segments (d) two crossing diagonals Diagonals that cross are still diagonals.
Mario Lopez 
24Jul2026 
2
43
Last line
 where pi appears before pj where pi is left of the directed line p pj Counterclockwise insufficient.
Mario Lopez 
29Jul2026 
3
71
Exercise 3.15
     Should be a ☆ hard exercise. Lori Ziegelmeier
22May2025 
3
85
Exercise 3.48
 area 3 unit edge length Should be a ☆ hard exercise.
SLD & JOR
22May2025 
3
90
Exercise 3.49
 It is Is it Typo.
Mario Lopez 
3Aug2026 
3
94
Exercise 3.59
 , no four cocircular, [delete phrase] The intended solution uses cocircular points. Lori Ziegelmeier
27Oct2025 
3
96
Section 3.5
 tree (a graph with no cycles) tree (a connected graph with no cycles) Clarification.
Mario Lopez 
3Aug2026 
3
101
Section 3.5
 For parts (a) and (b), notice that all the vertices have For parts (a) and (b), notice that all the internal vertices have Clarification..
Mario Lopez 
3Aug2026 
5
165
Exercise 5.40
 contains edges pq and qr contains edges pr and qr Typo.
SLD & JOR
2Jun2026 
7 
236
Exercise 7.56
 when the source x is a vertex when the source x is the center of a face   There is more symmetry from a face center, so a bit easier.
SLD & JOR
2Jun2026 
7 
241
Exercise 7.63
   from a convenient source x.   Should be a ☆ hard exercise.
SLD & JOR
22May2025