Computational Geometry: An Introduction

This book offers a clear and concise introduction to computational geometry, the study of geometric problems through algorithmic methods. It covers foundational topics such as convex hulls, Voronoi diagrams, triangulations, plane sweep algorithms, and intersection problems. Designed for students in computer science and mathematics, the book emphasizes both theoretical underpinnings and practical algorithmic solutions. Examples and illustrations are used throughout to enhance conceptual clarity and demonstrate real-world applications, including robotics, computer graphics, and geographic information systems. With its focus on problem-solving and efficiency, the text guides readers through the design and analysis of geometric algorithms using rigorous yet accessible language. Each chapter concludes with exercises to reinforce key concepts and computational techniques. Ideal for upper-level undergraduates and graduate students, this book serves as a solid foundation for further study or professional work in computational geometry and related fields.