相关论文: Proximal Vorono\"i Regions
A main result in this paper is the proof that proximal Delaunay triangulation regions are convex polygons. In addition, it is proved that every Delaunay triangulation region has a local Leader uniform topology.
We prove that for any non-symmetric irreducible divisible convex set, the proximal limit set is the full projective boundary.
We consider problem of constructing purely Voronoi mesh where the union of uncut Voronoi cells approximates the planar computational domain with piecewise-smooth boundary. Smooth boundary fragments are approximated by the Voronoi edges and…
This paper introduces nucleus clustering in Voronoi tessellations of plane surfaces with applications in the geometry of digital images. A \emph{nucleus cluster} is a collection of Voronoi regions that are adjacent to a Voronoi region…
This paper introduces a visibility relation $v$ (and the strong visibility relation $\mathop{v}\limits^{\doublewedge}$) on proximal Delaunay meshes. A main result in this paper is that the visibility relation $v$ is equivalent to Wallman…
This article introduces strongly near smooth manifolds. The main results are (i) second countability of the strongly hit and far-miss topology on a family $\mathcal{B}$ of subsets on the Lodato proximity space of regular open sets to which…
It is known that the space of convex polygons in the Euclidean plane with fixed normals, up to homotheties and translations, endowed with the area form, is isometric to a hyperbolic polyhedron. In this note we show a class of convex…
A convex polygon is defined as a sequence (V_0,...,V_{n-1}) of points on a plane such that the union of the edges [V_0,V_1],..., [V_{n-2},V_{n-1}], [V_{n-1},V_0] coincides with the boundary of the convex hull of the set of vertices…
The Voronoi diagram is a geometric object which is widely used in many areas. Recently it has been shown that under mild conditions Voronoi diagrams have a certain continuity property: small perturbations of the sites yield small…
Variational analysis presents a unified theory encompassing in particular both smoothness and convexity. In a Euclidean space, convex sets and smooth manifolds both have straightforward local geometry. However, in the most basic hybrid case…
Every convex polygon with $n$ vertices is a linear projection of a higher-dimensional polytope with at most $147\,n^{2/3}$ facets.
Given a set of sites in a simple polygon, a geodesic Voronoi diagram of the sites partitions the polygon into regions based on distances to sites under the geodesic metric. We present algorithms for computing the geodesic nearest-point,…
Voronoi diagrams appear in many areas in science and technology and have numerous applications. They have been the subject of extensive investigation during the last decades. Roughly speaking, they are a certain decomposition of a given…
A polyhedral norm is a norm N on R^n for which the set N(x)\leq 1 is a polytope. This covers the case of the L^1 and L^{\infty} norms. We consider here effective algorithms for determining the Voronoi polytope for such norms with a point…
Polar weighted homogeneous polynomials are the class of special polynomials of real variables $x_i,y_i, i=1,..., n$ with $z_i=x_i+\sqrt{-1} y_i$, which enjoys a "polar action". In many aspects, their behavior looks like that of complex…
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…
We study Voronoi cells in the statistical setting by considering preimages of the maximum likelihood estimator that tessellate an open probability simplex. In general, logarithmic Voronoi cells are convex sets. However, for certain…
Three results in p-convex geometry are established. First is the analogue of the Levi problem in several complex variables, namely: local p-convexity implies global p-convexity. The second asserts that the support of a minimal p-dimensional…
In this paper, we provide an $O(n \mathrm{polylog} n)$ bound on the expected complexity of the randomly weighted Voronoi diagram of a set of $n$ sites in the plane, where the sites can be either points, interior-disjoint convex sets, or…
In this paper we consider planar polygons with parallel opposite sides. This type of polygons can be regarded as discretizations of closed convex planar curves by taking tangent lines at samples with pairwise parallel tangents. For this…