Related papers: Grid Peeling of Parabolas
We introduce a new iterative method for computing solutions of elliptic equations with random rapidly oscillating coefficients. Similarly to a multigrid method, each step of the iteration involves different computations meant to address…
Graph generative model evaluation necessitates understanding differences between graphs on the distributional level. This entails being able to harness salient attributes of graphs in an efficient manner. Curvature constitutes one such…
The Convex Hull algorithm is one of the most important algorithms in computational geometry, with many applications such as in computer graphics, robotics, and data mining. Despite the advances in the new algorithms in this area, it is…
The classical Whitney formula relates the number of times an oriented plane curve cuts itself to its rotation number and the index of a base point. In this paper we generalize Whitney's formula to curves on an oriented punctured surface. To…
We study two different types of gluing for graphs: interface (obtained by choosing a common subgraph as the gluing component) and bridge gluing (obtained by adding a set of edges to the given subgraphs). We introduce formulae for computing…
One of the difficulties in doing noncommutative projective geometry via explicitly presented graded algebras is that it is usually quite difficult to show flatness, as the Hilbert series is uncomputable in general. If the algebra has a…
This paper introduces a novel geometric multigrid solver for unstructured curved surfaces. Multigrid methods are highly efficient iterative methods for solving systems of linear equations. Despite the success in solving problems defined on…
We consider H(curl)-elliptic variational problems on bounded Lipschitz polyhedra and their finite element Galerkin discretization by means of lowest order edge elements. We assume that the underlying tetrahedral mesh has been created by…
We investigate how to make the surface of a convex polyhedron (a polytope) by folding up a polygon and gluing its perimeter shut, and the reverse process of cutting open a polytope and unfolding it to a polygon. We explore basic enumeration…
We define strict confluent drawing, a form of confluent drawing in which the existence of an edge is indicated by the presence of a smooth path through a system of arcs and junctions (without crossings), and in which such a path, if it…
We investigate the Hilbert scheme of points on curves with n-fold singularities, that is curves that look locally around their singular points as the axis in an affine space. We describe the structure and number of its irreducible…
Understanding whether deep neural networks are effectively optimized remains challenging, as training occurs in highly nonconvex landscapes and standard metrics provide limited visibility into layer-wise learning quality. This challenge is…
Consider a configuration of pebbles distributed on the vertices of a connected graph of order $n$. A pebbling step consists of removing two pebbles from a given vertex and placing one pebble on an adjacent vertex. A distribution of pebbles…
We consider classical curvature flows: 1-parameter families of convex embeddings of the 2-sphere into Euclidean 3-space which evolve by an arbitrary (non-homogeneous) function of the radii of curvature. The associated flow of the radii of…
Brushing of graphs is a graph searching process in which the searching agents are called brushes. We focus on brushing directed graphs based on a new model in which the brushes can only travel in the same direction as the orientation of the…
The 3-Decomposition Conjecture states that every connected cubic graph can be decomposed into a spanning tree, a 2-regular subgraph and a matching. We show that this conjecture holds for the class of connected plane cubic graphs.
The paper presents a new model for single channel images low-level interpretation. The image is decomposed into a graph which captures a complete set of structural features. The description allows to accurately identify every edge location…
The functionality of adhesives relies on their response under the application of a load. Yet, it has remained a challenge to quantitatively relate the macroscopic dynamics of peeling to the dissipative processes inside the adhesive layer.…
A normal partition of the edges of a cubic graph is a partition into trails (no repeated edge) such that each vertex is the end vertex of exactly one trail of the partition. We investigate this notion and give some results and problems.
The conchoid of a plane curve $C$ is constructed using a fixed circle $B$ in the affine plane. We generalize the classical definition so that we obtain a conchoid from any pair of curves $B$ and $C$ in the projective plane. We present two…