Computational Geometry and Low Dimensional Linear Programs
Part of the
NATO ASI Series
book series (volume 51)
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.
KeywordsData Structure Convex Hull Mathematical Program Computer Graphic Computational Geometry
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
M.E. Dyer, Linear time algorithms for two-and three-variable linear programs, Siam J. Computing 13 (1984), 31–45. 186MathSciNetMATHCrossRefGoogle Scholar
N. Megiddo, Linear programming in linear time when the dimension is fixed, J. Assoc. Comput. March. 31 (1984), 114–127.MathSciNetMATHCrossRefGoogle Scholar
K. Mehlhorn, Data Structures and Algorithms 3: Multidimensional Searching and Computational Geometry, Springer, Berlin, 1984.Google Scholar
F.P. Preparata and M.I. Shamos, Computational Geometry — An Introduction, Springer, New York, 1985.Google Scholar
A. Schrijver, Theory of Linear and Integer Programming, J. Wiley, New York, 1986.MATHGoogle Scholar
© Springer-Verlag Berlin Heidelberg 1989