Related papers: Consistent digital line segments
Dimensional regularization of Euclidean momentum space integrals is a highly successful technique in renormalization of quantum field theories. While it yields a straightforward algorithmic method, with which to evaluate diagrams beyond…
We develop a numerical method for solving a system of nonlinear integral equations involving two integral terms: at the current time t, one integral is taken from 0 to t, and a different integral is taken from t to infinity. We prove the…
This paper discusses the extension of the Prototype Verification System (PVS) sub-theory for rings, part of the PVS algebra theory, with theorems related to the division algorithm for Euclidean rings and Unique Factorization Domains that…
In [Computer Aided Geometric Design 27 (2010), 212-231] the authors present an algorithm to parametrize approximately $\epsilon$-rational curves, and they show in 2 examples that the Hausdorff distance, w.r.t. to the Euclidean distance,…
Linearly repetitive cut and project sets are mathematical models for perfectly ordered quasicrystals. In a previous paper we presented a characterization of linearly repetitive cut and project sets. In this paper we extend the classical…
We say that a metric graph is uniformly bounded if the degrees of all vertices are uniformly bounded and the lengths of edges are pinched between two positive constants; a metric space is approximable by a uniform graph if there is one…
The inevitable noise in real measurements motivates the problem to continuously quantify the similarity between rigid objects such as periodic time series and proteins given by ordered points and considered up to isometry maintaining…
This paper proposes a hierarchical clustering approach for the segmentation of mobile LiDAR point clouds. We perform the hierarchical clustering on unorganized point clouds based on a proximity matrix. The dissimilarity measure in the…
It was shown in 1994, in Oberguggenberger & Rosinger, that very large classes of nonlinear PDEs have solutions which can be assimilated with usual measurable functions on the Euclidean domains of definition of the respective equations. In…
We characterize the uniform limits of Dirichlet polynomials on a right half plane. In the Dirichlet setting, we find approximation results, with respect to the Euclidean distance and {to} the chordal one as well, analogous to classical…
In the quest to produce quantum technology, superconducting networks, working at temperatures just above absolute zero, have arisen as one of the most promising physical implementations. The precise analysis and synthesis of such circuits…
In this paper, we develop homology groups for digital images based on cubical singular homology theory for topological spaces. Using this homology, we present digital Hurewicz theorem for the fundamental group of digital images. We also…
This paper proposes a concise coding of the cells of n-dimensional finite regular grids. It induces a simple, generic and efficient framework for implementing classical digital topology data structures and algorithms. Discrete subsets of…
We study the configurations of pixels that occur when two digitized straight lines meet each other.
We develop a new approach to address some classical questions concerning the size and structure of integer distance sets. Our main result is that any integer distance set in the Euclidean plane is either very sparse or has all but an…
To improve our understanding of connected systems, different tools derived from statistics, signal processing, information theory and statistical physics have been developed in the last decade. Here, we will focus on the graph comparison…
We develop algorithms to turn quotients of rings of rings of integers into effective Euclidean rings by giving polynomial algorithms for all fundamental ring operations. In addition, we study normal forms for modules over such rings and…
We address here the problem of generating random graphs uniformly from the set of simple connected graphs having a prescribed degree sequence. Our goal is to provide an algorithm designed for practical use both because of its ability to…
Piecewise constant image approximations of sequential number of segments or clusters of disconnected pixels are treated. The method of majorizing of optimal approximation sequence by hierarchical sequence of image approximations is…
We analyse the axioms of Euclidean geometry according to standard object-oriented software development methodology. We find a perfect match: the main undefined concepts of the axioms translate to object classes. The result is a suite of C++…