Computational geometry with probabilistically noisy primitive operations
From MaRDI portal
Cites work
- A framework for searching in graphs in the presence of errors
- A tail estimate with exponential decay for the randomized incremental construction of search structures
- A unified approach to tail estimates for randomized incremental construction
- Algorithms for Reporting and Counting Geometric Intersections
- Biased random walks
- Computational geometry. Algorithms and applications.
- Computing with Noisy Information
- Convex hulls of finite sets of points in two and three dimensions
- Delaunay triangulation of imprecise points in linear time after preprocessing
- Deterministic and probabilistic binary search in graphs
- scientific article; zbMATH DE number 1639663 (Why is no real title available?)
- scientific article; zbMATH DE number 3597592 (Why is no real title available?)
- Leveraging parameterized Chernoff bounds for simplified algorithm analyses
- Location of a Point in a Planar Subdivision and Its Applications
- Maintenance of configurations in the plane
- Noisy sorting capacity
- On levels in arrangements of curves
- On shape Delaunay tessellations
- Optimal sorting with persistent comparison errors
- Pseudo-Line Arrangements: Duality, Algorithms, and Applications
- Reliable and Efficient Computational Geometry Via Controlled Perturbation
- Searching games with errors -- fifty years of coping with liars
- Searching with known error probability
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
- Skyline Computation with Noisy Comparisons
- Symbolic treatment of geometric degeneracies
- The communication complexity of addition
- Tolerant algorithms
This page was built for publication: Computational geometry with probabilistically noisy primitive operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7312573)
