A new fast heuristic for labeling points
From MaRDI portal
Publication:987799
Recommendations
Cites work
- scientific article; zbMATH DE number 1870047 (Why is no real title available?)
- A UNIFIED APPROACH TO AUTOMATIC LABEL PLACEMENT
- A polynomial time solution for labeling a rectilinear map
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Computational geometry. Algorithms and applications.
- Generation of maximum independent sets of a bipartite graph and maximum cliques of a circular-arc graph
- Label placement by maximum independent set in rectangles
- Labeling a rectilinear map more efficiently
- Optimal algorithm for a special point-labeling problem
- Point labeling with sliding labels
- Three rules suffice for good label placement
Cited in
(6)- Minimum point-overlap labelling*
- scientific article; zbMATH DE number 1670674 (Why is no real title available?)
- Optimal algorithm for a special point-labeling problem
- scientific article; zbMATH DE number 1696650 (Why is no real title available?)
- scientific article; zbMATH DE number 2089214 (Why is no real title available?)
- A clustering search metaheuristic for the point-feature cartographic label placement problem
This page was built for publication: A new fast heuristic for labeling points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q987799)