Related papers: Grid Peeling of Parabolas
Graph burning is a discrete-time process on graphs, where vertices are sequentially burned, and burned vertices cause their neighbours to burn over time. We consider extremal properties of this process in the new setting where the…
The convex hull peeling of a point set is obtained by taking the convex hull of the set and repeating iteratively the operation on the interior points until no point remains. The boundary of each hull is called a layer. We study the number…
Untangling is a process in which some vertices of a planar graph are moved to obtain a straight-line plane drawing. The aim is to move as few vertices as possible. We present an algorithm that untangles the cycle graph C_n while keeping at…
It is shown that every orthogonal terrain, i.e., an orthogonal (right-angled) polyhedron based on a rectangle that meets every vertical line in a segment, has a grid unfolding: its surface may be unfolded to a single non-overlapping piece…
The problem of modifying a given graph to satisfy certain properties has been one of the central topics in parameterized tractability study. In this paper, we study the cycle contraction problem, which makes a graph into a cycle by edge…
The current work reports the development of a new general grid generator called Gingred for arbitrary (e.g., number of X-points) 2D magnetic equilibria and plate geometries. A standardization of the construction of a grid is explained, the…
We report on the erosion of flat linoleum "pebbles" under steady rotation in a slurry of abrasive grit. To quantify shape as a function of time, we develop a general method in which the pebble is photographed from multiple angles with…
Adhesion is a fundamental phenomenon that plays a role in many engineering and biological applications. This paper concerns the use of machine learning to characterize the effective adhesive properties when a thin film is peeled from a…
Learning implicit representations has been a widely used solution for surface reconstruction from 3D point clouds. The latest methods infer a distance or occupancy field by overfitting a neural network on a single point cloud. However,…
In this paper, we incorporate a graph filter deconvolution step into the classical geometric convolutional neural network pipeline. More precisely, under the assumption that the graph domain plays a role in the generation of the observed…
Convolutional gridding is a processor-intensive step in interferometric imaging. While it is possible to use graphics processing units (GPUs) to accelerate this operation, existing methods use only a fraction of the available flops. We…
Spectroscopic data may often contain unwanted extrinsic signals. For example, in ARPES experiment, a wire mesh is typically placed in front of the CCD to block stray photo-electrons, but could cause a grid-like structure in the spectra…
Contraction of an edge merges its end points into a new vertex which is adjacent to each neighbor of the end points of the edge. An edge in a $k$-connected graph is {\em contractible} if its contraction does not result in a graph of lower…
We study the problem of orbifold deconstruction, i.e., the process of recognizing, using only readily available information, whether a given conformal model can be realized as an orbifold, and the identification of the twist group and the…
Core decomposition is a fundamental operator in network analysis. In this paper, we study the problem of computing distance-generalized core decomposition on a network. A distance-generalized core, also termed $(k, h)$-core, is a maximal…
This paper proposes a novel heterogeneous grid convolution that builds a graph-based image representation by exploiting heterogeneity in the image content, enabling adaptive, efficient, and controllable computations in a convolutional…
We define a plane curve to be threadable if it can rigidly pass through a point-hole in a line L without otherwise touching L. Threadable curves are in a sense generalizations of monotone curves. We have two main results. The first is a…
We automatically verify the crucial steps in the original proof of correctness of an algorithm which, given a geometric graph satisfying certain additional properties removes edges in a systematic way for producing a connected graph in…
In this paper we study planar morphs between straight-line planar grid drawings of trees. A morph consists of a sequence of morphing steps, where in a morphing step vertices move along straight-line trajectories at constant speed. We show…
A {\em solvable} cover of a graph is a regular cover whose covering transformation group is solvable. In this paper, we show that a solvable cover of a graph can be decomposed into layers of abelian covers, and also, a lift of a given…