Related papers: A simple en,ex marking rule for degenerate interse…

Bipartite graphs model the relationships between two disjoint sets of entities in several applications and are naturally drawn as 2-layer graph drawings. In such drawings, the two sets of entities (vertices) are placed on two parallel lines…

A good object segmentation should contain clear contours and complete regions. However, mask-based segmentation can not handle contour features well on a coarse prediction grid, thus causing problems of blurry edges. While contour-based…

Polynomial system solving arises in many application areas to model non-linear geometric properties. In such settings, polynomial systems may come with degeneration which the end-user wants to exclude from the solution set. The…

Intersection norms are integer norms on the first homology group of a surface. In this article, we prove that there are some polytopes which are not dual unit balls of such norms. By the way, we investigate the set of collections of curves…

Edges, boundaries and contours are important subjects of study in both computer graphics and computer vision. On one hand, they are the 2D elements that convey 3D shapes, on the other hand, they are indicative of occlusion events and thus…

Interface problems depict many fundamental physical phenomena and widely apply in the engineering. However, it is challenging to develop efficient fully decoupled numerical methods for solving degenerate interface problems in which the…

We classify all binomial edge ideals that are complete intersection and Cohen-Macaulay almost complete intersection. We also describe an algorithm and provide an implementation to compute primary decomposition of binomial edge ideals.

In this paper we report some important results that help in analizing the border collision bifurcations that occur in n-dimensional discontinuous maps. For this purpose, we use the piecewise linear approximation in the neighborhood of the…

We study points of moderately low degree on a curve $C$ over a number field, which is embedded on a nice toric surface $S$. Recently, Smith and Vogt related the linear equivalence classes of such points to intersections of $C$ with curves…

The creation of a volumetric mesh representing the interior of an input polygonal mesh is a common requirement in graphics and computational mechanics applications. Most mesh creation techniques assume that the input surface is not…

A novel method has been introduced to solve a point inclusion in a polygon problem. The method is applicable to convex as well as non-convex polygons which are not self-intersecting. The introduced method is independent of rounding off…

In the first Heisenberg group, we show that the intersection of two intrinsic submanifolds with linearly independent horizontal normals locally coincides with the image of an injective continuous curve. The key tool is a chain rule that…

The determination of the contact area is a key step to derive mechanical properties such as hardness or an elastic modulus by instrumented indentation testing. Two families of procedures are dedicated to extracting this area: on the one…

In this paper we present an immersed weak Galerkin method for solving second-order elliptic interface problems on polygonal meshes, where the meshes do not need to be aligned with the interface. The discrete space consists of constants on…

Segmentation of organs or lesions from medical images plays an essential role in many clinical applications such as diagnosis and treatment planning. Though Convolutional Neural Networks (CNN) have achieved the state-of-the-art performance…

An algorithm is demonstrated that finds an ordinary intersection in an arrangement of $n$ lines in $\mathbb{R}^2$, not all parallel and not all passing through a common point, in time $O(n \log{n})$. The algorithm is then extended to find…

We determine all critical configurations for the Area function on polygons with vertices on a circle or an ellipse. For isolated critical points we compute their Morse index, resp index of the gradient vector field. We relate the…

The 3D mesh is an important representation of geometric data. In the generation of mesh data, geometric deficiencies (e.g., duplicate elements, degenerate faces, isolated vertices, self-intersection, and inner faces) are unavoidable and may…

In the mid eighties Goldman proved an embedded curve could be isotoped to not intersect a closed geodesic if and only if their Lie bracket (as defined in that work) vanished. Goldman asked for a topological proof and about extensions of the…

We present a lightweight network that infers grouping and boundaries, including curves, corners and junctions. It operates in a bottom-up fashion, analogous to classical methods for sub-pixel edge localization and edge-linking, but with a…