Related papers: Conics Quadrics Mapping & Cones
We prove that if $N$ points lie in convex position in the plane then they determine $\Omega(N^{5/4})$ distinct angles, provided that the points do not lie on a common circle. This is derived from a more general claim that if $N$ points in…
We show that there are five types of planar curves such that arrangements of its translates are combinatorially equivalent to an arrangement of lines. These curves can be used to define norms giving constructions with many unit distances…
The numerical range of a matrix is studied geometrically via the cone of positive semidefinite matrices (or semidefinite cone for short). In particular it is shown that the feasible set of a two-dimensional linear matrix inequality (LMI),…
The numerical range of a matrix is studied geometrically via the cone of positive semidefinite matrices (or semidefinite cone for short). In particular it is shown that the feasible set of a two-dimensional linear matrix inequality (LMI),…
Conics in the Euclidean space have been known for their geometrical beauty and also for their power to model several phenomena in real life. It usually happens that when thinking about the conics in a semi-Riemannian manifold, the equations…
We study rectangles inscribed in lines in the plane by parametrizing these rectangles in two ways, one involving slope and the other aspect ratio. This produces two paths, one that finds rectangles with specified slope and the other…
A smooth quartic curve in the complex projective plane has 36 inequivalent representations as a symmetric determinant of linear forms and 63 representations as a sum of three squares. These correspond to Cayley octads and Steiner complexes…
In this paper, we present a synthetic solution to a geometric open problem involving the radical axis of two strangely defined circumcircles. The solution encapsulates two generalizations, one of which uses a powerful projective result…
We prove that a surface in real 3-space containing a line and a circle through each point is a quadric. We also give some particular results on the classification of surfaces containing several circles through each point.
Many combinatorial problems can be formulated as a polynomial optimization problem that can be solved by state-of-the-art methods in real algebraic geometry. In this paper we explain many important methods from real algebraic geometry, we…
We characterise the quartic (i.e. 4-regular) multigraphs with the property that every edge lies in a triangle. The main result is that such graphs are either squares of cycles, line multigraphs of cubic multigraphs, or are obtained from…
Conic optimization has recently emerged as a powerful tool for designing tractable and guaranteed algorithms for non-convex polynomial optimization problems. On the one hand, tractability is crucial for efficiently solving large-scale…
To support exactly tracking a neutron moving along a given line segment through a CAD model with quadric surfaces, this paper considers the arithmetic precision required to compute the order of intersection points of two quadrics along the…
This note focuses on the problem of representing convex sets as projections of the cone of positive semidefinite matrices, in the particular case of sets generated by bivariate polynomials of degree four. Conditions are given for the convex…
Confocal conics form an orthogonal net. Supplementing this net with one of the following: 1) the net of Cartesian coordinate lines aligned along the principal axes of conics, 2) the net of Apollonian pencils of circles whose foci coincide…
Many parametrization and mapping-related problems in geometry processing can be viewed as metric optimization problems, i.e., computing a metric minimizing a functional and satisfying a set of constraints, such as flatness. Penner…
A natural way to represent on the plane both a planar graph and its dual is to follow the definition of the dual, thus, to place vertices inside their corresponding primal faces, and to draw the dual edges so that they only cross their…
The new concept of a system of hex equations is introduced as an overdetermined system of six five-point face-centered quad equations defined on six vertices of a hexagon. For a consistent system of hex equations, two variables on…
In this paper, we introduce discrete conics, polygonal analogues of conics. We show that discrete conics satisfy a number of nice properties analogous to those of conics, and arise naturally from several constructions, including the…
We revisit constructions based on triads of conics with foci at pairs of vertices of a reference triangle. We find that their 6 vertices lie on well-known conics, whose type we analyze. We give conditions for these to be circles and/or…