Related papers: Medial Parametrization of Arbitrary Planar Compact…
Consider a Voronoi tiling of the Euclidean space based on a realization of a inhomogeneous Poisson random set. A Voronoi polyomino is a finite and connected union of Voronoi tiles. In this paper we provide tail bounds for the number of…
Color image segmentation is a crucial step in many computer vision and pattern recognition applications. This article introduces an adaptive and unsupervised clustering approach based on Voronoi regions, which can be applied to solve the…
The Voronoi diagrams technique was introduced by Cabello to compute the diameter of planar graphs in subquadratic time. We present novel applications of this technique in static, fault-tolerant, and partially-dynamic undirected unweighted…
Surface parameterization is a fundamental concept in fields such as differential geometry and computer graphics. It involves mapping a surface in three-dimensional space onto a two-dimensional parameter space. This process allows for the…
We introduce VoroFields, a hierarchical neural-field framework for approximating generalized Voronoi diagrams of finite geometric site sets in low-dimensional domains under arbitrary evaluable point-to-site distances. Instead of…
In this paper we present an algorithm to reduce the area of a surface spanned by a finite number of boundary curves by initiating a variational improvement in the surface. The ansatz we suggest consists of original surface plus a…
We study the compactification of the moduli space of a certain class of rank-two irregular connections on the Riemann sphere, presenting one double pole and two simple poles. To construct the compactification explicitly, we identify a class…
Surface parameterizations have been widely used in computer graphics and geometry processing. In particular, as simply-connected open surfaces are conformally equivalent to the unit disk, it is desirable to compute the disk conformal…
The method of boundary curve reparametrization is applied to construction of the approximate analytical conformal mapping of the unit disk onto an arbitrary given finite domain with a boundary smooth at every point but fininte number of…
Many tasks in geometry processing are modeled as variational problems solved numerically using the finite element method. For solid shapes, this requires a volumetric discretization, such as a boundary conforming tetrahedral mesh.…
In this paper, we propose a general framework for constructing IGA-suitable planar B-spline parameterizations from given complex CAD boundaries consisting of a set of B-spline curves. Instead of forming the computational domain by a simple…
The order-$k$ Voronoi tessellation of a locally finite set $X \subseteq \mathbb{R}^n$ decomposes $\mathbb{R}^n$ into convex domains whose points have the same $k$ nearest neighbors in $X$. Assuming $X$ is a stationary Poisson point process,…
We suggest an approximate method of finding a conformal mapping of an annulus onto an arbitrary bounded doubly connected polygonal domain. The method is based on the parametric Loewner--Komatu method. We consider smooth one parameter…
We describe a method for discretizing planar C2-regular domains immersed in non-conforming triangulations. The method consists in constructing mappings from triangles in a background mesh to curvilinear ones that conform exactly to the…
Many methods for modelling spatial processes assume global smoothness properties; such assumptions are often violated in practice. We introduce a method for modelling spatial processes that display heterogeneity or contain discontinuities.…
Iso-edge domains are a variant of the iso-Delaunay decomposition introduced by Voronoi. They were introduced by Baranovskii & Ryshkov in order to solve the covering problem in dimension $5$. In this work we revisit this decomposition and…
We analyze and validate the virtual element method combined with a boundary correction similar to the one in [1,2], to solve problems on two dimensional domains with curved boundaries approximated by polygonal domains. We focus on the case…
We study a certain compactification of the Drinfeld period domain over a finite field which arises naturally in the context of Drinfeld moduli spaces. Its boundary is a disjoint union of period domains of smaller rank, but these are glued…
We present an explicit and efficient construction of additively weighted Voronoi diagrams on planar graphs. Let $G$ be a planar graph with $n$ vertices and $b$ sites that lie on a constant number of faces. We show how to preprocess $G$ in…
The construction of anisotropic triangulations is desirable for various applications, such as the numerical solving of partial differential equations and the representation of surfaces in graphics. To solve this notoriously difficult…