Corpus ID: 208637079

A Framework for Robust Realistic Geometric Computations

@article{Erickson2019AFF,
  title={A Framework for Robust Realistic Geometric Computations},
  author={Jeff Erickson and I. Hoog and Tillmann Miltzow},
  journal={ArXiv},
  year={2019},
  volume={abs/1912.02278}
}
We propose a new paradigm for robust geometric computations that complements the classical fixed precision paradigm and the exact geometric computation paradigm. We provide a framework where we study algorithmic problems under smoothed analysis of the input, the relaxation of the problem requirements, or the witness of a recognition problem. Our framework specifies a widely applicable set of prerequisites that make real RAM algorithms suitable for smoothed analysis. We prove that suitable… Expand
3 Citations
Framework for $\exists \mathbb{R}$-Completeness of Two-Dimensional Packing Problems
  • PDF
Smoothing the gap between NP and ER
  • 6

References

SHOWING 1-10 OF 115 REFERENCES
Towards Exact Geometric Computation
  • C. Yap
  • Computer Science, Mathematics
  • Comput. Geom.
  • 1997
  • 227
  • PDF
Classroom examples of robustness problems in geometric computations
  • 101
  • PDF
Towards exact numerical Voronoi diagrams
  • 21
Framework for ER-Completeness of Two-Dimensional Packing Problems
  • 5
The art gallery problem is ∃ ℝ-complete
  • 38
  • PDF
EPTAS for Max Clique on Disks and Unit Balls
  • 8
  • PDF
Typical properties of winners and losers in discrete optimization
  • 72
  • PDF
Subquadratic Encodings for Point Configurations
  • 4
  • PDF
...
1
2
3
4
5
...