Related papers: Line problems in nonlinear computational geometry
Some of recent developments, including recent results, ideas, techniques, and approaches, in the study of degenerate partial differential equations are surveyed and analyzed. Several examples of nonlinear degenerate, even mixed, partial…
We consider configurations of lines in 3-space with incidences prescribed by a graph. This defines a subvariety in a product of Grassmannians. Leveraging a connection with rigidity theory in the plane, for any graph, we determine the…
An ordinary circle of a set $P$ of $n$ points in the plane is defined as a circle that contains exactly three points of $P$. We show that if $P$ is not contained in a line or a circle, then $P$ spans at least $\frac{1}{4}n^2 - O(n)$…
Let $\mathcal{A}$ be a set of straight lines in the plane (or planes in $\mathbb{R}^3$). The $k$-crossing visibility of a point $p$ on $\mathcal{A}$ is the set $Q$ of points in the elements of $\mathcal{A}$ such that the segment $pq$, where…
The space of shapes of a polyhedron with given total angles less than 2\pi at each of its n vertices has a Kaehler metric, locally isometric to complex hyperbolic space CH^{n-3}. The metric is not complete: collisions between vertices take…
The correspondence between 2-parameter families of oriented lines in ${\Bbb{R}}^3$ and surfaces in $T{\Bbb{P}}^1$ is studied, and the geometric properties of the lines are related to the complex geometry of the surface. Congruences…
A quadric in $\R P^3$ cuts a curve of degree 6 on a cubic surface in $\R P^3$. The papers classifies the nonsingular curves cut in this way on non-singular cubic surfaces up to homeomorphism. Two issues new in the study related to the first…
It is proven that for any topological or analytical types of isolated singular points of plane curves, there exists a non-real irreducible plane algebraic curve of degree $d$ which goes through $d^2$ real distinct points and has imaginary…
Certain topics on polygons are extended from Euclidean to hyperbolic geometry. This first part deals with uniqueness and existence of cocyclic polygons with prescribed sidelengths. The non-Euclidean versions are more difficult due to the…
We study the set of tangent limits at a given point to a set definable in any o-minimal structure by characterizing the set of exceptional rays in the tangent cone to the set at that point and investigating the set of tangent limits along…
We review recent developments in the arithmetic of K3 surfaces. Our focus lies on aspects of modularity, Picard number and rational points. Throughout we emphasise connections to geometry.
A family of lines through the origin in Euclidean space is called equiangular if any pair of lines defines the same angle. The problem of estimating the maximum cardinality of such a family in $\mathbb{R}^n$ was extensively studied for the…
Let k be a field of characteristic other than 2,3. We prove that there are no geometrically smooth quartic surfaces in IP^3 with more than 64 lines. As a key step, we derive the sharp bound that any line meets at most 20 other lines on a…
We study a class of elliptic problems, involving a $k$-Hessian and a very fast-growing nonlinearity, on a unit ball. We prove the existence of a radial singular solution and obtain its exact asymptotic behavior in a neighborhood of the…
Tessellations of $R^3$ that use convex polyhedral cells to fill the space can be extremely complicated, especially if they are not facet-to-facet, that is, if the facets of a cell do not necessarily coincide with the facets of that cell's…
We study the classical problem of computing geometric thickness, i.e., finding a straight-line drawing of an input graph and a partition of its edges into as few parts as possible so that each part is crossing-free. Since the problem is…
This paper is a survey of computational issues in algebraic geometry, with particular attention to the theory of Grobner bases and the regularity of an algebraic variety. 1. A geometric introduction to Grobner bases. 2. An algebraic…
Many problems in computational geometry are not stated in graph-theoretic terms, but can be solved efficiently by constructing an auxiliary graph and performing a graph-theoretic algorithm on it. Often, the efficiency of the algorithm…
Edge-to-edge tilings of the sphere by congruent quadrilaterals are completely classified in a series of three papers. This second one applies the powerful tool of trigonometric Diophantine equations to classify the case of…
Connectivity problems like k-Path and k-Disjoint Paths relate to many important milestones in parameterized complexity, namely the Graph Minors Project, color coding, and the recent development of techniques for obtaining kernelization…