Computational Geometry

Related Fields


Parent Topic:

Mathematics, Computer Science, Geometry

Child Topic:

Proximity problems, Closest pair of points problem, Asymptotically optimal algorithm, Pointer swizzling, Simple polygon, Boyer–Moore string search algorithm, Polygonal chain, Scapegoat tree, Power diagram, Master theorem, Segment tree, Alpha shape, Theta graph, Discrepancy theory, Rational motion, Art gallery problem, Rectilinear polygon, k-d tree, Weighted Voronoi diagram, Kinodynamic planning, Bin, Largest empty rectangle, Mesh generation, Point in polygon, Bounding sphere, Nearest neighbor graph, Envelope, Dynamization, Visibility graph, Metric tree, Minimum bounding box algorithms, Minkowski addition, Monte Carlo algorithm, Probabilistic analysis of algorithms, Pentahedron, Las Vegas algorithm, Gift wrapping algorithm, Radon's theorem, Doubly connected edge list, Sweep line algorithm, Division algorithm, Orthogonal convex hull, Local feature size, Best bin first, Range searching, Delaunay triangulation, Rotating calipers, Point location, Visibility polygon, Monotone polygon, Star-shaped polygon, Polygon triangulation, Bounding volume, Minimum bounding box, Largest empty sphere, Bounding volume hierarchy, Theil–Sen estimator, Space partitioning, Ramer–Douglas–Peucker algorithm, Euclidean shortest path, Pitteway triangulation, Convex hull, Range query, Beta skeleton, Sorting, Accounting method, Cover tree, Polygon covering, Sweep and prune, Randomization function, Nearest neighbor search, Planarity testing, Straight skeleton, Pseudotriangle, Line segment intersection, Carpenter's rule problem, Aanderaa–Karp–Rosenberg conjecture, Bitangent, Interval tree, Fortune's algorithm, Constrained Delaunay triangulation, Voronoi diagram, Hit-testing

Top Authors


Paper Recommendation
1985 Computational Geometry: An introduction

2000 Multiple View Geometry in Computer Vision

1969 Perceptrons; An introduction To Computational Geometry

1975 Closest-point Problems

1998 Flocks, Herds, and Schools: A Distributed Behavioral Model

1979 Computational Geometry For Design and Manufacture

1986 Real-time Obstacle Avoidance For Manipulators and Mobile Robots

1987 Algorithms in Combinatorial Geometry

1982 Algorithms For Graphics and Image Processing

1999 Level Set Methods and Fast Marching Methods

1980 Fuzzy Sets and Systems

1987 Art Gallery Theorems and Algorithms

1985 The Geometry of Fractal Sets

1984 A Fast Parallel Algorithm For Thinning Digital Patterns

1976 Geometric intersection Problems

1992 A Method For Registration of 3-D Shapes

1994 Computational Geometry in C

1983 Solving The Find-path Problem By Good Representation of Free Space

1974 Equivalent Circuit Models For Three-Dimensional Multiconductor Systems

1995 Applied Multivariate Techniques