scientific article
From MaRDI portal
Publication:3716336
zbMath0588.68058MaRDI QIDQ3716336
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Computing methodologies and applications (68U99)
Related Items (7)
Sorting helps for Voronoi diagrams ⋮ Universality theorems for inscribed polytopes and Delaunay triangulations ⋮ Neighborly inscribed polytopes and Delaunay triangulations ⋮ Applications of generalized matrix searching to geometric algorithms ⋮ Optimal time bounds for some proximity problems in the plane ⋮ Computing hereditary convex structures ⋮ Delaunay triangulation of imprecise points in linear time after preprocessing
This page was built for publication:
