相关论文: Bregman Voronoi Diagrams: Properties, Algorithms a…

For a given set of points $U$ on a sphere $S$, the order $k$ spherical Voronoi diagram $SV_k(U)$ decomposes the surface of $S$ into regions whose points have the same $k$ nearest points of $U$. Hyeon-Suk Na, Chung-Nim Lee, and Otfried…

Cellular structures manifest their outstanding mechanical properties in many biological systems. One key challenge for designing and optimizing these geometrically complicated structures lies in devising an effective geometric…

A zone diagram is a relatively new concept which has emerged in computational geometry and is related to Voronoi diagrams. Formally, it is a fixed point of a certain mapping, and neither its uniqueness nor its existence are obvious in…

Bregman divergences generalize measures such as the squared Euclidean distance and the KL divergence, and arise throughout many areas of machine learning. In this paper, we focus on the problem of approximating an arbitrary Bregman…

Since the beginning of the century, capturing trajectories of pedestrian streams precisely from video recordings has been possible. To enable measurements at high density, the heads of the pedestrians are marked and tracked, thus providing…

Voronoi tessellations of Poisson point processes are widely used for modeling many types of physical and biological systems. In this paper, we analyze simulated Poisson-Voronoi structures containing a total of 250,000,000 cells to provide…

Voronoi Tessellations form an attractive and versatile geometrical asymptotic model for the foamlike cosmic distribution of matter and galaxies. In the Voronoi model the vertices are identified with clusters of galaxies. For a substantial…

Deep metric learning techniques have been used for visual representation in various supervised and unsupervised learning tasks through learning embeddings of samples with deep networks. However, classic approaches, which employ a fixed…

Although Poisson-Voronoi diagrams have interesting mathematical properties, there is still much to discover about the geometrical properties of its grains. Through simulations, many authors were able to obtain numerical approximations of…

In spacetime dimensions of 4 (i.e., 3+1) and higher, topological orders exhibit spatially extended excitations like loops and membranes, which support diverse topological data characterizing braiding, fusion, and shrinking processes,…

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.…

Bregman divergences play a pivotal role in statistics, machine learning and computational information geometry. Particularly in the context of machine learning, they are central to clustering, exponential families, parameter estimation and…

Bernoulli convolutions are certain measures on the unit interval depending on a parameter $\beta$ between 1 and 2. In spite of their simple definition, they are not yet well understood. We study their two-dimensional density which exists by…

Poisson Voronoi diagrams are useful for modeling and describing various natural patterns and for generating random lattices. Although this particular space tessellation is intensively studied by mathematicians, in two- and three dimensional…

We aim to give a strict proof of the existence and uniqueness of the weighted Voronoi decomposition and the dual weighted Delaunay triangulation on Euclidean and hyperbolic polyhedral surface as well as hyperbolic surface with geodesic…

An embedding is a mapping from a set of nodes of a network into a real vector space. Embeddings can have various aims like capturing the underlying graph topology and structure, node-to-node relationship, or other relevant information about…

The aim of this paper is to provide an overview of recent development related to Bregman distances outside its native areas of optimization and statistics. We discuss approaches in inverse problems and image processing based on Bregman…

In the Hausdorff Voronoi diagram of a family of \emph{clusters of points} in the plane, the distance between a point $t$ and a cluster $P$ is measured as the maximum distance between $t$ and any point in $P$, and the diagram is defined in a…

We introduce a notion of embedding codimension of an arbitrary local ring, establish some general properties, and study in detail the case of arc spaces of schemes of finite type over a field. Viewing the embedding codimension as a measure…

Euclidean distance geometry is the study of Euclidean geometry based on the concept of distance. This is useful in several applications where the input data consists of an incomplete set of distances, and the output is a set of points in…