Related papers: Line problems in nonlinear computational geometry

It is shown that there exist non-singular cubic surfaces in CP^3 containing 5 twistor lines. This is the maximum number of twistor fibres that a non-singular cubic can contain. Cubic surfaces in CP^3 with 5 twistor lines are classified up…

We discover suprising connections between three seemingly different problems: finding right triangles with rational sides in a non-Euclidean geometry, finding three integers such that the difference of the squares of any two is a square,…

Linear Geometry studies geometric properties which can be expressed via the notion of a line. All information about lines is encoded in a ternary relation called a line relation. A set endowed with a line relation is called a liner. So,…

We introduce a new formalism and a number of new results in the context of geometric computational vision. The classical scope of the research in geometric computer vision is essentially limited to static configurations of points and lines…

This paper deals with surfaces with many lines. It is well-known that a cubic contains 27 of them and that the maximal number for a quartic is 64. In higher degree the question remains open. Here we study classical and new constructions of…

We revisit the fundamental problem of assigning intersection multiplicities to subsets of solutions of (square) systems of polynomials. Severi [Ann. Mat. Pura Appl. 26 (4), 1947] suggested an intuitive dynamic solution to this problem which…

New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…

An ordinary plane of a finite set of points in real 3-space with no three collinear is a plane intersecting the set in exactly three points. We prove a structure theorem for sets of points spanning few ordinary planes. Our proof relies on…

Over the complex numbers, there are 92 plane conics meeting 8 general lines in projective 3-space. Using the Euler class and local degree from motivic homotopy theory, we give an enriched version of this result over any perfect field. This…

Given $n$ pairwise openly disjoint triangles in 3-space, their vertical depth relation may contain cycles. We show that, for any $\varepsilon>0$, the triangles can be cut into $O(n^{3/2+\varepsilon})$ connected semi-algebraic pieces, whose…

A set $L$ of straight lines and a set $P$ of points in the Euclidean plane define an arrangement $\mathcal{A}$ = ($L$, $P$) of construction lines and registration marks, if and only if: (1) any point in $P$ is a point of intersection of at…

Computing the diameter of the intersection graphs of objects is a basic problem in computational geometry. Previous works showed that the complexity of computing the diameter mainly depends on the object types: for unit disks and squares in…

The solution of Apollonius' problem on constructing a circle (line), tangent to three given circles (lines), is presented in terms of oriented circles and inversive invariants. Tangency is understood as the coincidence of tangent vectors at…

We study hyperplane sections of smooth polarized $K3$-surfaces that split into unions of lines. We describe the dual adjacency graphs of such sections and find sharp upper bounds on their number. In most cases (starting from degree $6$), we…

We consider the complexity of the recognition problem for two families of combinatorial structures. A graph $G=(V,E)$ is said to be an intersection graph of lines in space if every $v\in V$ can be mapped to a straight line $\ell (v)$ in…

A new line clipping algorithm against convex polyhedron in E3 with an expected complexity O(1) is presented. The suggested approach is based on two orthogonal projections to E2 co-ordinate system and on pre-processing of the given…

Let $L$ be a sequence $(\ell_1,\ell_2,\ldots,\ell_n)$ of $n$ lines in $\mathbb{C}^3$. We define the {\it intersection graph} $G_L=([n],E)$ of $L$, where $[n]:=\{1,\ldots, n\}$, and with $\{i,j\}\in E$ if and only if $i\neq j$ and the…

A famous configuration of 27 lines on a non-singular cubic surface in $\mathbb P^3$ contains remarkable subconfigurations, and in particular the ones formed by six pairwise disjoint lines. We study such six-line configurations in the case…

We investigate the number of straight lines contained in a K3 quartic surface \(X\) defined over an algebraically closed field of characteristic 3. We prove that if \(X\) contains 112 lines, then \(X\) is projectively equivalent to the…

We say that a line in $\mathbb P^{n+1}_k$ is osculating to a hypersurface $Y$ if they meet with contact order $n+1$. When $k=\mathbb C$, it is known that through a fixed point of $Y$, there are exactly $n!$ of such lines. Under some parity…