Computational geometry - some easy questions and their recent
solutions
Abstract:
We address three basic questions in computational geometry which can be phrased
in simple terms but have only recently received (more or less) satisfactory
answers: point set enumeration, optimum triangulation, and polygon
decomposition.
Reference: F. Aurenhammer.
Computational geometry - some easy questions and their recent solutions.
J. Universal Computer Science, 7:338-354, 2001.
Special Issue.