Labeling points with given rectangles

DOI10.1016/j.ipl.2003.09.017zbMath1178.68611OpenAlexW1991058914MaRDI QIDQ1029061

Kyung-Yong Chwa, Joo-Won Jung

Publication date: 9 July 2009

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

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

zbMATH Keywords

computational geometryapproximation algorithmsmap labeling

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Related Items (7)

Minimum Point-Overlap Labeling ⋮ On the number of anchored rectangle packings for a planar point set ⋮ Maximum Area Axis-Aligned Square Packings. ⋮ Anchored rectangle and square packings ⋮ Matching points with rectangles and squares ⋮ The reach of axis-aligned squares in the plane ⋮ Minimum point-overlap labelling*

Cites Work

• Efficient Algorithms for Geometric Graph Search Problems
• Three rules suffice for good label placement
• Unnamed Item

This page was built for publication: Labeling points with given rectangles