Anzeige
Erschienen in:
2018 | OriginalPaper | Buchkapitel
An Experimental Assessment of Three Point-Insertion Sequences for 3-D Incremental Delaunay Tessellations
verfasst von : Sanderson L. Gonzaga de Oliveira, Diogo T. Robaina, Diego N. Brandão, Mauricio Kischinhevsky, Gabriel Oliveira
Erschienen in: Computational Science – ICCS 2018
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Abstract
Currently, state-of-the-art algorithms for building 3-D Delaunay tessellations are incremental. Thus, their execution costs depend on the order of point insertion. This work evaluates three point-insertion sequences in incremental algorithms for building 3-D Delaunay tessellations. An incremental algorithm with point-insertion sequence provided by the cut-longest-edge kd–tree is evaluated against the BRIO–Hilbert order in conjunction with spatial middle and median policies employed in the 4.11 version of the Computational Geometry Algorithms Library. The results of computational costs (time and space) of these three algorithms are evaluated experimentally. Extensive results show that the incremental algorithm with a point-insertion sequence provided by the BRIO–Hilbert order with spatial middle policy employed in the latest version of the Computational Geometry Algorithms Library shows lower execution and storage costs than the two other algorithms evaluated.