𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computation of the Dual of a Plane Projective Curve

✍ Scribed by Driss Bouziane; Mhammed El Kahoui

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
258 KB
Volume
34
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper we describe an algorithm for computing the dual of a projective plane curve. The algorithm requires no extension of the field of coefficients of the curve and runs in polynomial time.

πŸ“œ SIMILAR VOLUMES

Function Field Theory of Plane Curves by
Function Field Theory of Plane Curves by Dual Curves
✍ Hisao Yoshihara πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 126 KB

We study the structure of function fields of plane curves following our method Ε½ . developed previously K. Miura and H. Yoshihara, 2000, J. Algebra 226, 283᎐294 . Ε½ . Let K be the function field of a smooth plane curve C of degree d G 4 and let K be a maximal rational subfield of K for P g ‫ސ‬ 2 .

Generating even triangulations of the pr
Generating even triangulations of the projective plane
✍ Yusuke Suzuki; Takahiro Watanabe πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 255 KB

## Abstract We shall determine the 20 families of irreducible even triangulations of the projective plane. Every even triangulation of the projective plane can be obtained from one of them by a sequence of __even‐splittings__ and __attaching octahedra__, both of which were first given by Batagelj 2

Embeddings of Curves in the Plane
Embeddings of Curves in the Plane
✍ Vladimir Shpilrain; Jie-Tai Yu πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 88 KB

## w x Let K x, y be the polynomial algebra in two variables over a field K of characteristic 0. In this paper, we contribute toward a classification of two-variable Ε½ w x. polynomials by classifying up to an automorphism of K x, y polynomials of the e., polynomials whose New- . ton polygon is e

The Construction of Self-Dual Projective
The Construction of Self-Dual Projective Polyhedra
✍ D. Archdeacon; S. Negami πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 368 KB

In this paper we consider polyhedra whose geometric realization is the real projective plane. Each such polyhedron has a natural dual polyhedron. We give two covering constructions for projective polyhedra which are isomorphic to their duals and prove that these constructions yield all such polyhedr

The Convex Hull of Rational Plane Curves
The Convex Hull of Rational Plane Curves
✍ Gershon Elber; Myung-Soo Kim; Hee-Seok Heo πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 220 KB

We present an algorithm that computes the convex hull of multiple rational curves in the plane. The problem is reformulated as one of finding the zero-sets of polynomial equations in one or two variables; using these zero-sets we characterize curve segments that belong to the boundary of the convex