scientific article
From MaRDI portal
Publication:3138743
zbMath0834.68122MaRDI QIDQ3138743
Publication date: 11 November 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Backwards analysis of the Karger-Klein-Tarjan algorithm for minimum spanning trees, Fast and efficient computation of additively weighted Voronoi cells for applications in molecular biology, From proximity to utility: a Voronoi partition of Pareto optima, On-line construction of the upper envelope of triangles and surface patches in three dimensions, Randomized geometric algorithms and pseudorandom generators, A combinatorial bound for linear programming and related problems, Deletion in abstract Voronoi diagrams in expected linear time and related problems, Efficient randomized incremental algorithm for the closest pair problem using Leafary trees, Fast skeleton construction, Small-dimensional linear programming and convex hulls made easy, Markov incremental constructions, Stable minimum space partitioning in linear time, On lazy randomized incremental construction, A tail estimate for Mulmuley's segment intersection algorithm, A unified approach to tail estimates for randomized incremental construction, Comparison of simple diversity mechanisms on plateau functions, An applied point pattern matching problem: Comparing 2D patterns of protein spots, Union and split operations on dynamic trapezoidal maps, Metric Spaces with Expensive Distances, Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions, Fast segment insertion and incremental construction of constrained Delaunay triangulations
