A Simple Algorithm for Higher-order Delaunay Mosaics and Alpha Shapes

11/06/2020
by   Herbert Edelsbrunner, et al.
0

We present a simple algorithm for computing higher-order Delaunay mosaics that works in Euclidean spaces of any finite dimensions. The algorithm selects the vertices of the order-k mosaic from incrementally constructed lower-order mosaics and uses an algorithm for weighted first-order Delaunay mosaics as a black-box to construct the order-k mosaic from its vertices. Beyond this black-box, the algorithm uses only combinatorial operations, thus facilitating easy implementation. We extend this algorithm to compute higher-order α-shapes and provide open-source implementations. We present experimental results for properties of higher-order Delaunay mosaics of random point sets.

READ FULL TEXT
research
07/18/2019

A Tale of Two Set Theories

We describe the relationship between two versions of Tarski-Grothendieck...
research
03/27/2013

Higher Order Probabilities

A number of writers have supposed that for the full specification of bel...
research
03/21/2018

Introducing higher order correlations to marginals' subset of multivariate data by means of Archimedean copulas

In this paper, we present the algorithm that alters the subset of margin...
research
10/12/2020

k-simplex2vec: a simplicial extension of node2vec

We present a novel method of associating Euclidean features to simplicia...
research
07/03/2023

Optimized Geometric Constellation Shaping for Wiener Phase Noise Channels with Viterbi-Viterbi Carrier Phase Estimation

The Viterbi Viterbi (V V) algorithm is well understood for QPSK an...
research
05/06/2023

The Fundamental Limits of Structure-Agnostic Functional Estimation

Many recent developments in causal inference, and functional estimation ...
research
04/27/2021

Fully-dynamic Weighted Matching Approximation in Practice

Finding large or heavy matchings in graphs is a ubiquitous combinatorial...

Please sign up or login with your details

Forgot password? Click here to reset