LABELING POINTS WITH CIRCLES

DOI10.1142/S0218195901000444zbMath1074.68653OpenAlexW2123548047MaRDI QIDQ4682174

Tycho Strijk, Alexander Wolff

Publication date: 10 June 2005

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195901000444

zbMATH Keywords

cartographyComputational geometryvisualizationpacking problemautomated label placement

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (21)

A Lagrangean decomposition for the maximum independent set problem applied to map labeling ⋮ Approximation algorithms for aligning points ⋮ Minimum Point-Overlap Labeling ⋮ POINT SET LABELING WITH SPECIFIED POSITIONS ⋮ A SIMPLE FACTOR-2/3 APPROXIMATION ALGORITHM FOR TWO-CIRCLE POINT LABELING ⋮ Label updating to avoid point-shaped obstacles in fixed model ⋮ Placing labels in road maps: algorithms and complexity ⋮ Label Placement in Road Maps ⋮ Mixed Map Labeling ⋮ Polynomial time algorithms for three-label point labeling. ⋮ Column generation approach for the point-feature cartographic label placement problem ⋮ Placing Arrows in Directed Graph Drawings ⋮ Boundary Labeling with Octilinear Leaders ⋮ Trimming of graphs, with application to point labeling ⋮ LABELING POINTS ON A SINGLE LINE ⋮ Boundary labeling with octilinear leaders ⋮ Algorithms for Multi-criteria One-Sided Boundary Labeling ⋮ A simple factor-3 approximation for labeling points with circles ⋮ Minimum point-overlap labelling* ⋮ Planar drawings of fixed-mobile bigraphs ⋮ The hardness of placing street names in a Manhattan type map

Cites Work

• Point labeling with sliding labels
• The Problem of Compatible Representatives
• Static and Dynamic Algorithms for k-Point Clustering Problems

This page was built for publication: LABELING POINTS WITH CIRCLES