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

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

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Edelsbrunner, Herbert, Osang, Georg
Format Paper
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 06.11.2020
Subjects
Online AccessGet full text

Cover

Loading…