A new duality result concerning Voronoi diagrams

DOI10.1007/3-540-16761-7_51zbMath0595.52007OpenAlexW2127103993MaRDI QIDQ5903167

Franz Aurenhammer

Publication date: 1986

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-16761-7_51

zbMATH Keywords

convex hullVoronoi diagramcomputational geometryefficient algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Convex sets in (2) dimensions (including convex curves) (52A10) Polytopes and polyhedra (52B99) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Discrete mathematics in relation to computer science (68R99)

Related Items

A criterion for the affine equivalence of cell complexes in \(R^ d\) and convex polyhedra in \(R^{d+1}\) ⋮ An \(O(mn^ 2)\) algorithm for the maximin problem in \(E^ 2\) ⋮ A nearly parallel algorithm for the Voronoi diagram of a convex polygon