scientific article; zbMATH DE number 431985
From MaRDI portal
Publication:3138743
zbMATH Open0834.68122MaRDI QIDQ3138743FDOQ3138743
Authors: Raimund Seidel 
Publication date: 11 November 1993
Title of this publication is not available (Why is that?)
Recommendations
- An introduction to randomization in computational geometry
- Randomized geometric algorithms and pseudorandom generators
- scientific article; zbMATH DE number 410386
- Derandomization in Computational Geometry
- scientific article; zbMATH DE number 1424301
- scientific article; zbMATH DE number 1256644
- scientific article; zbMATH DE number 1182927
- Applications of random sampling to on-line algorithms in computational geometry
- An optimal convex hull algorithm in any fixed dimension
- Towards dynamic randomized algorithms in computational geometry
Cited In (26)
- On lazy randomized incremental construction
- A unified approach to tail estimates for randomized incremental construction
- Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection
- Randomized geometric algorithms and pseudorandom generators
- A combinatorial bound for linear programming and related problems
- The entropy of backwards analysis
- Efficient randomized incremental algorithm for the closest pair problem using Leafary trees
- Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions
- Metric spaces with expensive distances
- Backwards analysis of the Karger-Klein-Tarjan algorithm for minimum spanning trees
- An applied point pattern matching problem: Comparing 2D patterns of protein spots
- Title not available (Why is that?)
- Deletion in abstract Voronoi diagrams in expected linear time and related problems
- Applications of random sampling in computational geometry. II
- Fast and efficient computation of additively weighted Voronoi cells for applications in molecular biology
- Fast segment insertion and incremental construction of constrained Delaunay triangulations
- Stable minimum space partitioning in linear time
- From proximity to utility: a Voronoi partition of Pareto optima
- Fast skeleton construction
- Comparison of simple diversity mechanisms on plateau functions
- Small-dimensional linear programming and convex hulls made easy
- On-line construction of the upper envelope of triangles and surface patches in three dimensions
- Title not available (Why is that?)
- Union and split operations on dynamic trapezoidal maps
- A tail estimate for Mulmuley's segment intersection algorithm
- Markov incremental constructions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138743)
