Computational geometry: Difference between revisions

Revision as of 19:41, 16 August 2010

Revision as of 15:31, 25 October 2010

Line 38:

* [[Euclidean shortest path]]: Connect two points in a Euclidean space (with polyhedral obstacles) by a shortest path.

* [[Polygon triangulation]]: Given a polygon, partition its interior into triangles

* [[Mesh generation]]

The computational complexity for this class of problems is estimated by the time and space (computer memory) required to solve a given problem instance.