Optimality of the Delaunay triangulation in \(\mathbb{R}^ d\) (Q1334932): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / reviewed by
 
Property / reviewed by: Christoph Schulz / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Christoph Schulz / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voronoi diagrams from convex hulls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric dual quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Optimal Interpolation Triangle Incidences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality in quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voronoi diagrams and arrangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sweepline algorithm for Voronoi diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primitives for the manipulation of general subdivisions and the computation of Voronoi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992847 / rank
 
Normal rank

Latest revision as of 17:04, 22 May 2024

scientific article
Language Label Description Also known as
English
Optimality of the Delaunay triangulation in \(\mathbb{R}^ d\)
scientific article

    Statements

    Optimality of the Delaunay triangulation in \(\mathbb{R}^ d\) (English)
    0 references
    0 references
    26 September 1994
    0 references
    The author defines a power function for a triangulation of a finite point set in \(\mathbb{R}^ d\) and shows that it is minimized by the Delaunay triangulation. From this he obtains a number of new optimality results for Delaunay triangulations and generalizes some results previously known for the plane to \(\mathbb{R}^ d\). E.g. it is shown that a triangulation in \(\mathbb{R}^ d\) is the Delaunay triangulation iff each simplex is self- centered, i.e. contains the center of its circumsphere.
    0 references
    Voronoi diagram
    0 references
    Delaunay triangulation
    0 references

    Identifiers