Optimal algorithm for a special point-labeling problem
From MaRDI portal
Recommendations
Cites work
- Computational geometry. An introduction
- Efficient algorithms for interval graphs and circular-arc graphs
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- Label placement by maximum independent set in rectangles
- Labeling a rectilinear map more efficiently
- Point labeling with sliding labels
- Three rules suffice for good label placement
Cited in
(11)- Polynomial time algorithms for three-label point labeling.
- Algorithms for a simple point placement problem
- New algorithms for two-label point labeling
- Dynamic Point Labeling is Strongly PSPACE-Complete
- Optimal algorithm for a special point-labeling problem
- Determining a set of maximum inscribed rectangles for label placement in a region
- Maximizing the Number of Independent Labels in the Plane
- Polynomial time algorithms for three-label point labeling
- scientific article; zbMATH DE number 7364985 (Why is no real title available?)
- Minimum point-overlap labelling*
- A new fast heuristic for labeling points
This page was built for publication: Optimal algorithm for a special point-labeling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1029054)