FIXED PARAMETER ALGORITHMS FOR THE MINIMUM WEIGHT TRIANGULATION PROBLEM (Q3520429): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: DIAMONDS ARE NOT A MINIMUM WEIGHT TRIANGULATION'S BEST FRIEND / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(\beta\)-skeleton as a subgraph of the minimum weight triangulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Triangulations of Polygonal Domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation / 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: The Boolean Basis Problem and How to Cover Some Polygons by Rectangles / 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: Finding a minimal cover for binary images: An optimal parallel algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic triangulation algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for \(\beta\)-skeleton belonging to minimum weight triangulations / rank
 
Normal rank

Revision as of 14:26, 28 June 2024

scientific article
Language Label Description Also known as
English
FIXED PARAMETER ALGORITHMS FOR THE MINIMUM WEIGHT TRIANGULATION PROBLEM
scientific article

    Statements

    FIXED PARAMETER ALGORITHMS FOR THE MINIMUM WEIGHT TRIANGULATION PROBLEM (English)
    0 references
    26 August 2008
    0 references
    minimum weight triangulation
    0 references
    fixed parameter algorithm
    0 references
    dynamic programming
    0 references
    divide-and-conquer algorithm
    0 references
    polygon
    0 references
    numerical examples
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references