Related papers: Tools for analyzing the intersection curve between…

We show that under a suitable transversality condition, the intersection of two rational subtori in an algebraic torus $(\C^*)^n$ is a finite group which can be determined using the torsion part of some associated lattice. Applications are…

In this paper, we formulate a simple algorithm that detects contours around a region of interest in an image. After an initial smoothing, the method is based on viewing an image as a topographic surface and finding convex and/or concave…

Visual events in computer vision are studied from the perspective of algebraic geometry. Given a sufficiently general curve or surface in 3-space, we consider the image or contour curve that arises by projecting from a viewpoint.…

We present a framework to obtain valid inequalities for a reverse convex set: the set of points in a polyhedron that lie outside a given open convex set. Reverse convex sets arise in many models, including bilevel optimization and…

We consider two natural Lagrangian intersection problems in the context of symplectic toric manifolds: displaceability of torus orbits and of a torus orbit with the real part of the toric manifold. Our remarks address the fact that one can…

A rectangular dual of a plane graph $G$ is a contact representation of $G$ by interior-disjoint rectangles such that (i) no four rectangles share a point, and (ii) the union of all rectangles is a rectangle. In this paper, we study…

A classical inequality which is due to Lickorish and Hempel says that the distance between two curves in the curve complex can be measured by their intersection number. In this paper, we show a converse version; the intersection number of…

In this paper, we present two related results on curves of genus 3. The first gives a bijection between the classes of the following objects: * Smooth non-hyperelliptic curves C of genus 3, with a choice of an element a in Jac(C)[2]-{0},…

This paper, motivated by problems in Diophantine analysis which can be formulated as problems of finding rational points on the intersection of two quadrics, presents an explicit construction of a rationally defined isomorphism (biregular…

We construct cobordisms of small genus between torus knots and use them to determine the cobordism distance between torus knots of small braid index. In fact, the cobordisms we construct arise as the intersection of a smooth algebraic curve…

The subgradient projection iteration is a classical method for solving a convex inequality. Motivated by works of Polyak and of Crombez, we present and analyze a more general method for finding a fixed point of a cutter, provided that the…

We present some algorithms that provide useful topological information about curves in surfaces. One of the main algorithms computes the geometric intersection number of two properly embedded 1-manifolds $C_1$ and $C_2$ in a compact…

We determine the gonality and the Clifford index for curves on a compact smooth toric surface. Moreover, it is shown that their gonality are computed by pencils on the ambient surface. From the geometrical view point, this means that the…

A projective rectangle is like a projective plane that has different lengths in two directions. We develop the basic theory of projective rectangles including incidence properties, projective subplanes, configuration counts, a partial…

This research monograph focuses on the arithmetic, over number fields, of surfaces fibred into curves of genus 1 over the projective line, and of intersections of two quadrics in projective space. The first half takes up and develops…

Results of number of geometric operations (often used in technical practise, as e.g. the operation of blending) are in many cases surfaces described implicitly. Then it is a challenging task to recognize the type of the obtained surface,…

In this paper, we characterize the polynomiality of surfaces of revolution by means of the polynomiality of an associated plane curve. In addition, if the surface of revolution is polynomial, we provide formulas for computing a polynomial…

This paper explores the relationship between closed curves on surfaces and their intersections. Like Dehn-Thurston coordinates for simple curves, we explore how to determine closed curves using the number of times they intersect other…

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…

We consider the popular and classical method of alternating projections for finding a point in the intersection of two closed sets. By situating the algorithm in a metric space, equipped only with well-behaved geodesics and angles (in the…