Please use this identifier to cite or link to this item: http://hdl.handle.net/1783.1/686
A Note on threelabel point labeling
Authors  Vigneron, Antoine  

Issue Date  20010830  
Summary  Let P be a set of n points in the plane. We want to find a set S(P,l*) of axisparallel 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(n<sup>2</sup>logn) time.  
Subjects  
Language  English 

Format  Technical report  
Access 
Files in this item:
