Please use this identifier to cite or link to this item:

A Note on three-label point labeling

Authors Vigneron, Antoine
Issue Date 2001-08-30
Summary Let P be a set of n points in the plane. We want to find a set S(P,l*) of axis-parallel squares with edge length l* such that earch point of P is associated with three squares, each point of P lies on the boundary of its three associated squares, no two squares of S(P,l*) intersect, and l* is maximized. We show how to solve this problem in O(n2logn) time.
Language English
Format Technical report
Files in this item:
File Description Size Format
200110.pdf 148740 B Adobe PDF