DILATION-OPTIMAL EDGE DELETION IN POLYGONAL CYCLES (Q5305064): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for computing the Voronoi diagram of a convex polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition of multidimensional point sets with applications to <i>k</i> -nearest-neighbors and <i>n</i> -body potential fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a minimum-dilation spanning tree is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: SIMPLE ALGORITHMS FOR ENUMERATING INTERPOINT DISTANCES AND FINDING k NEAREST NEIGHBORS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Point Location in a Monotone Subdivision / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum dilation stars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the Stretch Factor of a Geometric Network by Edge Augmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sweepline algorithm for Voronoi diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Storing a Sparse Table with <i>0</i> (1) Worst Case Access Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Search in Planar Subdivisions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Geometric Minimum-Dilation Graphs Is NP-Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: The all nearest-neighbor problem for convex polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: SEQUENTIAL AND PARALLEL ALGORITHMS FOR THE k CLOSEST PAIRS PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Stretch Factor of Euclidean Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Spanner Networks / rank
 
Normal rank

Latest revision as of 15:04, 2 July 2024

scientific article; zbMATH DE number 5684665
Language Label Description Also known as
English
DILATION-OPTIMAL EDGE DELETION IN POLYGONAL CYCLES
scientific article; zbMATH DE number 5684665

    Statements

    DILATION-OPTIMAL EDGE DELETION IN POLYGONAL CYCLES (English)
    0 references
    19 March 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    polygonal cycle
    0 references
    edge removal
    0 references
    algorithm
    0 references
    geometric graph
    0 references
    minimal-dilation path
    0 references