About the Book
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 138. Chapters: Geometric algorithms, Matroid theory, Basis, Linear programming, Greedy algorithm, Binary space partitioning, Delaunay triangulation, Pseudoforest, Tutte polynomial, Fractional cascading, Oriented matroid, Bentley-Ottmann algorithm, Criss-cross algorithm, Kd-tree, Signed graph, List of books in computational geometry, Branch-decomposition, 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, Biased graph, Bregman divergence, Ray casting, 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, Dowling geometry, Polygon triangulation, Geometric hashing, Klee's measure problem, Orthogonal convex hull, Lloyd's algorithm, Ruppert's algorithm, Delaunay tessellation field estimator, Rotating calipers, Weighted matroid, Euclidean shortest path, Bounding volume hierarchy, Bicircular matroid, 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, Gain graph, Function representation, CGAL, Steinitz exchange lemma, Boolean operations on polygons, Stencil jumping, Minimum bounding rectangle, Range searching, Geometric design, Geometric spanner, Region connection calculus, Mnev's universality theorem, Proximity problems, Pregeometry, Sweep line algorithm, Digital Morse theory, Minimum bounding box algorithms, List of combinatorial computational geometry topics, Mesh generation, Spatial-temporal reasoning, Sum of radicals, -net, Matroid i...
