English
Related papers

Related papers: Collinearities in Kinetic Point Sets

200 papers

A long standing conjecture of Richter and Thomassen states that the total number of intersection points between any $n$ simple closed Jordan curves in the plane, so that any pair of them intersect and no three curves pass through the same…

Combinatorics · Mathematics 2014-12-23 János Pach , Natan Rubin , Gábor Tardos

A graph is $k$-planar if it can be drawn in the plane such that no edge is crossed more than $k$ times. While for $k=1$, optimal $1$-planar graphs, i.e., those with $n$ vertices and exactly $4n-8$ edges, have been completely characterized,…

Computational Geometry · Computer Science 2017-03-21 Michael A. Bekos , Michael Kaufmann , Chrysanthi N. Raftopoulou

P\'or and Wood conjectured that for all $k,l \ge 2$ there exists $n \ge 2$ with the following property: whenever $n$ points, no $l + 1$ of which are collinear, are chosen in the plane and each of them is assigned one of $k$ colours, then…

Combinatorics · Mathematics 2014-10-13 Vytautas Gruslys

Consider a plane graph G, drawn with straight lines. For every pair a,b of vertices of G, we compare the shortest-path distance between a and b in G (with Euclidean edge lengths) to their actual distance in the plane. The worst-case ratio…

Computational Geometry · Computer Science 2007-05-23 Rolf Klein , Martin Kutz

We show that the maximal number of singular moves required to pass between any two regularly homotopic planar or spherical curves with at most n crossings, grows quadratically with respect to n. Furthermore, this can be done with all curves…

Geometric Topology · Mathematics 2008-02-22 Tahl Nowik

We investigate the existence of closed polylines (also known as closed polygonal chains or self-crossing polygons) that intersect each of their edges the same number of times. The most general question in this corner of combinatorial…

Metric Geometry · Mathematics 2026-05-19 Dmitri Fomin

This contribution adds to the points on the <indeterminacy of special relativity> made by De Abreu and Guerra. We show that the Lorentz Transformation can be composed by the physical observations made in a frame K of events in a frame…

Classical Physics · Physics 2009-11-13 Chandru Iyer

Motivated by a path planning problem we consider the following procedure. Assume that we have two points $s$ and $t$ in the plane and take $\mathcal{K}=\emptyset$. At each step we add to $\mathcal{K}$ a compact convex set that does not…

Computational Geometry · Computer Science 2015-02-13 Sergio Cabello , Michael Kerber

The restricted planar elliptic three body problem models the motion of a massless body under the Newtonian gravitational force of the two other bodies, the primaries, which evolve in Keplerian ellipses. A trajectory is called oscillatory if…

Dynamical Systems · Mathematics 2016-08-08 Marcel Guardia , Pau Martín , Lara Sabbagh , Tere M. Seara

Metrics on the space of sets of trajectories are important for scientists in the field of computer vision, machine learning, robotics, and general artificial intelligence. However, existing notions of closeness between sets of trajectories…

Computer Vision and Pattern Recognition · Computer Science 2020-11-17 José Bento , Jia Jie Zhu

For pairs of knots K and J in the three-sphere, we consider the set of four-tuples of integers (g,x,y,z) for which there is a cobordism from K to J of genus g having x, y, and z, critical points of index 0, 1, and 2, respectively. We…

Geometric Topology · Mathematics 2023-12-19 Charles Livingston

For a set $Q$ of points in the plane and a real number $\delta \ge 0$, let $\mathbb{G}_\delta(Q)$ be the graph defined on $Q$ by connecting each pair of points at distance at most $\delta$. We consider the connectivity of…

Computational Geometry · Computer Science 2023-12-13 Sergio Cabello , David Gajser

For every pattern $P$, consisting of a finite set of points in the plane, $S_{P}(n,m)$ is defined as the largest number of similar copies of $P$ among sets of $n$ points in the plane without $m$ points on a line. A general construction,…

Combinatorics · Mathematics 2011-02-28 Bernardo M. Ábrego , Silvia Fernández-Merchant

A multigraph drawn in the plane is non-homotopic if no two edges connecting the same pair of vertices can be continuously deformed into each other without passing through a vertex, and is $k$-crossing if every pair of edges…

Combinatorics · Mathematics 2024-01-22 António Girão , Freddie Illingworth , Alex Scott , David R. Wood

We study the dynamics of three particles in a finite interval, in which two light particles are separated by a heavy ``piston'', with elastic collisions between particles but inelastic collisions between the light particles and the interval…

Statistical Mechanics · Physics 2009-11-11 P. I. Hurtado , S. Redner

We prove that if a continuous piecewise-smooth map on $\mathbb{R}^n$ is comprised of two linear functions, has a bounded orbit, and satisfies a certain non-degeneracy condition, then it has a fixed point. The result has important…

Dynamical Systems · Mathematics 2024-12-17 David J. W. Simpson

We show that the number of incidences between $m$ distinct points and $n$ distinct lines in ${\mathbb R}^4$ is $O\left(2^{c\sqrt{\log m}} (m^{2/5}n^{4/5}+m) + m^{1/2}n^{1/2}q^{1/4} + m^{2/3}n^{1/3}s^{1/3} + n\right)$, for a suitable…

Combinatorics · Mathematics 2015-03-26 Micha Sharir , Noam Solomon

This paper is devoted to the study of matter collineations of plane symmetric spacetimes (for a particular class of spacetimes) when the energy-momentum tensor is non-degenerate. There exists many interesting cases where we obtain proper…

General Relativity and Quantum Cosmology · Physics 2009-02-27 M. Sharif , Nousheen Ilyas

Let $P$ be a set of at most $n$ points and let $R$ be a set of at most $n$ geometric ranges, such as for example disks or rectangles, where each $p \in P$ has an associated supply $s_{p} > 0$, and each $r \in R$ has an associated demand…

Computational Geometry · Computer Science 2023-12-05 Sergio Cabello , Siu-Wing Cheng , Otfried Cheong , Christian Knauer

We consider a periodic planar Lorentz process with strictly convex obstacles and finite horizon. This process describes the displacement of a particle moving in the plane with unit speed and with elastic reflection on the obstacles. We call…

Dynamical Systems · Mathematics 2013-03-14 Francoise Pene