A new bound for map labeling with uniform circle pairs

Information Processing Letters

Volumn 81, Issue 1, 2002, Pages 47-53

  Spriggs, Michael J ^a   Keil, J Mark ^a  

^a UNIVERSITY OF SASKATCHEWAN   (Canada)

Author keywords

Algorithms; Computational geometry; Map labeling

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; CONFORMAL MAPPING; GRAPH THEORY; MATHEMATICAL MODELS;

GRAPHICAL FEATURES; MAP LABELINGS;

COMPUTATIONAL GEOMETRY;

EID: 0037116472     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(01)00184-3     Document Type: Article

References (8)

1. A functional approach to data structures and its use in multidimensional searching
2. Point set labeling with specified positions
3. A packing problem with applications to lettering of maps
4. Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams
5. A unified approach to labeling graphical features
6. New algorithms for two-label point labeling
7. A better lower bound for two-circle point labeling
8. Efficient approximation algorithms for multi-label map labeling