Tritangents and Their Space Sextics

05/29/2018
by   Turku Ozlum Celik, et al.
0

Two classical results in algebraic geometry are that the branch curve of a del Pezzo surface of degree 1 can be embedded as a space sextic curve and that every space sextic curve has exactly 120 tritangents corresponding to its odd theta characteristics. In this paper we revisit both results from the computational perspective. Specifically, we give an algorithm to construct space sextic curves that arise from blowing up projective plane at eight points and provide algorithms to compute the 120 tritangents and their Steiner system of any space sextic. Furthermore, we develop efficient inverses to the aforementioned methods. We present an algorithm to either reconstruct the original eight points in the projective plane from a space sextic or certify that this is not possible. Moreover, we extend a construction of Lehavi which recovers a space sextic from its tritangents and Steiner system. All algorithms in this paper have been implemented in magma.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/30/2018

Computing the topology of a planar or space hyperelliptic curve

We present algorithms to compute the topology of 2D and 3D hyperelliptic...
research
05/23/2022

Recovery of Plane Curves from Branch Points

We recover plane curves from their branch points under projection onto a...
research
01/06/2021

PTOPO: Computing the Geometry and the Topology of Parametric Curves

We consider the problem of computing the topology and describing the geo...
research
07/06/2017

Changing Views on Curves and Surfaces

Visual events in computer vision are studied from the perspective of alg...
research
05/28/2021

On plane algebraic curves passing through n-independent nodes

Let a set of nodes 𝒳 in the plane be n-independent, i.e., each node has ...
research
10/15/2019

Curved foldings with common creases and crease patterns

Consider a curve Γ in a domain D in the plane R^2. Thinking of D as a pi...
research
08/25/2019

Optimal Curve Straightening is ∃R-Complete

We prove that the following problem has the same computational complexit...

Please sign up or login with your details

Forgot password? Click here to reset