How to find a point on a line within a fixed distance

DOI10.1016/S0166-218X(99)00009-8zbMath0942.68131OpenAlexW2002890219MaRDI QIDQ1289022

Elmar Langetepe, Christian Icking, Rolf Klein, Christoph Hipke

Publication date: 24 May 1999

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00009-8

zbMATH Keywords

competitive analysis

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Artificial intelligence for robotics (68T40)

Related Items (13)

Competitive search in a network ⋮ Best-of-both-worlds analysis of online search ⋮ Weighted online search ⋮ Deterministic treasure hunt and rendezvous in arbitrary connected graphs ⋮ Searching for an axis-parallel shoreline ⋮ Online algorithms for searching and exploration in the plane ⋮ Lower bounds in on-line geometric searching ⋮ The ultimate strategy to search on \(m\) rays? ⋮ LOWER BOUNDS FOR STREETS AND GENERALIZED STREETS ⋮ Unnamed Item ⋮ Online searching with turn cost ⋮ Searching on a line: a complete characterization of the optimal solution ⋮ Competitive Searching for a Line on a Line Arrangement.

Cites Work

• Unnamed Item
• A competitive analysis of algorithms for searching unknown scenes
• Searching in the plane
• Modelling and Planning for Sensor Based Intelligent Robot Systems
• Navigating in Unfamiliar Geometric Terrain
• Position-independent near optimal searching and on-line recognition in star polygons

This page was built for publication: How to find a point on a line within a fixed distance