computational geometry in c second edition by joseph orourke is a comprehensive guide to computational geometry, covering a wide range of topics including polygon triangulation, partitioning, convex hulls, voronoi diagrams, arrangements, search and intersection, motion planning, and more. the book is structured into nine chapters, each focusing on a specific area of computational geometry. chapter 1 discusses polygon triangulation, including art gallery theorems, triangulation theory, area calculation, implementation issues, segment intersection, and implementation of triangulation. chapter 2 covers polygon partitioning, including monotone partitioning, trapezoidalization, partitioning into monotone mountains, linear-time triangulation, and convex partitioning. chapter 3 explores convex hulls in two dimensions, including definitions, naive algorithms, gift wrapping, quickhull, graham's algorithm, lower bounds, incremental algorithms, and divide and conquer. chapter 4 delves into convex hulls in three dimensions, including polyhedra, hull algorithms, implementation of incremental algorithms, polyhedral boundary representations, randomized incremental algorithms, higher dimensions, and additional exercises. chapter 5 discusses voronoi diagrams, including applications, definitions, delaunay triangulations, algorithms, applications in detail, medial axis, connection to convex hulls, and connection to arrangements. chapter 6 covers arrangements, including introduction, combinatorics of arrangements, incremental algorithm, three and higher dimensions, duality, higher-order voronoi diagrams, applications, and additional exercises. chapter 7 focuses on search and intersection, including segment-segment intersection, segment-triangle intersection, point in polygon, point in polyhedron, intersection of convex polygons, intersection of segments, intersection of nonconvex polygons, extreme point of convex polygon, extremal polytope queries, and planar point location. chapter 8 discusses motion planning, including shortest paths, moving a disk, translating a convex polygon, moving a ladder, robot arm motion, and separability. the book also includes a section on sources, including bibliographies, textbooks, book collections, monographs, journals, conference proceedings, and software. the bibliography and index are also provided.computational geometry in c second edition by joseph orourke is a comprehensive guide to computational geometry, covering a wide range of topics including polygon triangulation, partitioning, convex hulls, voronoi diagrams, arrangements, search and intersection, motion planning, and more. the book is structured into nine chapters, each focusing on a specific area of computational geometry. chapter 1 discusses polygon triangulation, including art gallery theorems, triangulation theory, area calculation, implementation issues, segment intersection, and implementation of triangulation. chapter 2 covers polygon partitioning, including monotone partitioning, trapezoidalization, partitioning into monotone mountains, linear-time triangulation, and convex partitioning. chapter 3 explores convex hulls in two dimensions, including definitions, naive algorithms, gift wrapping, quickhull, graham's algorithm, lower bounds, incremental algorithms, and divide and conquer. chapter 4 delves into convex hulls in three dimensions, including polyhedra, hull algorithms, implementation of incremental algorithms, polyhedral boundary representations, randomized incremental algorithms, higher dimensions, and additional exercises. chapter 5 discusses voronoi diagrams, including applications, definitions, delaunay triangulations, algorithms, applications in detail, medial axis, connection to convex hulls, and connection to arrangements. chapter 6 covers arrangements, including introduction, combinatorics of arrangements, incremental algorithm, three and higher dimensions, duality, higher-order voronoi diagrams, applications, and additional exercises. chapter 7 focuses on search and intersection, including segment-segment intersection, segment-triangle intersection, point in polygon, point in polyhedron, intersection of convex polygons, intersection of segments, intersection of nonconvex polygons, extreme point of convex polygon, extremal polytope queries, and planar point location. chapter 8 discusses motion planning, including shortest paths, moving a disk, translating a convex polygon, moving a ladder, robot arm motion, and separability. the book also includes a section on sources, including bibliographies, textbooks, book collections, monographs, journals, conference proceedings, and software. the bibliography and index are also provided.