Image de couverture de livre

Filming runners with drones is hard

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Díaz-Báñez, José-Miguel, Fabila-Monroy, Ruy
Format:	Preprint
Publié:	2024
Sujets:	Computational Geometry
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

The Euclidean $k$-Matching Problem is NP-hard
par: Díaz-Báñez, José-Miguel, et autres
Publié: (2025)

On the rectilinear crossing number of complete balanced multipartite graphs and layered graphs
par: Fabila-Monroy, Ruy, et autres
Publié: (2024)

Computing optimal trajectories for a tethered pursuer
par: Barrera-Vicent, Aurelio, et autres
Publié: (2025)

Optimizing Line Segment Inspection with Limited-Range Drones
par: Díaz-Báñez, José-Miguel, et autres
Publié: (2026)

On the hardness of finding normal surfaces
par: Burton, Benjamin A., et autres
Publié: (2019)

Optimal covering of rectangular grid graphs with tours of constrained length
par: Bereg, Sergey, et autres
Publié: (2025)

Reconfiguration of unit squares and disks: PSPACE-hardness in simple settings
par: Abrahamsen, Mikkel, et autres
Publié: (2024)

The Point-Boundary Art Gallery Problem is $\exists\mathbb{R}$-hard
par: Stade, Jack
Publié: (2022)

Computing $p$-presentation distances is hard
par: Bjerkevik, Håvard Bakke, et autres
Publié: (2024)

An elementary proof that linking problems are hard
par: Cheng, Shannon, et autres
Publié: (2025)

Freeze-Tag is NP-hard in 2D with $L_1$ distance
par: Silva, Lucas de Oliveira, et autres
Publié: (2025)

Shellability is hard even for balls
par: Paták, Pavel, et autres
Publié: (2022)

Computing the EHZ capacity is NP-hard
par: Leipold, Karla, et autres
Publié: (2024)

Deep lattice points in zonotopes, lonely runners, and lonely rabbits
par: Beck, Matthias, et autres
Publié: (2023)

Pizza Sharing is PPA-hard
par: Deligkas, Argyrios, et autres
Publié: (2020)

Ortho-unit polygons can be guarded with at most $\lfloor \frac{n-4}{8} \rfloor$ guards
par: Díaz-Báñez, J. M., et autres
Publié: (2022)

NP-hardness and a PTAS for the Euclidean Steiner Line Problem
par: Bartlmae, Simon, et autres
Publié: (2024)

On the Automorphism Group of Token Graphs of Complete Bipartite Graphs
par: Fabila-Monroy, Ruy, et autres
Publié: (2023)

Domination number of Token Graphs
par: Fabila-Monroy, Ruy, et autres
Publié: (2025)

Soap Film-inspired Subdivisional Lattice Structure Construction
par: Luo, Guoyue, et autres
Publié: (2025)

Stokes' Theorem for Smooth Singular Cubes in Lean 4: True Pullback, Bridges to mathlib4, and Chain-Level d^2=0
par: Hulak, David B., et autres
Publié: (2026)

Crossing Number is NP-hard for Constant Path-width (and Tree-width)
par: Hliněný, Petr, et autres
Publié: (2024)

Constant curvature hypersurfaces of cylinders over space forms
par: Carvalho, Arnando, et autres
Publié: (2025)

On a class of hypersurfaces of a product of two space forms
par: Carvalho, Arnando, et autres
Publié: (2026)

Efficient Neighbourhood Search in 3D Point Clouds Through Space-Filling Curves and Linear Octrees
par: Viñambres, Pablo D., et autres
Publié: (2026)

Relative position of a parabola or a hyperbola and an ellipse without computing intersection points
par: Caravantes, Jorge, et autres
Publié: (2025)

Numerical characterization of the hard Lefschetz classes of dimension two, II: supercritical collections of free divisor classes
par: Hu, Jiajun, et autres
Publié: (2025)

Complementary bodies in sphere packing
par: Kuchel, Philip W.
Publié: (2025)

Deciding Connectivity in Symmetric Semi-Algebraic Sets
par: Riener, Cordian., et autres
Publié: (2025)

On Saxe's theorems about the complexity of the Distance Geometry Problem
par: Kupperschmitt, Maël, et autres
Publié: (2025)

On The Heine-Borel Property and Minimum Enclosing Balls
par: Banerjee, Hridhaan, et autres
Publié: (2024)

The distance function to a finite set is a topological Morse function
par: Arnal, Charles
Publié: (2024)

Tiling with Three Polygons is Undecidable
par: Demaine, Erik D., et autres
Publié: (2024)

A (Hilbert) geometric algorithm for approximating the halfspace depth of a point in a convex body
par: Gupta, Purvi, et autres
Publié: (2024)

Non-Euclidean Erdős-Anning Theorems
par: Eppstein, David
Publié: (2024)

On Computing Elastic Shape Distances between Curves in d-dimensional Space
par: Bernal, Javier, et autres
Publié: (2024)

A Proper Definition of Higher Order Rigidity
par: Tachi, Tomohiro
Publié: (2024)

Computation of symmetries of rational surfaces
par: Alcázar, Juan Juan Gerardo, et autres
Publié: (2024)

Lipschitz Decompositions of Finite $\ell_{p}$ Metrics
par: Krauthgamer, Robert, et autres
Publié: (2025)

Better Late than Never: the Complexity of Arrangements of Polyhedra
par: Aronov, Boris, et autres
Publié: (2025)