Preprocessing Ambiguous Imprecise Points
From MaRDI portal
Publication:5088972
DOI10.4230/LIPIcs.SoCG.2019.42OpenAlexW2962806151MaRDI QIDQ5088972
Ivor van der Hoog, Irina Kostitsyna, Maarten Löffler, Bettina Speckmann
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1903.08280
Related Items (2)
Round-competitive algorithms for uncertainty problems with parallel queries ⋮ Query minimization under stochastic uncertainty
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Preprocessing imprecise points for Delaunay triangulation: simplified and extended
- Entropy and sorting.
- Triangulating input-constrained planar point sets
- Delaunay triangulation of imprecise points in linear time after preprocessing
- Counting linear extensions
- How good is the information theory bound in sorting?
- Geometric containment orders: A survey
- Convex hull of points lying on lines in \(O(n\log n)\) time after preprocessing
- Sorting under partial information (without the ellipsoid algorithm).
- Dynamic Planar Point Location with Sub-logarithmic Local Updates
- [https://portal.mardi4nfdi.de/wiki/Publication:2968106 Unions of Onions: Preprocessing Imprecise Points for Fast Onion Decomposition]
- Delaunay triangulations in O (sort( n )) time and more
- Triangulating the Square and Squaring the Triangle: Quadtrees and Delaunay Triangulations are Equivalent
- An Amortized Analysis of Insertions into AVL-Trees
- Dynamic smooth compressed quadtrees
- Preprocessing Imprecise Points and Splitting Triangulations
- Binary Search Trees of Bounded Balance
This page was built for publication: Preprocessing Ambiguous Imprecise Points
