3 papers
cs.CG2025
A note on non-crossing path partitions in the plane
Javier Tejel
In the paper ``Lower bounds on the number of crossing-free subgraphs of '' (Computational Geometry 16 (2000), 211-221), it is shown that a double chain of points in the pl…
cs.CG2025
Characterizing and Recognizing Twistedness
Oswin Aichholzer, Alfredo GarcÃa, Javier Tejel +2
In a simple drawing of a graph, any two edges intersect in at most one point (either a common endpoint or a proper crossing). A simple drawing is generalized twisted if it fulfills…
cs.CG2024
Maximum rectilinear convex subsets
Hernán González-Aguilar, David Orden, Pablo Pérez-Lantero +4
Let be a set of points in the plane. We consider a variation of the classical ErdÅs-Szekeres problem, presenting efficient algorithms with running time and $O(n^2…