Preprocessing Ambiguous Imprecise Points

DOI10.4230/LIPICS.SOCG.2019.42OpenAlexW2962806151MaRDI QIDQ5088972FDOQ5088972

Authors: 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

Recommendations

• Preprocessing Imprecise Points and Splitting Triangulations
• Preprocessing Imprecise Points and Splitting Triangulations
• Preprocessing imprecise points for Delaunay triangulation: simplified and extended
• Preclustering Algorithms for Imprecise Points
• Preclustering algorithms for imprecise points
• Separability of imprecise points
• Separability of imprecise points
• Preprocessing under uncertainty
• Approximation-assisted point estimation

zbMATH Keywords

entropysortingpreprocessingimprecise pointsproximity structures

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Computational geometry. Algorithms and applications.
• Counting linear extensions
• Title not available (Why is that?)
• Binary Search Trees of Bounded Balance
• Geometric approximation algorithms
• Preprocessing Imprecise Points and Splitting Triangulations
• Delaunay triangulations in O (sort( n )) time and more
• Title not available (Why is that?)
• How good is the information theory bound in sorting?
• Delaunay triangulation of imprecise points in linear time after preprocessing
• Geometric containment orders: A survey
• Title not available (Why is that?)
• Preprocessing imprecise points for Delaunay triangulation: simplified and extended
• Triangulating input-constrained planar point sets
• An Amortized Analysis of Insertions into AVL-Trees
• Dynamic planar point location with sub-logarithmic local updates
• Entropy and sorting.
• Convex hull of points lying on lines in \(O(n\log n)\) time after preprocessing
• Unions of onions: preprocessing imprecise points for fast onion decomposition
• Triangulating the square and squaring the triangle: quadtrees and Delaunay triangulations are equivalent
• Dynamic smooth compressed quadtrees

Cited In (5)

• Preclustering algorithms for imprecise points
• Query minimization under stochastic uncertainty
• Sorting under partial (interval order) information
• Preprocessing Imprecise Points and Splitting Triangulations
• Round-competitive algorithms for uncertainty problems with parallel queries

This page was built for publication: Preprocessing Ambiguous Imprecise Points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5088972)