相关论文: Grid peeling and the affine curve-shortening flow

Grid peeling is the process of repeatedly removing the convex hull vertices of the grid-points that lie inside a given convex curve. It has been conjectured that, for a more and more refined grid, grid peeling converges to a continuous…

Consider the set of points formed by the integer $n \times n$ grid, and the process that in each iteration removes from the point set the vertices of its convex-hull. Here, we prove that the number of iterations of this process is…

We define and study a discrete process that generalizes the convex-layer decomposition of a planar point set. Our process, which we call "homotopic curve shortening" (HCS), starts with a closed curve (which might self-intersect) in the…

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…

This paper is devoted to the multigrid convergence analysis for the linear systems arising from the conforming linear finite element discretization of the second order elliptic equations with anisotropic diffusion. The multigrid convergence…

The peeling process is defined as follows: starting with a finite point set $X \subset \mathbb{R}^d$, we repeatedly remove the set of vertices of the convex hull of the current set of points. The number of peeling steps needed to completely…

Convolutional Gridding is a technique (algorithm) extensively used in Radio Interferometric Image Synthesis for fast inversion of functions sampled with irregular intervals on the Fourier plane. In this thesis, we propose some modifications…

Graph Convolutional Networks (GCNs) have shown to be effective in handling unordered data like point clouds and meshes. In this work we propose novel approaches for graph convolution, pooling and unpooling, inspired from finite differences…

The interfacial diffusion associated with finite volume method (FVM) discretizations of multiphase flows creates the need for an interface sharpening mechanism. Such solutions for structured quadrilateral grids are well documented, but…

The convex hull peeling of a point set consists in taking the convex hull, then removing the extreme points and iterating that procedure until no point remains. The boundary of each hull is called a layer. Following on from [15], we study…

In Euclidean geometry, the shortest distance between two points is a straight line. Chern made a conjecture in 1977 that an affine maximal graph of a smooth, locally uniformly convex function on two-dimensional Euclidean space…

We consider discrete Poisson interface problems resulting from linear unfitted finite elements, also called cut finite elements (CutFEM). Three of these unfitted finite element methods known from the literature are studied. All three…

We study the $F$-decomposition threshold $\delta_F$ for a given graph $F$. Here an $F$-decomposition of a graph $G$ is a collection of edge-disjoint copies of $F$ in $G$ which together cover every edge of $G$. (Such an $F$-decomposition can…

In this paper, we will introduce the `grid method' to prove that the extreme case of oscillation occurs for the averages obtained by sampling a flow along the sequence of times of the form $\{n^\alpha: n\in \mathbb{N}\}$, where $\alpha$ is…

Graph convolution is a fundamental building block for many deep neural networks on graph-structured data. In this paper, we introduce a simple, yet very effective graph convolutional network with skip connections for semi-supervised anomaly…

The analysis of several algorithms and data structures can be framed as a peeling process on a random hypergraph: vertices with degree less than k are removed until there are no vertices of degree less than k left. The remaining hypergraph…

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…

This article studies the fundamental problem of separating two adhesive elastic fibers based on numerical simulation employing a recently developed finite element model for molecular interactions between curved slender fibers. Specifically,…

In this work, we introduce two novel reformulations of a recent weakly hyperbolic model for two-phase flow with surface tension. In the model, the tracking of phase boundaries is achieved by using a vector interface field, rather than a…

In modern computer vision, images are typically represented as a fixed uniform grid with some stride and processed via a deep convolutional neural network. We argue that deforming the grid to better align with the high-frequency image…