Related papers: Further results on the hyperbolic Voronoi diagrams
I apply the algebraic framework developed in [1] to study geometry of hyperbolic spaces in 1, 2, and 3 dimensions. The background material on projectivised Clifford algebras and their application to Cayley-Klein geometries is described in…
Voronoi diagrams are a fundamental geometric data structure for obtaining proximity relations. We consider collections of axis-aligned orthogonal polyhedra in two and three-dimensional space under the max-norm, which is a particularly…
We study Voronoi diagrams for distance functions that add together two convex functions, each taking as its argument the difference between Cartesian coordinates of two planar points. When the functions do not grow too quickly, then the…
The convex dimension of a $k$-uniform hypergraph is the smallest dimension $d$ for which there is an injective mapping of its vertices into $\mathbb{R}^d$ such that the set of $k$-barycenters of all hyperedges is in convex position. We…
In this work we present a useful way to introduce the octonionic projective and hyperbolic plane through the use of Veronese vectors. Then we focus on their relation with the exceptional Jordan algebra and show that the Veronese vectors are…
We establish some characterizations of elliptic hyperboloids (resp., ellipsoids) in the $(n+1)$-dimensional Euclidean space ${\Bbb E}^{n+1}$, using the $n$-dimensional area of the sections cut off by hyperplanes and the $(n+1)$-dimensional…
We explain how to construct certain potential functions for the hyperbolic structures of a knot complement, which are closely related to the analytic functions on the deformation space of hyperbolic structures.
When considering geometry, one might think of working with lines and circles on a flat plane as in Euclidean geometry. However, doing geometry in other spaces is possible, as the existence of spherical and hyperbolic geometry demonstrates.…
By using Klein's model for hyperbolic geometry, hyperbolic structures on orbifolds or manifolds provide examples of real projective structures. By Andreev's theorem, many 3-dimensional reflection orbifolds admit a finite volume hyperbolic…
We present a general framework for computing two-dimensional Voronoi diagrams of different classes of sites under various distance functions. The framework is sufficiently general to support diagrams embedded on a family of two-dimensional…
This paper continues a geometric study of Harvey's Complex of Curves, whose ultimate goal is to apply the theory of hyperbolic spaces and groups to algorithmic questions for the Mapping Class Group and geometric properties of Kleinian…
The classic Voronoi cells can be generalized to a higher-order version by considering the cells of points for which a given $k$-element subset of the set of sites consists of the $k$ closest sites. We study the structure of the $k$-order…
Let (X,d) be a tree (T) of hyperbolic metric spaces satisfying the quasi-isometrically embedded condition. Let $v$ be a vertex of $T$. Let $({X_v},d_v)$ denote the hyperbolic metric space corresponding to $v$. Then $i : X_v \rightarrow X$…
Crochet models of a hyperbolic plane is a popular educational tool as they help to visualize complicated objets in hyperbolic geometry. We present another way how to make crochet models when we view them as a part of a triangulated…
We study the problem of computing the Voronoi diagram of a set of $n^2$ points with $O(\log n)$-bit coordinates in the Euclidean plane in a substantially sublinear in $n$ number of rounds in the congested clique model with $n$ nodes.…
A simple example of an $n$-dimensional admissible complex of planes is given for the overdetermined $k$-plane transform in $\mathbb{R}^n$. For the corresponding restricted $k$-plane transform sharp existence conditions are obtained and…
The Voronoi diagram is a certain geometric data structure which has numerous applications in various scientific and technological fields. The theory of algorithms for computing 2D Euclidean Voronoi diagrams of point sites is rich and…
The Voronoi diagram of a finite set of objects is a fundamental geometric structure that subdivides the embedding space into regions, each region consisting of the points that are closer to a given object than to the others. We may define…
Voronoi tessellations are used to partition the Euclidean space into polyhedral regions, which are called Voronoi cells. Labeling the Voronoi cells with the class information, we can map any classification problem into a Voronoi…
We survey some tools and techniques for determining geometric properties of a link complement from a link diagram. In particular, we survey the tools used to estimate geometric invariants in terms of basic diagrammatic link invariants. We…