A SIMPLE FACTOR-2/3 APPROXIMATION ALGORITHM FOR TWO-CIRCLE POINT LABELING (Q4818561): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
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 new linear algorithm for intersecting convex polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new bound for map labeling with uniform circle pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: LABELING POINTS WITH CIRCLES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Point labeling with sliding labels / rank
 
Normal rank
Property / cites work
 
Property / cites work: A practical map labeling algorithm. / rank
 
Normal rank
Property / cites work
 
Property / cites work: New approximation algorithms for map labeling with sliding labels / rank
 
Normal rank

Revision as of 10:56, 7 June 2024

scientific article; zbMATH DE number 2104262
Language Label Description Also known as
English
A SIMPLE FACTOR-2/3 APPROXIMATION ALGORITHM FOR TWO-CIRCLE POINT LABELING
scientific article; zbMATH DE number 2104262

    Statements

    A SIMPLE FACTOR-2/3 APPROXIMATION ALGORITHM FOR TWO-CIRCLE POINT LABELING (English)
    0 references
    0 references
    0 references
    0 references
    29 September 2004
    0 references
    computational geometry
    0 references
    cartography
    0 references
    approximation algorithm
    0 references
    multi-label point labeling
    0 references
    Voronoi diagram
    0 references

    Identifiers