中文
相关论文

相关论文: On the Density of Iterated Line Segment Intersecti…

200 篇论文

Since ancient times mathematicians consider geometrical objects with integral side lengths. We consider plane integral point sets $\mathcal{P}$, which are sets of $n$ points in the plane with pairwise integral distances where not all the…

组合数学 · 数学 2008-04-09 Sascha Kurz , Alfred Wassermann

For a given shape $S$ in the plane, one can ask what is the lowest possible density of a point set $P$ that pierces ("intersects", "hits") all translates of $S$. This is equivalent to determining the covering density of $S$ and as such is…

计算几何 · 计算机科学 2021-08-27 Adrian Dumitrescu , Josef Tkadlec

Let $P$ be a set of $n$ points in general position in the plane. Let $R$ be a set of $n$ points disjoint from $P$ such that for every $x,y \in P$ the line through $x$ and $y$ contains a point in $R$ outside of the segment delimited by $x$…

组合数学 · 数学 2019-08-20 Chaya Keller , Rom Pinchasi

In this note we consider two simplicial arrangements of lines and ideals $I$ of intersection points of these lines. There are $127$ intersection points in both cases and the numbers $t_i$ of points lying on exactly $i$ configuration lines…

代数几何 · 数学 2018-12-12 Marek Janasz , Magdalena Lampa-Baczyńska , Grzegorz Malara

This paper attacks the following problem. We are given a large number $N$ of rectangles in the plane, each with horizontal and vertical sides, and also a number $r<N$. The given list of $N$ rectangles may contain duplicates. The problem is…

数据结构与算法 · 计算机科学 2017-03-28 David B. A. Epstein , Mike Paterson

Using the Semple bundle construction, we derive an intersection-theoretic formula for the number of simultaneous contacts of specified orders between members of a generic family of degree $d$ plane curves and finitely many fixed curves. The…

alg-geom · 数学 2008-02-03 Susan Jane Colley , Gary Kennedy

Ingrid Carbone introduced the notion of so-called LS-sequences of points, which are obtained by a generalization of Kakutani's interval splitting procedure. Under an appropriate choice of the parameters $L$ and $S$, such sequences have low…

数论 · 数学 2012-11-16 Christoph Aistleitner , Markus Hofer , Volker Ziegler

Two subsets $A, B$ of the plane are betweenness isomorphic if there is a bijection $f\colon A\to B$ such that, for every $x,y,z\in A$, the point $f(z)$ lies on the line segment connecting $f(x)$ and $f(y)$ if and only if $z$ lies on the…

度量几何 · 数学 2024-12-04 Martin Doležal , Jan Kolář , Janusz Morawiec

The spread of a finite set of points is the ratio between the longest and shortest pairwise distances. We prove that the Delaunay triangulation of any set of n points in R^3 with spread D has complexity O(D^3). This bound is tight in the…

计算几何 · 计算机科学 2007-05-23 Jeff Erickson

A well-known theorem in plane geometry states that any set of $n$ non-collinear points in the plane determines at least $n$ lines. Chen and Chv\'{a}tal asked whether an analogous statement holds within the framework of finite metric spaces,…

组合数学 · 数学 2021-07-15 Ida Kantor

For an angle $\alpha\in (0,\pi)$, we consider plane graphs and multigraphs in which the edges are either (i) one-bend polylines with an angle $\alpha$ between the two edge segments, or (ii) circular arcs of central angle $2(\pi-\alpha)$. We…

离散数学 · 计算机科学 2023-11-28 Csaba D. Tóth

For a finite set $P$ of points in the plane in general position, a \emph{crossing family} of size $k$ in $P$ is a collection of $k$ line segments with endpoints in $P$ that are pairwise crossing. It is a long-standing open problem to…

组合数学 · 数学 2025-08-26 Todor Antić , Martin Balko , Birgit Vogtenhuber

Given a sequence of positive integers $p = (p_1, . . ., p_n)$, let $S_p$ denote the family of all sequences of positive integers $x = (x_1,...,x_n)$ such that $x_i \le p_i$ for all $i$. Two families of sequences (or vectors), $A,B \subseteq…

组合数学 · 数学 2015-02-02 János Pach , Gábor Tardos

Let $S$ be a set of $n$ points in general position in the plane. Join every pair of points in $S$ with a straight line segment. Let $\overline{cr}(S)$ be number of pairs of these edges that intersect in their interior. Suppose that this…

计算几何 · 计算机科学 2017-11-15 Frank Duque , Ruy Fabila-Monroy

Given a set of points in the plane, we want to establish a connection network between these points that consists of several disjoint layers. Motivated by sensor networks, we want that each layer is spanning and plane, and that no edge is…

A set of sets is called a family. Two families $\mathcal{A}$ and $\mathcal{B}$ of sets are said to be cross-intersecting if each member of $\mathcal{A}$ intersects each member of $\mathcal{B}$. For any two integers $n$ and $k$ with $1 \leq…

组合数学 · 数学 2021-01-25 Peter Borg , Carl Feghali

A curve in the plane is $x$-monotone if every vertical line intersects it at most once. A family of curves are called pseudo-segments if every pair of them have at most one point in common. We construct $2^{\Omega(n^{4/3})}$ families, each…

组合数学 · 数学 2026-01-12 Jacob Fox , Janos Pach , Andrew Suk

Let $S$ be a set of $n$ points in the plane in general position. Two line segments connecting pairs of points of $S$ cross if they have an interior point in common. Two vertex disjoint geometric graphs with vertices in $S$ cross if there…

We study sequences of partitions of the unit interval into subintervals, starting from the trivial partition, in which each partition is obtained from the one before by splitting its subintervals in two, according to a given rule, and then…

概率论 · 数学 2026-03-30 Serge Cohen , James Norris , Michel Pain , Gennady Samorodnitsky

An L-shape is the union of a horizontal and a vertical segment with a common endpoint. These come in four rotations: L, \Gamma, LE{} and \eeG. A $k$-bend path is a simple path in the plane, whose direction changes $k$ times from horizontal…

组合数学 · 数学 2016-01-08 Stefan Felsner , Kolja Knauer , George B. Mertzios , Torsten Ueckerdt