Cover Image

Computing optimal trajectories for a tethered pursuer

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Barrera-Vicent, Aurelio, Díaz-Báñez, José Miguel, Rodríguez, Fabio, Sánchez-Canales, Vanesa
Format:	Preprint
Published:	2025
Subjects:	Computational Geometry
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Filming runners with drones is hard
by: Díaz-Báñez, José-Miguel, et al.
Published: (2024)

Optimal covering of rectangular grid graphs with tours of constrained length
by: Bereg, Sergey, et al.
Published: (2025)

The Euclidean $k$-Matching Problem is NP-hard
by: Díaz-Báñez, José-Miguel, et al.
Published: (2025)

Optimizing Line Segment Inspection with Limited-Range Drones
by: Díaz-Báñez, José-Miguel, et al.
Published: (2026)

MASPA: An efficient strategy for path planning with a tethered marsupial robotics system
by: Capitán, Jesús, et al.
Published: (2024)

Computation of symmetries of rational surfaces
by: Alcázar, Juan Juan Gerardo, et al.
Published: (2024)

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

Computing the Gromov--Hausdorff distance using gradient methods
by: Oles, Vladyslav
Published: (2023)

A Python implementation of some geometric tools on Kendall 3D shape space for practical applications
by: Valero, Jorge, et al.
Published: (2026)

On Computing Elastic Shape Distances between Curves in d-dimensional Space
by: Bernal, Javier, et al.
Published: (2024)

Computing Arrangements of Hypersurfaces
by: Breiding, Paul, et al.
Published: (2024)

Computing Diffusion Geometry
by: Jones, Iolo, et al.
Published: (2026)

Computing Planar Convex Hulls with a Promise
by: Aghamolaei, Sepideh, et al.
Published: (2026)

Computing the Girth of a Segment Intersection Graph
by: Chan, Timothy M., et al.
Published: (2026)

Computing Topological Transition Sets for Line-Line-Circle Trisectors in $R^3$
by: Park, Eunku
Published: (2026)

Computing distances and means on manifolds with a metric-constrained Eikonal approach
by: Kelshaw, Daniel, et al.
Published: (2024)

Computing Enclosing Depth
by: Gärtner, Bernd, et al.
Published: (2024)

A note on optimal degree-three spanners of the square lattice
by: Galant, Damien, et al.
Published: (2020)

A Practical Approach for Computing the Diameter of a Point Set
by: Har-Peled, Sariel
Published: (2025)

Computing the Intrinsic Delaunay Triangulation of a Closed Polyhedral Surface
by: Dubois, Loïc
Published: (2026)

Computing Oriented Spanners and their Dilation
by: Buchin, Kevin, et al.
Published: (2024)

Convexity of near-optimal orthogonal-pair-free sets on the unit sphere
by: Mudgal, Apurva
Published: (2024)

Algorithms for Dynamic Computational Geometry with Applications
by: Boxer, Laurence
Published: (2025)

Efficient Computation of the Directional Extremal Boundary of a Union of Equal-Radius Circles
by: Gribov, Alexander
Published: (2025)

A Combinatorial Proof of Universal Optimality for Computing a Planar Convex Hull
by: van der Hoog, Ivor, et al.
Published: (2025)

Computational Geometry with Probabilistically Noisy Primitive Operations
by: Eppstein, David, et al.
Published: (2025)

Robust Geometric Predicates for Bivariate Computational Topology
by: Hristov, Petar, et al.
Published: (2025)

Recursive Computation of Path Homology for Stratified Digraphs
by: Zhu, Zhengtong, et al.
Published: (2024)

Computational aspects of disks enclosing many points
by: Bose, Prosenjit, et al.
Published: (2026)

Taming Horizontal Instability in Merge Trees: On the Computation of a Comprehensive Deformation-based Edit Distance
by: Wetzels, Florian, et al.
Published: (2023)

Swept Volume Computation with Enhanced Geometric Detail Preservation
by: Wang, Pengfei, et al.
Published: (2025)

Computing Non-Obtuse Triangulations with Few Steiner Points
by: Abrahamsen, Mikkel, et al.
Published: (2025)

Computing the Bottleneck Distance between Persistent Homology Transforms
by: Kerber, Michael, et al.
Published: (2025)

GPU-Accelerated Computation of Vietoris-Rips Persistence Barcodes
by: Zhang, Simon, et al.
Published: (2020)

Charting the Diameter Computation Landscape on Intersection Graphs in the Plane
by: Chan, Timothy M., et al.
Published: (2026)

An Optimal Algorithm for Computing Many Faces in Line Arrangements
by: Wang, Haitao
Published: (2026)

Constant Workspace Algorithms for Computing Relative Hulls in the Plane
by: Chhabra, Himanshu, et al.
Published: (2024)

Computing $k$-Crossing Visibility through $k$-levels
by: Duque, Frank
Published: (2023)

Passage-traversing optimal path planning with sampling-based algorithms
by: Huang, Jing, et al.
Published: (2025)

Computing braids from approximate data
by: Guillemot, Alexandre, et al.
Published: (2026)