About the Book
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 98. Chapters: Linear programming, Binary space partitioning, Delaunay triangulation, Fractional cascading, Bentley-Ottmann algorithm, Criss-cross algorithm, Kd-tree, List of books in computational geometry, Pseudotriangle, Beta skeleton, Voronoi diagram, Nearest neighbor search, Convex hull algorithms, Art gallery problem, Point location, Geometric median, Frechet distance, Bounding volume, Straight skeleton, Steiner tree problem, Minkowski addition, Smallest circle problem, Bregman divergence, Midpoint circle algorithm, Fortune's algorithm, Bounding interval hierarchy, De Casteljau's algorithm, Velocity obstacle, Point in polygon, Monotone polygon, Closest pair of points problem, Polygon triangulation, Geometric hashing, Klee's measure problem, Orthogonal convex hull, Lloyd's algorithm, Ruppert's algorithm, Delaunay tessellation field estimator, Rotating calipers, Euclidean shortest path, Bounding volume hierarchy, Largest empty rectangle, JTS Topology Suite, Shoelace formula, Pitteway triangulation, Ramer-Douglas-Peucker algorithm, Hierarchical RBF, De Boor's algorithm, Rectilinear Steiner tree, Marching cubes, Function representation, CGAL, Boolean operations on polygons, Stencil jumping, Minimum bounding rectangle, Range searching, Geometric design, Geometric spanner, Proximity problems, Sweep line algorithm, Digital Morse theory, Minimum bounding box algorithms, List of combinatorial computational geometry topics, Mesh generation, Bounding sphere, Dynamic convex hull, Geometric modeling, Quad-edge, Geometric primitive, Doubly-connected edge list, HyperFun, 3SUM, Line segment intersection, Visibility, Jump-and-Walk algorithm, Planar straight-line graph, Star-shaped polygon, Gilbert-Johnson-Keerthi distance algorithm, Chew's second algorithm, Centroidal Voronoi tessellation, Point set triangulation, Winged edge, Bitonic tour, ...
