Publication:3716336
From MaRDI portal
zbMath0588.68058MaRDI QIDQ3716336
Publication date: 1985
68Q25: Analysis of algorithms and problem complexity
68P10: Searching and sorting
52-04: Software, source code, etc. for problems pertaining to convex and discrete geometry
68U99: Computing methodologies and applications
Related Items
Computing hereditary convex structures, Universality theorems for inscribed polytopes and Delaunay triangulations, Applications of generalized matrix searching to geometric algorithms, Delaunay triangulation of imprecise points in linear time after preprocessing, Optimal time bounds for some proximity problems in the plane, Sorting helps for Voronoi diagrams, Neighborly inscribed polytopes and Delaunay triangulations