HKUST Library Institutional Repository Banner

HKUST Institutional Repository >
Computer Science and Engineering >
CSE TCSC Research Reports >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1783.1/686
Title: A Note on three-label point labeling
Authors: Vigneron, Antoine
Keywords: Algorithms
Map labeling
NP-hardness
Issue Date: 30-Aug-2001
Series/Report no.: HKUST Theoretical Computer Science Center Research Report ; HKUST-TCSC-2001-10
Abstract: 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.
URI: http://hdl.handle.net/1783.1/686
Appears in Collections:CSE TCSC Research Reports

Files in This Item:

File Description SizeFormat
200110.pdf145KbAdobe PDFView/Open

All items in this Repository are protected by copyright, with all rights reserved.