Related papers: Counting intersections of normal curves
Intersection numbers of twisted cocycles arise in mathematics in the field of algebraic geometry. Quite recently, they appeared in physics: Intersection numbers of twisted cocycles define a scalar product on the vector space of Feynman…
A formula that relates triple points, branch points, and their distances from infinity is presented. We recover trivial normal Euler classes for oriented surfaces, and formulas on signed triple points.
This note presents a formula for the enumerative invariants of arbitrary genus in toric surfaces. The formula computes the number of curves of a given genus through a collection of generic points in the surface. The answer is given in terms…
A suitable measure for the similarity of shapes represented by parameterized curves or surfaces is the Fr\'echet distance. Whereas efficient algorithms are known for computing the Fr\'echet distance of polygonal curves, the same problem for…
Computational topology is an area that revisits topological problems from an algorithmic point of view, and develops topological tools for improved algorithms. We survey results in computational topology that are concerned with graphs drawn…
Finding the intersection of two conics is a commonly occurring problem. For example, it occurs when identifying patterns of craters on the lunar surface, detecting the orientation of a face from a single image, or estimating the attitude of…
We investigate arcs on a pair of pants and present an algorithm to compute the self-intersection number of an arc. Additionally, we establish bounds for the self-intersection number in terms of the word length. We also prove that the…
An exact conservative remapping scheme requires overlaps between two meshes and a reconstruction scheme on the old cells (Lagrangian mesh). While the are intensive discussion on reconstruction schemes, there are relative sparse discussion…
The problem of multiple surface clustering is a challenging task, particularly when the surfaces intersect. Available methods such as Isomap fail to capture the true shape of the surface nearby the intersection and result in incorrect…
We formulate a simple algorithm for computing global exact symmetries of closed discrete curves in plane. The method is based on a suitable trigonometric interpolation of vertices of the given polyline and consequent computation of the…
We enumerate the singular algebraic curves in a complete linear system on a smooth projective surface. The system must be suitably ample in a rather precise sense. The curves may have up to eight nodes, or a triple point of a given type and…
We give diagrammatic algorithms for computing the group trisection, homology groups, and intersection form of a closed, orientable, smooth 4-manifold, presented as a branched cover of a bridge-trisected surface in $\mathbb{S}^{4}$. The…
After defining convex near-polygons, a formula enumerating the number of triangulations of such configurations is derived in terms of edge-polynomials. The paper describes also a transfer-matrix approach for computing quantities related to…
We classify closed curves on a once-punctured torus with a single self-intersection from a combinatorial perspective. We determine the number of closed curves with given word-length and with zero, one, and arbitrary self-intersections.
We present an algorithm for calculating the geometric intersection number of two multicurves on the $n$-punctured disk, taking as input their Dynnikov coordinates. The algorithm has complexity $O(m^2n^4)$, where $m$ is the sum of the…
Kontsevich's work on Airy matrix integrals has led to explicit results for the intersection numbers of the moduli space of curves. In this article we show that a duality between k-point functions on $N\times N$ matrices and N-point…
We prove a general counting result for arcs of the same type in compact surfaces. Wealso count infinite arcs in cusped surfaces and arcs in orbifolds. These theorems are derived from aresult that guarantees the convergence of certain…
We give an explicit formula for the self-intersection number of negative curves on Fermat surfaces. The formula offers us hints to either prove or disprove the Bounded Negativity Conjecture for the Fermat surfaces.
The article proposes a new method for finding the triangle-triangle intersection in 3D space, based on the use of computer graphics algorithms -- cutting off segments on the plane when moving and rotating the beginning of the coordinate…
We investigate slicings of combinatorial manifolds as properly embedded co-dimension 1 submanifolds. A focus is given to dimension 3 where slicings are normal surfaces. In the case of 2-neighborly 3-manifolds and quadrangulated slicings, a…