Computational Geometry and Low Dimensional Linear Programs
Many areas (robotics, pattern recognition, computer graphics etc. ) offer problems requiring efficient computation of elementary planar geometric objects, e.g. the convex hull of a set, the intersectionof a line and a convex polytcpe, the distance between two line segments. Computational geometry, applying computer science methodology to such geometrical problems (see e.g. , ), has provided important algorithms and complexity results, typically under specific assumptions on the data structure.