New upper bounds in Klee's measure problem

Mark H. Overmars, Chee Keng Yap

Research output: Contribution to journalArticle

Abstract

New upper bounds for the measure problem of Klee are given which significantly improve the previous bounds for dimensions greater than two. An O(nd/2 log n, n) time-space upper bound is obtained and used to compute the measure of a set of n boxes in Euclidean d-space. The solution is based on new data structure, which is called an orthogonal partition tree. This structure has order applications as well.

Original languageEnglish (US)
Pages (from-to)1034-1045
Number of pages12
JournalSIAM Journal on Computing
Volume20
Issue number6
DOIs
StatePublished - Jan 1 1991

    Fingerprint

ASJC Scopus subject areas

  • Computer Science(all)
  • Mathematics(all)

Cite this