The subject focuses on the issue how to create effective geometrical algorithms that exhibit low time and space complexities. The following topics are discussed: The complexity of the problem and the complexity of the algorithm. Point location in a planar map. Convex hull. Proximity problems. Voronoi diagram. Triangulation. Intersections. Visibility.
Literature
No literature has been specified for this subject.
Advised literature
No advised literature has been specified for this subject.