A polynomial time solution for labeling a rectilinear map
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 6472588 (Why is no real title available?)
- Approximate map labeling is in \(\Omega (n\log n)\)
- On the Complexity of Timetable and Multicommodity Flow Problems
- The Problem of Compatible Representatives
Cited in
(11)- Determining a set of maximum inscribed rectangles for label placement in a region
- Polynomial time algorithms for three-label point labeling.
- scientific article; zbMATH DE number 21366 (Why is no real title available?)
- Optimal point removal in closed-2PM labeling
- A new fast heuristic for labeling points
- EFFICIENT APPROXIMATION ALGORITHMS FOR TWO-LABEL POINT LABELING
- Label updating to avoid point-shaped obstacles in fixed model
- Labeling a rectilinear map more efficiently
- LABELING A RECTILINEAR MAP WITH SLIDING LABELS
- Matching points with rectangles and squares
- scientific article; zbMATH DE number 6682758 (Why is no real title available?)
This page was built for publication: A polynomial time solution for labeling a rectilinear map
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293240)