| Document Date: 2005-07-31 13:55:46
Open Document File Size: 84,26 KBShare Result on Facebook
Country Canada / / / Facility University of Waterloo / Square Covering As / / IndustryTerm in-place algorithms / space-efficient algorithms / space-efficient solution / geometric divide-and-conquer algorithms / space-efficient solutions / geometric algorithms / implicit cache-oblivious search trees / sweepline algorithm / space-efficient selection algorithm / in-place geometric algorithms / implicit search tree / space-efficient geometric algorithms / planar convex hull algorithms / implicit search structure / search structures / binary search tree / search structure / space-efficient algorithm / / Organization School of Computer Science / University of Waterloo / / Person Eric Y. Chen / Timothy M. Chan / / Position Premier / / ProvinceOrState Ontario / / PublishedMedium The Computer Journal / / Technology selection algorithm / previous algorithm / three algorithms / sweepline algorithm / in-place algorithms / planar convex hull algorithms / geometric divide-and-conquer algorithms / in-place geometric algorithms / /
SocialTag |
Space-Efficient Algorithms for Klee’s Measure Problem Eric Y. Chen∗ Timothy M. Chan† rithm needs one priority queue and one segment tree