Loading...

Spanning colored points with intervals

Khanteimouri, P ; Sharif University of Technology | 2013

534 Viewed
  1. Type of Document: Article
  2. Publisher: Canadian Conference on Computational Geometry , 2013
  3. Abstract:
  4. We study a variant of the problem of spanning colored objects where the goal is to span colored objects with two similar regions. We dedicate our attention in this paper to the case where objects are points lying on the real line and regions are intervals. Precisely, the goal is to compute two intervals together spanning all colors. As the main ingredient of our algorithm, we first introduce a kinetic data structure to keep track of minimal intervals spanning all colors. Then we present a novel algorithm using the proposed KDS to compute a pair of intervals which together span all the colors with the property that the largest one is as small as possible. The algorithm runs in O(n2 log n) using O(n) space where n is the number of points
  5. Keywords:
  6. Algorithms ; Color ; Keep track of ; Kinetic data structure ; Novel algorithm ; Real line ; Computational geometry
  7. Source: CCCG 2013 - 25th Canadian Conference on Computational Geometry ; 2013 , Pages 265-270
  8. URL: http://www.cccg.ca/proceedings/2013/papers/paper_63.pdf