Review:
Discrete & Computational Geometry By Satyan Devadoss And Joseph O'rourke
overall review score: 4.5
⭐⭐⭐⭐⭐
score is between 0 and 5
Discrete & Computational Geometry by Satyan Devadoss and Joseph O'Rourke is a comprehensive textbook that explores the fundamental concepts, algorithms, and structures within the fields of discrete geometry and computational geometry. The book covers a wide range of topics including convex hulls, Voronoi diagrams, Delaunay triangulations, geometric algorithms, and combinatorial properties of geometric objects, making it suitable for students and researchers interested in theoretical computer science and mathematics.
Key Features
- Clear presentation of core concepts in discrete and computational geometry
- In-depth explanation of algorithms with illustrative examples
- Coverage of classic problems such as convex hulls, line arrangements, and proximity graphs
- Rich collection of exercises to reinforce understanding
- Integration of mathematical rigor with practical algorithmic approaches
Pros
- Well-structured and accessible for graduate students and advanced undergraduates
- Balanced combination of theoretical foundations and practical algorithms
- Extensive illustrations and diagrams enhance comprehension
- Authoritative coverage by experts in the field
Cons
- Can be mathematically dense for readers without a strong background in mathematics or algorithms
- Some topics may lack depth for research-level exploration
- Requires prior knowledge of basic data structures and algorithms