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

Discrete Applied Mathematics

Volumn 93, Issue 1, 1999, Pages 67-73

  Hipke, Christoph ^a   Icking, Christian ^b   Klein, Rolf ^b   Langetepe, Elmar ^b  

^a UNIVERSITY OF FREIBURG   (Germany)

^b UNIVERSITY OF HAGEN   (Germany)

Author keywords

Autonomous vehicle; Competitive analysis; Computational geometry; Doubling; Navigation; On line algorithm; Robotics

Indexed keywords

EID: 0004517896     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00009-8     Document Type: Article

References (7)

1. R. Baeza-Yates, J. Culberson, G. Rawlins, Searching in the plane, Inform, and Comput. 106 (1993) 234-252.
2. A. Blum, P. Raghavan, B. Schieber, Navigating in unfamiliar geometric terrain, SIAM J. Comput. 26 (1) (1997) 110-137.
3. C. Icking, R. Klein, Competitive strategies for autonomous systems, in: H. Bunke, T. Kanade, H. Noltemeier (Eds.), Modelling and Planning for Sensor Based Intelligent Robot Systems, World Scientific, Singapore, 1995, pp. 23-40.
4. B. Kalyanasundaram, K. Pruhs, A competitive analysis of algorithms for searching unknown scenes, Comput. Geom. Theory Appl. 3 (1993) 139-155.
5. M.-Y. Kao, J.H. Reif, S.R. Tate, Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem, Inform. and Comput. 133 (1) (1996) 62-80.
6. R. Klein, Algorithmische Geometrie, Addison-Wesley, Bonn, 1997.
7. A. López-Ortiz, S. Schuierer, Position-independent near optimal searching and on-line recognition in star polygons, Proceedings of the 13th Annual ACM Symposium on Computational Geometry, 1997, pp. 445-447.