Related papers: Conics Quadrics Mapping & Cones
The aim of this paper is to present a new method of approximation of planar data set using only arcs or segments. The first problem we are trying to solve is the following: the CNC machines can work only with simple curves (arcs or…
For an irreducible conic $\mathcal C$ in a Desarguesian plane of odd square order, estimating the number of points from a Baer subplane which are external to $\mathcal C$ is a natural problem. In this paper, a complete list of possibilities…
In this paper, we continue the study of the relation between rational points of rational elliptic surfaces and plane curves. As an application, we give first examples of Zariski pairs of cubic-line arrangements that do not involve…
This paper presents an algorithm for detecting and computing the cusp points in the joint space of 3-RPR planar parallel manipulators. In manipulator kinematics, cusp points are special points, which appear on the singular curves of the…
Ordered pairs of proper, non-empty real projective conics can be classified modulo rigid isotopy and ambient isotopy. We characterize the classes by equations, inequations and inequalities in the coefficients of the quadratic forms defining…
We consider the planar two-center problem for a convex polygon: given a convex polygon in the plane, find two congruent disks of minimum radius whose union contains the polygon. We present an $O(n\log n)$-time algorithm for the two-center…
We determine the conditions resulting from equating the area sums of alternative sectors in a circle generated by four, two, and three straight lines, respectively, that connect opposite points on its circumference while passing through a…
Given a convex polygon of $n$ sides, one can draw $n$ disks (called side disks) where each disk has a different side of the polygon as diameter and the midpoint of the side as its center. The intersection graph of such disks is the…
A key issue in tropical geometry is the lifting of intersection points to a non-Archimedean field. Here, we ask: Where can classical intersection points of planar curves tropicalize to? An answer should have two parts: first, identifying…
We consider arrangements of axis-aligned rectangles in the plane. A geometric arrangement specifies the coordinates of all rectangles, while a combinatorial arrangement specifies only the respective intersection type in which each pair of…
We describe convex quadric surfaces in n dimensions and characterize them as convex surfaces with quadric sections by a continuous family of hyperplanes.
This paper presents rigorous forward error bounds for linear conic optimization problems. The error bounds are formulated in a quite general framework; the underlying vector spaces are not required to be finite-dimensional, and the convex…
It is shown that every 2-planar graph is quasiplanar, that is, if a simple graph admits a drawing in the plane such that every edge is crossed at most twice, then it also admits a drawing in which no three edges pairwise cross. We further…
We give necessary and sufficient criteria for a smooth Enriques surface S in P^r to be scheme-theoretically an intersection of quadrics. Moreover we prove in many cases that, when S contains plane cubic curves, the intersection of the…
A graph is 1-planar if it can be drawn in the plane so that each edge is crossed at most once. However, there are 1-planar graphs which do not admit a straight-line 1-planar drawing. We show that every 1-planar graph has a straight-line…
Matrix completion results deal with the question of when a partially specified symmetric matrix can be completed to a member of certain matrix cones. Results from positive semidefinite matrix completion and completely positive matrix…
Semidefinite programming is a fundamental problem class in convex optimization, but despite recent advances in solvers, solving large-scale semidefinite programs remains challenging. Generally the matrix functions involved are spectral or…
A symmetric matrix $A$ is completely positive (CP) if there exists an entrywise nonnegative matrix $V$ such that $A = V V ^T$. In this paper, we study the CP-matrix approximation problem of projecting a matrix onto the intersection of a set…
We investigate partial symmetry of solutions to semi-linear and quasi-linear elliptic problems with convex nonlinearities, in domains that are either axially symmetric or radially symmetric.
Bundling crossings is a strategy which can enhance the readability of drawings. In this paper we consider good drawings, i.e., we require that any two edges have at most one common point which can be a common vertex or a crossing. Our main…