Menu
I am looking for any good sources for geometric algorithms specifically;
The simple stuff like when two lines cross and so on is easy enough (and easy to find), but I would like to find somewhere with algorithms for the more tricky things, such as finding the shape formed by expanding a given polygon by some amount; fast algorithms for shapes with curved sides, etc.
Any good tips? Thanks!
481
The Applied Geometric Algorithms group mainly focuses on geometric algorithms for spatial data and applications of geometric algorithms in the areas of GIScience and Smart Mobility (including Automated Cartography, Geo-Visualization, and Moving Object Analysis), Visual Analytics, Mobile Agents, and e-Humanities.
CHAPTER 2.9 - Geometric Algorithms Computational geometry and geometric algorithms are synonymous terms that denote an active discipline within computer science studying algorithms, or more generally the computational complexity of geometric objects and problems.
Some fundamental problems of this type are: Convex hull: Given a set of points, find the smallest convex polyhedron/polygon containing all the points. Line segment intersection: Find the intersections between a given set of line segments. Delaunay triangulation.
Computer graphics is a defining application for computational geometry. The interaction between these fields is explored through two scenarios. Spatial subdivisions studied from the viewpoint of computational geometry are shown to have found application in computer graphics.
Computational Geometry Algorithms Library is decent.
195
I enjoy Dave Eberly's website, especially some of his PDFs.
For curved surfaces, there's a pretty good free textbook here, that covers beziers, nurbs and subdivision surfaces.
24
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With
