The ComputationalGeometry
package was built-in in V10 distribution.
In classical computational geometry field, the following questions were investigated.
Convex hulls,
ConvexHullMesh[]
Line segment intersection,
Graphics`Mesh`FindIntersections[]
Point location,
RegionMember[]
Voronoi diagrams,
VoronoiMesh[]
Delaunay triangulations,
DelaunayMesh[]
Boolean operations(like union, difference and intersection),
RegionUnion[], RegionDifference[], RegionIntersection[]
which means I can find the theory/algorithm in classical textbook of computational geometry like: "Computational Geometry, Algorithms and Applications".
In addtion, new version also owns other new functionality, like: Discretize*, Boundary*
DiscretizeGraphics[]
BoundaryDiscretizeGraphics[]
DiscretizeRegion[]
BoundaryDiscretizeRegion[]
RegionBoundary[]
So I would like to know:
- Is it possible to know the theory/algorithm behind the above functions. Namely, which textbook involved the theory/algorithm knowledge?