JUCS - Journal of Universal Computer Science 7(5): 338-354, doi: 10.3217/jucs-007-05-0338
Computational Geometry - Some Easy Questions and their Recent Solutions
expand article infoFranz Aurenhammer‡
‡ Graz University of Technology, Graz, Austria

Corresponding author: Franz Aurenhammer ( auren@igi.tu-graz.ac.at )

© Franz Aurenhammer.
This article is freely available under the J.UCS Open Content License.
Citation: Aurenhammer F (2001) Computational Geometry - Some Easy Questions and their Recent Solutions. JUCS - Journal of Universal Computer Science 7(5): 338-354. https://doi.org/10.3217/jucs-007-05-0338
Open Access
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.
Keywords
computational geometry, combinatorial geometry, point set data base, minimum-weight triangulation, polygonal skeleton