Related papers: Grid Peeling of Parabolas
A geometric graph is a graph drawn in the plane so that its vertices and edges are represented by points in general position and straight line segments, respectively. A vertex of a geometric graph is called pointed if it lies outside of the…
In this work we consider a generalization of graph flows. A graph flow is, in its simplest formulation, a labeling of the directed edges with real numbers subject to various constraints. A common constraint is conservation in a vertex,…
Due to the high computational load of modern numerical simulation, there is a demand for approaches that would reduce the size of discrete problems while keeping the accuracy reasonable. In this work, we present an original algorithm to…
The multigrid algorithm is a multilevel approach to accelerate the numerical solution of discretized differential equations in physical problems involving long-range interactions. Multiresolution analysis of wavelet theory provides an…
We propose to augment standard grid-based fluid solvers with pointwise divergence-free velocity interpolation, thereby ensuring exact incompressibility down to the sub-cell level. Our method takes as input a discretely divergence-free…
The behavior of the curve shortening flow has been extensively studied. Gage, Hamilton, and Grayson proved that, under the curve shortening flow, an embedded closed curve in the Euclidean plane becomes convex after a finite time and then…
Let $\Sigma$ be a compact, orientable surface of negative Euler characteristic, and let $h$ be a complete hyperbolic metric on $\Sigma$. A geodesic curve $\gamma$ in $\Sigma$ is filling, if it cuts the surface into topological disks and…
This paper presents a novel geometrical approach to investigate the convexity of a density-based cluster. Our approach is grid-based and we are about to calibrate the value space of the cluster. However, the cluster objects are coming from…
The greedy leaf removal (GLR) procedure on a graph is an iterative removal of any vertex with degree one (leaf) along with its nearest neighbor (root). Its result has two faces: a residual subgraph as a core, and a set of removed roots.…
It is shown that a large class of systems of non-linear wave equations, based on the good-bad-ugly model, admit formal solutions with polyhomogeneous expansions near null infinity. A particular set of variables is introduced which allows us…
An (edge) decomposition of a graph $G$ is a set of subgraphs of $G$ whose edge sets partition the edge set of $G$. Here we show, for each odd $\ell \geq 5$, that any graph $G$ of sufficiently large order $n$ with minimum degree at least…
We develop a theory of confluence of graphs. We describe an algorithm for proving that a given system of reduction rules for abstract graphs and graphs in surfaces is locally confluent. We apply this algorithm to show that each simple Lie…
Let $P$ be a set of $n$ points in general position on the plane. A set of closed convex polygons with vertices in $P$, and with pairwise disjoint interiors is called a convex decomposition of $P$ if their union is the convex hull of $P$,…
The line graph of a graph $G$ is the graph $L(G)$ whose vertex set is the edge set of $G$ and there is an edge between $e,f\in E(G)$ if $e$ and $f$ share an endpoint in $G$. A graph is called line graph if it is a line graph of some graph.…
In this article, we show that the algorithm of maintaining expander decompositions in graphs undergoing edge deletions directly by removing sparse cuts repeatedly can be made efficient. Formally, for an $m$-edge undirected graph $G$, we say…
Interest in inverse dynamical, spectral and scattering problems for differential equations on graphs is motivated by possible applications to nano-electronics and quantum waveguides and by a variety of other classical and quantum…
Flaps can be detached from a thin film glued on a solid substrate by tearing and peeling. For flat substrates, it has been shown that these flaps spontaneously narrow and collapse in pointy triangular shapes. Here we show that various…
Reversibility is of paramount importance in the correct representation of surface peeling in various physical settings, ranging from motility in nature, to gripping devices in robotic applications, and even to sliding of tectonic plates.…
We investigate the computational complexity of edge-deletion and edge-contraction problems in fuzzy graphs. For any graph property {\Pi} that is hereditary under contractions (or deletions) and determined by 3-connected components, the…
In this paper we introduce and describe an implementation of curved (surface) geometries within the Dune framework for grid-based discretizations. Therefore, we employ the abstraction of geometries as local-functions bound to a grid…