Definition: An optimization problem induced by a collection of geometric objects.
See also prune and search.
Note: Since the variables and constraints come from physical situations, faster algorithms can often be developed. Adapted from [AS98, page 413].
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 17 December 2004.
HTML page formatted Fri Feb 23 10:06:07 2018.
Cite this as:
Paul E. Black, "geometric optimization problem", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 17 December 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/geometricopt.html