The following pages link to (Q3138743):
Displaying 24 items.
- Backwards analysis of the Karger-Klein-Tarjan algorithm for minimum spanning trees (Q293385) (← links)
- From proximity to utility: a Voronoi partition of Pareto optima (Q331376) (← links)
- Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection (Q686143) (← links)
- Comparison of simple diversity mechanisms on plateau functions (Q1029353) (← links)
- Small-dimensional linear programming and convex hulls made easy (Q1176319) (← links)
- Stable minimum space partitioning in linear time (Q1195932) (← links)
- An applied point pattern matching problem: Comparing 2D patterns of protein spots (Q1289026) (← links)
- Applications of random sampling in computational geometry. II (Q1823685) (← links)
- Union and split operations on dynamic trapezoidal maps (Q1841116) (← links)
- On-line construction of the upper envelope of triangles and surface patches in three dimensions (Q1917040) (← links)
- Randomized geometric algorithms and pseudorandom generators (Q1923860) (← links)
- Fast segment insertion and incremental construction of constrained Delaunay triangulations (Q2354921) (← links)
- Metric Spaces with Expensive Distances (Q5012870) (← links)
- Fast and efficient computation of additively weighted Voronoi cells for applications in molecular biology (Q5054867) (← links)
- A unified approach to tail estimates for randomized incremental construction (Q5088886) (← links)
- A combinatorial bound for linear programming and related problems (Q5096811) (← links)
- A tail estimate for Mulmuley's segment intersection algorithm (Q5204337) (← links)
- (Q5743431) (← links)
- Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions (Q5864671) (← links)
- Markov incremental constructions (Q5896960) (← links)
- On lazy randomized incremental construction (Q5917712) (← links)
- Deletion in abstract Voronoi diagrams in expected linear time and related problems (Q6045784) (← links)
- Efficient randomized incremental algorithm for the closest pair problem using Leafary trees (Q6064016) (← links)
- Fast skeleton construction (Q6102331) (← links)