Computational Geometry - Some Easy Questions and their Recent Solutions

Franz Aurenhammer (Graz University of Technology, Austria)

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: combinatorial geometry, computational geometry, minimum-weight triangulation, point set data base, polygonal skeleton

Categories: F.2.2