Efficient update strategies for geometric computing with uncertainty

DOI10.1007/S00224-004-1180-4zbMATH Open1084.68131OpenAlexW2043675696MaRDI QIDQ814917FDOQ814917

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

Recommendations

• scientific article; zbMATH DE number 2011841
• Algorithms and Data Structures
• Point set distance and orthogonal range problems with dependent geometric uncertainties

Mathematics Subject Classification ID

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

Cited In (22)

• Scheduling with testing on multiple identical parallel machines
• Query-competitive algorithms for cheapest set problems under uncertainty
• Scheduling with a processing time oracle
• Query-Competitive Sorting with Uncertainty.
• The Minimum Cost Query Problem on Matroids with Uncertainty Areas.
• Faster geometric algorithms via dynamic determinant computation
• Algorithms for Queryable Uncertainty
• Title not available (Why is that?)
• Point set distance and orthogonal range problems with dependent geometric uncertainties
• Delaunay Triangulation of Imprecise Points Simplified and Extended
• Explorable uncertainty in scheduling with non-uniform testing times
• Set selection under explorable stochastic uncertainty via covering techniques
• The update complexity of selection and related problems
• Query-competitive sorting with uncertainty
• Query minimization under stochastic uncertainty
• Minimizing co-location potential of moving entities
• Approximation Algorithms for Multiprocessor Scheduling with Testing to Minimize the Total Job Completion Time
• Preprocessing imprecise points for Delaunay triangulation: simplified and extended
• Verification problem of maximal points under uncertainty
• Round-competitive algorithms for uncertainty problems with parallel queries
• Optimal path discovery problem with homogeneous knowledge
• Minimizing the size of the uncertainty regions for centers of moving entities

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

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