Online search for a hyperplane in high-dimensional Euclidean space

DOI10.1016/J.IPL.2022.106262MaRDI QIDQ2671802zbMATH OpenOpenAlexWikidataFDO

Authors Ruben Hoeksma, Sándor Kisfaludi-Bak, Kevin Schewior, Antonios Foivos Antoniadis

Publication date 3 June 2022

Published in Information Processing Letters (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2109.04340

zbMATH Keywords

computational geometrycow-path problemon-line algorithmsonline search problemsphere inspection

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• A nearly tight lower bound for the d-dimensional cow-path problem
• On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
• Searching for an axis-parallel shoreline
• The 3-server problem in the plane.
• Geometric two-server algorithms

Cites work

• Competitive snoopy caching
• Finding the shortest watchman route in a simple polygon
• Note on Hamilton Circuits
• On the linear search problem
• Online maximum matching with recourse
• Search games
• Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
• Searching in the plane
• Shortest closed curve to inspect a sphere
• The traveling salesman problem for lines, balls, and planes
• Touring a sequence of polygons
• Yet more on the linear search problem

Cited in

(2)

• A nearly tight lower bound for the d-dimensional cow-path problem
• Shortest closed curve to contain a sphere in its convex hull

Describes a project that uses

Uses Software

• Spherical-Inspection2

This page was built for publication: Online search for a hyperplane in high-dimensional Euclidean space

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