A new fast heuristic for labeling points

DOI10.1016/J.IPL.2009.01.011zbMATH Open1209.68179OpenAlexW2075622169MaRDI QIDQ987799FDOQ987799

Authors: Sasanka Roy, Subhasis Bhattacharjee, Sandip Das, Subhas C. Nandy 

Publication date: 16 August 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.01.011

Recommendations

• Optimal algorithm for a special point-labeling problem
• scientific article; zbMATH DE number 2089214
• Point labeling with sliding labels
• scientific article; zbMATH DE number 1796965
• Three rules suffice for good label placement

zbMATH Keywords

algorithmbipartite graphplanar graphmaximum independent setpoint labeling

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Searching and sorting (68P10)

Cites Work

• Computational geometry. Algorithms and applications.
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• A polynomial time solution for labeling a rectilinear map
• Labeling a rectilinear map more efficiently
• Generation of maximum independent sets of a bipartite graph and maximum cliques of a circular-arc graph
• Point labeling with sliding labels
• Label placement by maximum independent set in rectangles
• Title not available (Why is that?)
• A UNIFIED APPROACH TO AUTOMATIC LABEL PLACEMENT
• Optimal algorithm for a special point-labeling problem
• Three rules suffice for good label placement

Cited In (6)

• Minimum point-overlap labelling*
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimal algorithm for a special point-labeling problem
• 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)