Related papers: Visualizing Higher Order Structures, Overlap Regio…
In this paper, we propose a new multi-layer structural approach for the task of object based image retrieval. In our work we tackle the problem of structural organization of local features. The structural features we propose are nested…
We present an edge labeling of order-$k$ Voronoi diagrams, $V_k(S)$, of point sets $S$ in the plane, and study properties of the regions defined by them. Among them, we show that $V_k(S)$ has a small orientable cycle and path double cover,…
Clustering of high-dimensional data sets is a growing need in artificial intelligence, machine learning and pattern recognition. In this paper, we propose a new clustering method based on a combinatorial-topological approach applied to…
In this paper, we develop the mathematical tools needed to explore isotopy classes of tilings on hyperbolic surfaces of finite genus, possibly nonorientable, with boundary, and punctured. More specifically, we generalize results on…
Let $P$ be a planar set of $n$ sites in general position. For $k\in\{1,\dots,n-1\}$, the Voronoi diagram of order $k$ for $P$ is obtained by subdividing the plane into cells such that points in the same cell have the same set of nearest $k$…
We propose methods for the analysis of hierarchical clustering that fully use the multi-resolution structure provided by a dendrogram. Specifically, we propose a loss for choosing between clustering methods, a feature importance score and a…
In this paper we are concerned with finding the vertices of the Voronoi cell of a Euclidean lattice. Given a basis of a lattice, we prove that computing the number of vertices is a #P-hard problem. On the other hand we describe an algorithm…
We describe the applications of clustering and visualization tools using the so-called neutral B anomalies as an example. Clustering permits parameter space partitioning into regions that can be separated with some given measurements. It…
For real application and theoretical investigation of ordinary hypergraphs and non-ordinary hypergraphs, researchers need to establish standard rules and feasible operating methods. We propose a visualization tool for investigating…
An algorithm for the generation of non-uniform, locally-orthogonal staggered unstructured spheroidal grids is described. This technique is designed to generate very high-quality staggered Voronoi/Delaunay meshes appropriate for general…
Mutual visibility in graphs provides a framework for analysing how vertices can observe one another along shortest paths free of internal obstructions. The visibility polynomial, which enumerates mutual-visibility sets of all orders, has…
Hypergraphs provide a natural way to represent polyadic relationships in network data. For large hypergraphs, it is often difficult to visually detect structures within the data. Recently, a scalable polygon-based visualization approach was…
The paper introduces DelTriC (Delaunay Triangulation Clustering), a clustering algorithm which integrates PCA/UMAP-based projection, Delaunay triangulation, and a novel back-projection mechanism to form clusters in the original…
Data analysis often involves the comparison of complex objects. With the ever increasing amounts and complexity of data, the demand for systems to help with these comparisons is also growing. Increasingly, information visualization tools…
We study the structure of higher-order Voronoi cells on a discrete set of sites in $\mathbb{R}^n$, focussing on the relations between cells of different order, and paying special attention to the ill-posed case when a large number of points…
Given a point configuration A, we uncover a connection between polynomial-reproducing spline spaces over subsets of conv(A) and fine zonotopal tilings of the zonotope Z(V) associated to the corresponding vector configuration. This link…
For the analysis of systems consisting of small, regular objects, the methods of mathematical morphology applied to images of these systems are well-suited. One of these methods is the use of Voronoi polygons. It was found that the Voronoi…
In this paper, we present a new approach to obtain symmetric tiles with curved edges. Our approach is based on using higher-order Voronoi sites that are closed under wallpaper symmetries. The resulting Voronoi tessellations provide us with…
Given two point sets in the plane, we study the minimization of the bottleneck distance between a point set B and an equally-sized subset of a point set A under translations. We relate this problem to a Voronoi-type diagram and derive…
Let $S$ be a closed oriented surface of genus $g\geq 2$. Fix an arbitrary non-elementary representation $\rho\colon\pi_1(S)\to {\rm SL}_2(\mathbb{C})$ and consider all marked (complex) projective structures on $S$ with holonomy $\rho$. We…