Related papers: Drawing real plane algebraic curves in OSCAR
We study real bitangents of real algebraic plane curves from two perspectives. We first show that there exists a signed count of such bitangents that only depends on the real topological type of the curve. From this follows that a generic…
The action of ring automorphisms of the polynomial ring in two variables over the real numbers on real plane curves is considered. The orbits containing degree-three polynomials are computed, with one representative per orbit being…
This is the fourth of a series of papers studying real algebraic threefolds, but the methods are mostly independent from the previous ones. Let $f:X\to C$ be a map of a smooth projective real algebraic 3-fold to a curve $C$ whose general…
We present novel, deterministic, efficient algorithms to compute the symmetries of a planar algebraic curve, implicitly defined, and to check whether or not two given implicit planar algebraic curves are similar, i.e. equal up to a…
In this paper, we generalize the results presented in [5] for the case of real algebraic space curves. More precisely, given an algebraic space curve C (parametrically or implicitly defined), we show how to compute the generalized…
In this paper, we discuss some problems of elementary plane differential geometry and kinematics. Although the results are not new, the consistent use of complex-valued functions (plane curves) of a real variable (parameter) allows to…
The boundary of the convex hull of a compact algebraic curve in real 3-space defines a real algebraic surface. For general curves, that boundary surface is reducible, consisting of tritangent planes and a scroll of stationary bisecants. We…
The purpose of this paper is to explore the question "to what extent could we produce formal, machine-verifiable, proofs in real algebraic geometry?" The question has been asked before but as yet the leading algorithms for answering such…
We present an algorithm for computation of cell adjacencies for well-based cylindrical algebraic decomposition. Cell adjacency information can be used to compute topological operations e.g. closure, boundary, connected components, and…
We prove that Viro's patchworking produces real algebraic curves with the maximal number of real inflection points. In particular this implies that maximally inflected real algebraic $M$-curves realize many isotopy types. The strategy we…
${\cal U}$ntil now the representation (i.e. plotting) of curve in Parallel Coordinates is constructed from the point $\leftrightarrow$ line duality. The result is a ``line-curve'' which is seen as the envelope of it's tangents. Usually this…
Given an ordered sequence of $N$-choose-2 integers, we give necessary and sufficient conditions to have an ordered collection of $N$ simple closed curves on a torus such that the algebraic pairwise intersections of those curves are the…
Two sets of conditions are presented for the compactness of a real plane algebraic curve, one sufficient and one necessary, in terms of the Newton polygon of the defining polynomial.
Using von Neumann algebras, we extend the theory of quantum computation on a graph to a theory of computation on an arbitrary topological space.
We prove that a smooth, complex plane curve $C$ of odd degree can be defined by a polynomial with real coefficients if and only if $C$ is isomorphic to its complex conjugate. Counterexamples are known for curves of even degree. More…
We present an algorithm for creating contiguous cartograms using meshes. We use numerical optimization to minimize cartographic error and distortion by transforming the mesh vertices. The vertices can either be optimized in the plane or…
The arithmetic of elliptic curves, namely polynomial addition and scalar multiplication, can be described in terms of global sections of line bundles on $E\times E$ and $E$, respectively, with respect to a given projective embedding of $E$…
To synthesize Maxwell optics systems, the mathematical apparatus of tensor and vector analysis is generally employed. This mathematical apparatus implies executing a great number of simple stereotyped operations, which are adequately…
We present a novel algorithm for deciding whether a given planar curve is an image of a given spatial curve, obtained by a central or a parallel projection with unknown parameters. A straightforward approach to this problem consists of…
We develop the idea of using an algebraic-geometry approach to classical differential geometry problems. Consider an orthogonal net constructed according to algebraic-geometric data we obtain a set of smooth orthogonal nets that are…