Get personalized book recommendations based on your reading history and preferences. Our algorithm analyzes your favorite books and reading patterns to suggest your next great read.

"Geometric Algorithms" is a book category focused on the design, analysis, and implementation of algorithms that solve problems defined by geometric objects and spatial relationships. It spans foundational theory—computational geometry, combinatorial and numeric analysis of complexity and correctness—to practical methods such as convex hulls, triangulation and mesh generation, Voronoi diagrams and Delaunay triangulations, nearest neighbors, range searching, visibility, motion planning and collision detection. Books in this category address data structures, robustness and numerical issues, optimization and approximation techniques, and algorithmic trade-offs, and they cater to audiences from advanced undergraduates and graduate students to researchers and practitioners in computer graphics, CAD, robotics, GIS, scientific computing and game development, offering textbooks, monographs, surveys and implementation-focused guides.

Filter books by their publication year. Enter the earliest year (Start) and latest year (End) to find books published within that period. Leave either field empty to search from the beginning of time or up to the present day.