Negative Instance for the Edge Patrolling Beacon Problem

06/01/2020
by   Zachary Abel, et al.
0

Can an infinite-strength magnetic beacon always “catch” an iron ball, when the beacon is a point required to be remain nonstrictly outside a polygon, and the ball is a point always moving instantaneously and maximally toward the beacon subject to staying nonstrictly within the same polygon? Kouhestani and Rappaport [JCDCG 2017] gave an algorithm for determining whether a ball-capturing beacon strategy exists, while conjecturing that such a strategy always exists. We disprove this conjecture by constructing orthogonal and general-position polygons in which the ball and the beacon can never be united.

READ FULL TEXT

page 1

page 4

page 6

research
07/24/2023

On Maximizing the Distance to a Given Point over an Intersection of Balls II

In this paper the problem of maximizing the distance to a given fixed po...
research
12/28/2018

Generalization of the Ball-Collision Algorithm

In this paper we generalize the Ball-Collision Algorithm by Bernstein, L...
research
08/03/2022

FauxThrow: Exploring the Effects of Incorrect Point of Release in Throwing Motions

Our aim is to develop a better understanding of how the Point of Release...
research
07/20/2021

Monocular Visual Analysis for Electronic Line Calling of Tennis Games

Electronic Line Calling is an auxiliary referee system used for tennis m...
research
08/06/2022

Pitching strategy evaluation via stratified analysis using propensity score

Recent measurement technologies enable us to analyze baseball at higher ...
research
09/17/2019

Champion Team Paper: Dynamic Passing-Shooting Algorithm Based on CUDA of The RoboCup SSL 2019 Champion

ZJUNlict became the Small Size League Champion of RoboCup 2019 with 6 vi...

Please sign up or login with your details

Forgot password? Click here to reset