New results for the minimum weight triangulation problem (Q1343467): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3948568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results for the minimum weight triangulation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Delaunay and optimal triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximation behavior of the greedy triangulation for convex polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for greedy triangulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3311658 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Heuristic for Minimum Weight Triangulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic triangulation algorithm / rank
 
Normal rank

Revision as of 10:30, 23 May 2024

scientific article
Language Label Description Also known as
English
New results for the minimum weight triangulation problem
scientific article

    Statements

    New results for the minimum weight triangulation problem (English)
    0 references
    0 references
    0 references
    0 references
    19 January 1995
    0 references
    greedy triangulation
    0 references
    Delaunay triangulation
    0 references
    minimum spanning tree
    0 references

    Identifiers