Cover Image

A note on non-crossing path partitions in the plane

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Tejel, Javier
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

Total domination in plane triangulations
by: Claverol, M., et al.
Published: (2020)

Rainbow polygons for colored point sets in the plane
by: Flores-Peñaloza, David, et al.
Published: (2020)

Characterizing and Recognizing Twistedness
by: Aichholzer, Oswin, et al.
Published: (2025)

Unavoidable patterns and plane paths in dense topological graphs
by: Keszegh, Balázs, et al.
Published: (2025)

Maximum rectilinear convex subsets
by: González-Aguilar, Hernán, et al.
Published: (2019)

Computing shortest paths amid non-overlapping weighted disks
by: Bose, Prosenjit, et al.
Published: (2024)

Algorithms for orthogonal partitioning into four parts
by: Fakhrutdinov, Alexey, et al.
Published: (2025)

Crossing and non-crossing families
by: Antić, Todor, et al.
Published: (2025)

Wall crossing for K-moduli spaces of plane curves
by: Ascher, Kenneth, et al.
Published: (2019)

A note on cubic fourfolds containing several planes
by: Hartlieb, Moritz
Published: (2025)

Hypercube drawings with no long plane paths
by: Antić, Todor, et al.
Published: (2026)

On the orthogonal Grünbaum partition problem in dimension three
by: Maldonado, Gerardo L., et al.
Published: (2024)

Balanced TSP partitioning
by: Berendsohn, Benjamin Aram, et al.
Published: (2025)

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

Non-crossing partitions for exceptional hereditary curves
by: Baumeister, Barbara, et al.
Published: (2025)

Tree covers of size $2$ for the Euclidean plane
by: Bikeev, Artur, et al.
Published: (2025)

On approximating shortest paths in weighted triangular tessellations
by: Bose, Prosenjit, et al.
Published: (2021)

An inexact matching approach for the comparison of plane curves with general elastic metrics
by: Sukurdeep, Yashil, et al.
Published: (2020)

Chasing puppies on orthogonal straight-line plane graphs
by: Ockenfels, Johanna, et al.
Published: (2025)

Garment numbers of bi-colored point sets in the plane
by: Aichholzer, Oswin, et al.
Published: (2026)

Approximating shortest paths in weighted square and hexagonal meshes
by: Bose, Prosenjit, et al.
Published: (2024)

Covering half-grids with lines and planes
by: Bishnoi, Anurag, et al.
Published: (2025)

A note on Erdős's mysterious remark
by: Kovács, Zoltán
Published: (2024)

Linear time single-source shortest path algorithms in Euclidean graph classes
by: Gudmundsson, Joachim, et al.
Published: (2026)

What induces plane structures in complete graph drawings?
by: Weinberger, Alexandra, et al.
Published: (2026)

Rapid mixing of the flip chain over non-crossing spanning trees
by: Anand, Konrad, et al.
Published: (2024)

A note on the possibility of a motion without crossing a given subset
by: Mirzaie, Reza
Published: (2025)

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

UAV survey coverage path planning of complex regions containing exclusion zones
by: Shahid, Shadman Tajwar, et al.
Published: (2024)

Degenerate crossing number and signed reversal distance
by: Fuladi, Niloufar, et al.
Published: (2023)

Strength and partition rank under limits and field extensions
by: Bik, Arthur, et al.
Published: (2025)

Existence of a non-standard isoperimetric triple partition
by: Novaga, Matteo, et al.
Published: (2025)

A characterisation of Euclidean normed planes via bisectors
by: Sánchez, Javier Cabello, et al.
Published: (2024)

The maximum number of digons formed by pairwise crossing pseudocircles
by: Ackerman, Eyal, et al.
Published: (2024)

Online Competitive Searching for Rays in the Half-plane
by: Langetepe, Elmar, et al.
Published: (2025)

An Optimal Algorithm for Half-plane Hitting Set
by: Liu, Gang, et al.
Published: (2025)

Sublevels in arrangements and the spherical arc crossing number of complete graphs
by: Streltsova, Elizaveta, et al.
Published: (2025)

Packing unequal disks in the Euclidean plane
by: Fernique, Thomas
Published: (2023)

Parameterized and approximation algorithms for coverings points with segments in the plane
by: Kowalska, Katarzyna, et al.
Published: (2024)

A fast algorithm for computing a planar support for non-piercing rectangles
by: Pal, Ambar, et al.
Published: (2024)