This volume serves as a comprehensive reference work designed to synthesize the foundational principles and advanced applications of discrete and computational geometry. The authors, Jacob E. Goodman and Joseph O'Rourke, curate contributions from leading experts in the field to provide a rigorous overview of geometric algorithms, combinatorial structures, and their computational implementations. The text functions as a primary resource for researchers and practitioners seeking to understand the intersection of mathematical theory and algorithmic efficiency.

Experts in the field of computational geometry recognize this text as a foundational reference for both academic study and professional application. Readers frequently note the high density of the technical prose, which is intended for advanced students and researchers in mathematics and computer science.