Efficient update strategies for geometric computing with uncertainty

DOI10.1007/s00224-004-1180-4zbMath1084.68131OpenAlexW2043675696MaRDI QIDQ814917

N. E. Zubov

Publication date: 8 February 2006

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-004-1180-4

Mathematics Subject Classification ID

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

Related Items (16)

Scheduling with testing on multiple identical parallel machines ⋮ The update complexity of selection and related problems ⋮ Delaunay Triangulation of Imprecise Points Simplified and Extended ⋮ Query-competitive sorting with uncertainty ⋮ Set selection under explorable stochastic uncertainty via covering techniques ⋮ Round-competitive algorithms for uncertainty problems with parallel queries ⋮ Query-competitive algorithms for cheapest set problems under uncertainty ⋮ Preprocessing imprecise points for Delaunay triangulation: simplified and extended ⋮ Algorithms for Queryable Uncertainty ⋮ Query minimization under stochastic uncertainty ⋮ Optimal path discovery problem with homogeneous knowledge ⋮ Query-Competitive Sorting with Uncertainty. ⋮ The Minimum Cost Query Problem on Matroids with Uncertainty Areas. ⋮ Minimizing Co-location Potential of Moving Entities ⋮ Scheduling with a processing time oracle ⋮ Explorable uncertainty in scheduling with non-uniform testing times

This page was built for publication: Efficient update strategies for geometric computing with uncertainty