Space-efficient algorithms for klee's measure problem

Proceedings of the 17th Canadian Conference on Computational Geometry, CCCG 2005

Volumn , Issue , 2005, Pages 27-30

  Chen, Eric Y ^a   Chan, Timothy M ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DEGENERATE CASE; KLEE'S MEASURE PROBLEM; SPACE EFFICIENT; SPACE EFFICIENT ALGORITHMS; UNIT SQUARES;

COMPUTATIONAL GEOMETRY;

EID: 84862594915     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. Bose, P., Maheshwari, A., Morin, P., Morrison, J., Smid, M., and Vahrenhold, J. Space-efficient geometric divide-and-conquer algorithms. In Proc. 20th European Workshop on Computational Geometry (2004).
2. Brönnimann, H., and Chan, T. M. Spaceefficient algorithms for computing the convex hull of a simple polygonal line in linear time. In Proc. Latin American Theoretical Informatics (2004), vol. 2976 of Lect. Notes of Comp. Sci., pp. 162-171.
3. Brönnimann, H., Chan, T. M., and Chen, E. Y. Towards in-place geometric algorithms and data structures. In Proc. 20th Sympos. on Comput. Geom. (2004), pp. 239-246.
4. Brönnimann, H., Iacono, J., Katajainen, J., Morin, P., Morrison, J., and Toussaint, G. Space-efficient planar convex hull algorithms. In Proc. Latin American Theoretical Informatics (2002), pp. 494-507.
5. Chen, E. Y. Towards in-place algorithms in computational geometry. Master's thesis, University of Waterloo, 2004.
6. Chen, E. Y., and Chan, T. M. A space-efficient algorithm for segment intersection. In Proc. 15th Canad. Conf. Comput. Geom. (2003), pp. 68-71.
7. Dijkstra, E. W., and van Gasteren, A. An introduction to three algorithms for sorting in situ. Information Processing Letters 15(3) (1982), 129-134.
8. Eppstein, D., and Erickson, J. Iterated nearest neighbors and finding minimal polytopes. Discrete & Computational Geometry 11 (1994), 321-350.
9. Franceschini, G., and Grossi, R. Optimal worst-case operations for implicit cache-oblivious search trees. In Proc. 8th Workshop on Algorithms and Data Structures (2003), vol. 2748 of Lect. Notes of Comp. Sci.
10. Lai, T. W., and Wood, D. Implicit selection. In 1st Scandinavian Workshop on Algorithm Theory (1988), vol. 318 of Lect. Notes of Comp. Sci., Springer-Verlag, pp. 14-23.
11. Munro, J. I. An implicit data structure supporting insertion, deletion, and search in O(log2 n) time. J. Comput. Sys. Sci. 33 (1986), 66-74.
12. Overmars, M. H., and Yap, C.-K. New upper bounds in klee's measure problem. SIAM J. Comput. 20(6) (1991), 1034-1045.
13. Preparata, F. P., and Shamos, M. I. Computational Geometry: An Introduction. Springer-Verlag, 1985.
14. Symvonis, A. Optimal stable merging. The Computer Journal 38(8) (1995), 681-690.