相关论文: Finding an ordinary conic and an ordinary hyperpla…

Given a set $P$ of $n$ points in the plane, its separability is the minimum number of lines needed to separate all its pairs of points from each other. We show that the minimum number of lines needed to separate $n$ points, picked randomly…

A pseudoline is a homeomorphic image of the real line in the plane so that its complement is disconnected. An arrangement of pseudolines is a set of pseudolines in which every two cross exactly once. A drawing of a graph is pseudolinear if…

In [Sharir and Solomon 2015], Sharir and Solomon showed that the number of incidences between $m$ distinct points and $n$ distinct lines in $\mathbb R^4$ is $$O^*\left(m^{2/5}n^{4/5}+ m^{1/2}n^{1/2}q^{1/4} + m^{2/3}n^{1/3}s^{1/3} + m +…

We consider optimal route planning when the objective function is a general nonlinear and non-monotonic function. Such an objective models user behavior more accurately, for example, when a user is risk-averse, or the utility function needs…

We introduce space-efficient plane-sweep algorithms for basic planar geometric problems. It is assumed that the input is in a read-only array of $n$ items and that the available workspace is $\Theta(s)$ bits, where $\lg n \leq s \leq n…

In this paper, we construct an infinite series of line arrangements in characteristic two, each featuring only triple intersection points. This finding challenges the existing conjecture that suggests the existence of only a finite number…

This paper begins by extending the notion of a combinatorial configuration of points and lines to a combinatorial configuration of points and planes that we refer to as configurations of order $2$. We then proceed to investigate a further…

A set of n non-collinear points in the Euclidean plane defines at least n different lines. Chen and Chv\'atal in 2008 conjectured that the same results is true in metric spaces for an adequate definition of line. More recently, this…

For polyhedral convex cones in ${\mathbb R}^d$, we give a proof for the conic kinematic formula for conic curvature measures, which avoids the use of characterization theorems. For the random cones defined as typical cones of an isotropic…

We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries and their generalizations or elliptic semiplanes are constructed.…

We present an algorithm for detecting basepoints of linear series of curves in the plane. Moreover, we give an algorithm for constructing a linear series of curves in the plane for given basepoints. The underlying method of these algorithms…

Let $P$ be a collection of $n$ points moving along pseudo-algebraic trajectories in the plane. One of the hardest open problems in combinatorial and computational geometry is to obtain a nearly quadratic upper bound, or at least a subcubic…

We consider the following classification problem: Given a population of individuals characterized by a set of attributes represented as a vector in ${\mathbb R}^N$, the goal is to find a hyperplane in ${\mathbb R}^N$ that separates two sets…

The main goal of this paper is to present a new algorithm bounding the regularity and ``alpha'' (the lowest degree of existing hypersurface) of a linear system of hypersurfaces (in $\mathbb P^n$) passing through multiple points in general…

Let S be a smooth algebraic surface satisfying the following property: H^i(\oc_S(C))=0 (i=1,2) for any irreducible and reduced curve C of S. The aim of this paper is to provide a characterization of special linear systems on S which are…

Intersection algorithms are very important in computation of geometrical problems. Algorithms for a line intersection with linear or quadratic surfaces are quite efficient. However, algorithms for a line intersection with other surfaces are…

We describe an algorithm for computing the separating common tangents of two simple polygons using linear time and only constant workspace. A tangent of a polygon is a line touching the polygon such that all of the polygon lies to the same…

We study spaces of lines that meet a smooth hypersurface X in P^n to high order. As an application, we give a polynomial upper bound on the number of planes contained in a smooth degree d hypersurface in P^5 and provide a proof of a result…

We consider the problem of planning a collision-free path of a robot in the presence of risk zones. The robot is allowed to travel in these zones but is penalized in a super-linear fashion for consecutive accumulative time spent there. We…

Five equivalence classes had been found for systems of two second-order ordinary differential equations, transformable to linear equations (linearizable systems) by a change of variables. An "optimal (or simplest) canonical form" of linear…