相关论文: A Note on Computable Proximity of $\mathcal{L}_1$-…
In the present paper we study approximation of discs by octagons on the pixel plane. To decide which octagon approximates better the given disc we use Jaccard's distance. The table of Jaccard's distances (calculated by a software created…
We give exact and approximation algorithms for two-center problems when the input is a set $\mathcal{D}$ of disks in the plane. We first study the problem of finding two smallest congruent disks such that each disk in $\mathcal{D}$…
This paper is a companion paper to [Lipman and Daubechies 2011]. We provide numerical procedures and algorithms for computing the alignment of and distance between two disk type surfaces. We provide a convergence analysis of the discrete…
Planet--disc interactions, despite being fundamentally three-dimensional, are often studied in the two-dimensional `thin-disk' approximation. The overall morphology of planet--disc interactions has ben shown to be similar in both 2D and 3D…
We continue the study of freezing sets in digital topology, introduced in [2]. We show how to find a minimal freezing set for a "thick" convex disk X in the digital plane Z^2. We give examples showing the significance of the assumption that…
We prove a relative isoperimetric inequalities for Lagrangian half disks in $\mathbb{C}^2$ with respect to a Lagrangian plane, or a complex plane, or a union of any two of Lagrangian or complex planes that intersect transversally at the…
We analyze the local structure of two dimensional packings of frictional disks numerically. We focus on the fractions x_i of particles that are in contact with i neighbors, and systematically vary the confining pressure p and friction…
By combining test-particle and self-consistent techniques, we have developed a method to rapidly explore the parameter space of galactic encounters. Our method, implemented in an interactive graphics program, can be used to find the…
We present polynomial-time approximation schemes based on local search} technique for both geometric (discrete) independent set (\mdis) and geometric (discrete) dominating set (\mdds) problems, where the objects are arbitrary radii disks…
We propose a new method with $\mathcal{L}_2$ distance that maps one $N$-dimensional distribution to another, taking into account available information about correspondences. We solve the high-dimensional problem in 1D space using an…
We study the configurations of pixels that occur when two digitized straight lines meet each other.
Distance measuring is a very important task in digital geometry and digital image processing. Due to our natural approach to geometry we think of the set of points that are equally far from a given point as a Euclidean circle. Using the…
In this study, we improve the topological complexity computations on digital images with introducing the digital topological complexity computations of a surjective and digitally continuous map between digital images. We also reveal…
Alternative novel measures of the distance between any two partitions of a n-set are proposed and compared, together with a main existing one, namely 'partition-distance' D(.,.). The comparison achieves by checking their restriction to…
The purpose of this paper is to introduce an algorithm that can detect the most unusual part of a digital image in probabilistic setting. The most unusual part of a given shape is defined as a part of the image that has the maximal distance…
Our concern is the digitalization of line segments in two dimensions as considered by Chun et al.[Discrete Comput. Geom., 2009] and Christ et al.[Discrete Comput. Geom., 2012]. The key property that differentiates the research of Chun et…
We use results of [6] to enlarge our knowledge of the approximate fixed point property (AFPP) for digital images in $\mathbb{Z}^2$. In particular, we study conditions under which the union of two convex digital disks has the AFPP.
In a computational topology of digital images, simplexes are replaced by Delta sets in approximating image object shapes. For simplicity, simplexes and Delta sets are restricted to the Euclidean plane. A planar simplex is either a vertex, a…
Disk contact representations realize graphs by mapping vertices bijectively to interior-disjoint disks in the plane such that two disks touch each other if and only if the corresponding vertices are adjacent in the graph. Deciding whether a…
Many of the most intriguing features, including spirals and cavities, in the current disc observations are found in binary systems like GG Tau, HD 142527 or HD 100453. Such features are evidence of the dynamic interaction between binary…