Approximation algorithms on consistent dynamic map labeling
Authors:
- Chung-Shou LiaoCLChung-Shou Liao
- Chih-Wei LiangCLChih-Wei Liang
- Sheung Hung PoonSPSheung Hung Poon
- 1 August 2016
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 640, 84-93
Abstract
No abstract availableFunding Information
- National Science Council (NSC100-2221-E-007-108-MY3, NSC102-2221-E-007-075-MY3)
This publication has 8 references indexed in Scilit:
- Optimizing active ranges for consistent dynamic map labelingComputational Geometry, 2010
- Dynamic Map LabelingIEEE Transactions on Visualization and Computer Graphics, 2006
- A note on maximum independent sets in rectangle intersection graphsInformation Processing Letters, 2004
- Polynomial-time approximation schemes for packing and piercing fat objectsJournal of Algorithms, 2003
- Efficient Approximation Algorithms for Tiling and Packing Problems with RectanglesJournal of Algorithms, 2001
- Label placement by maximum independent set in rectanglesComputational Geometry, 1998
- The Problem of Compatible RepresentativesSIAM Journal on Discrete Mathematics, 1992
- Approximation schemes for covering and packing problems in image processing and VLSIJournal of the ACM, 1985