Lower bounds in on-line geometric searching

DOI10.1016/S0925-7721(00)00030-4zbMath0976.68160MaRDI QIDQ5931368

Sven Schuierer

Publication date: 2 January 2002

Published in: Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

geometric on-line searching problems

Mathematics Subject Classification ID

68P10: Searching and sorting

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

68T40: Artificial intelligence for robotics

Related Items

Searching for an axis-parallel shoreline, On-line parallel heuristics, processor scheduling and robot searching under the competitive framework, Multi-target ray searching problems, Online searching with turn cost

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Searching in the plane
• Shortest paths without a map
• Optimal search paths for random variables
• The linear search problem rides again
• Search games
• STACS 99. 16th annual symposium on theoretical aspects of computer science, Trier, Germany, March 4--6, 1999. Proceedings
• How to find a point on a line within a fixed distance
• Son of the linear search problem
• On the linear search problem
• More on the linear search problem
• Yet more on the linear search problem
• A general search game
• The return of the linear search problem
• The Revenge of the Linear Search Problem
• Minimax Solutions for Linear Search Problems
• On the Optimality of the Exponential Functions for Some Minimax Problems
• Optimal Constructions of Hybrid Algorithms
• An optimal on-line algorithm for metrical task system
• Generalized streets revisited
• An Optimal Search Problem