Loading...

Efficiently computing the smallest axis-parallel squares spanning all colors

Khanteimouri, P ; Sharif University of Technology | 2017

454 Viewed
  1. Type of Document: Article
  2. DOI: 10.24200/sci.2017.4115
  3. Publisher: Sharif University of Technology , 2017
  4. Abstract:
  5. For a set of colored points, a region is called color-spanning if it contains at least one point of each color. In this paper, we first consider the problem of maintaining the smallest color-spanning interval for a set of n points with k colors on the real line, such that the insertion and deletion of an arbitrary point takes O(log2 n) the worst-case time. Then, we exploit the data structure to show that there is O(n log2 n) time algorithm to compute the smallest color-spanning square for a set of n points with k colors in the plane. This is a new way to improve O(nk log n) time algorithm presented by Abellanas et al. [1] when k = !(log n). We also consider the problem of computing the smallest color-spanning square in a special case in which we have, at most, two points from each color. We present O(n log n) time algorithm to solve the problem which improves the result presented by Arkin et al. [2] by a factor of log n. © 2017 Sharif University of Technology. All rights reserved
  6. Keywords:
  7. Algorithm ; Color-spanning objects ; Dynamic data structure ; Location planning ; Algorithms ; Data structures ; Problem solving ; Arbitrary points ; Real line ; Time algorithms ; Two-point ; Color ; Algorithm ; Computer simulation ; Data set ; Location decision ; Numerical method
  8. Source: Scientia Iranica ; Volume 24, Issue 3 , 2017 , Pages 1325-1334 ; 10263098 (ISSN)
  9. URL: http://scientiairanica.sharif.edu/article_4115.html