AI Chat AI Image Generator AI Video Text to Speech

Escaping an Infinitude of Lions

12/21/2020

∙

by Mikkel Abrahamsen, et al.

∙

∙

We consider the following game played in the Euclidean plane: There is any countable set of unit speed lions and one fast man who can run with speed 1+ε for some value ε>0. Can the man survive? We answer the question in the affirmative for any ε>0.

Mikkel Abrahamsen
19 publications
Jacob Holm
11 publications
Eva Rotenberg
23 publications
Christian Wulff-Nilsen
16 publications

page 1

page 2

page 3

page 4

research

∙ 05/06/2019

Geometric Firefighting in the Half-plane

In 2006, Alberto Bressan suggested the following problem. Suppose a circ...

0 Sang-Sub Kim, et al. ∙

research

∙ 01/13/2023

Recognizing Unit Disk Graphs in Hyperbolic Geometry is ∃ℝ-Complete

A graph G is a (Euclidean) unit disk graph if it is the intersection gra...

0 Nicholas Bieker, et al. ∙

research

∙ 07/12/2023

Faster Control Plane Experimentation with Horse

Simulation and emulation are popular approaches for experimentation in C...

0 Eder Leao Fernandes, et al. ∙

research

∙ 03/20/2023

On Intersecting Polygons

Consider two regions in the plane, bounded by an n-gon and an m-gon, res...

0 Kada Williams, et al. ∙

research

∙ 10/01/2018

On the density of sets of the Euclidean plane avoiding distance 1

A subset A ⊂ R^2 is said to avoid distance 1 if: ∀ x,y ∈ A, x-y _2 ≠ 1....

0 Thomas Bellitto, et al. ∙

research

∙ 06/07/2010

Game Information System

In this Information system age many organizations consider information s...

0 Spits Warnars H. L. H, et al. ∙

research

∙ 01/08/2013

Apollonian Circumcircles of IFS Fractals

Euclidean triangles and IFS fractals seem to be disparate geometrical co...

0 József Vass, et al. ∙