Combinatorial computational geometry
Also called algorithmic geometry, the applications of this field are plenty. In robotics, it is used to solve visibility problems, and motion planning, for instance. Similar applications are employed to design route planning or search algorithms in geographic information systems (GIS).
Let's describe the different categories of problems, putting emphasis on the tools to solve them, which are available in the SciPy stack.
Static problems
The fundamental problems in this category are the following:
- Convex hulls: Given a set of points in space, find the smallest convex polyhedron containing them.
- Voronoi diagrams: Given a set of points in space (the seeds), compute a partition in regions consisting of all points closer ...
Get Mastering SciPy now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
