The Rectangle Enclosure and Point-Dominance Problems Revisited
نویسندگان
چکیده
منابع مشابه
THE RECTANGLE ENCLOSURE AND POINT DOMINANCE PROBLEMS REVISITED PROSENJIT GUPTA and RAVI JANARDAN
We consider the problem of reporting the pairwise enclosures in a set of n axes parallel rectangles in IR which is equivalent to reporting dominance pairs in a set of n points in IR Over a decade ago Lee and Preparata gave an O n log n k time and O n space algorithm for these problems where k is the number of reported pairs Since that time the question of whether there is a faster algorithm has...
متن کاملDeterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM
We revisit a classical problem in computational geometry that has been studied since the 1980s: in the rectangle enclosure problem we want to report all k enclosing pairs of n input rectangles in 2D. We present the first deterministic algorithm that takes O(n logn + k) worst-case time and O(n) space in the word-RAM model. This improves previous deterministic algorithms with O((n logn+ k) log lo...
متن کاملThe ERE of the “ Red Rectangle ” revisited
We present in this paper high signal-to-noise long-slit optical spectra of the Extended Red Emission (ERE) in the “Red Rectangle” (RR) nebula. These spectra, obtained at different positions in the nebula, reveal an extremely complex emission pattern on top of the broad ERE continuum. It is well known that three features converge at large distance from the central object, in wavelength and profi...
متن کاملInverse scattering problems and the enclosure method
We show that the enclosure method introduced here is applicable to inverse scattering problems in two dimensions. Using the single set of the Cauchy data of a solution of the Helmholtz equation, we give some formulae for extracting the value of the support functions of unknown sound-hard polygonal obstacles and piecewise linear cracks from the set. AMS: 35R30
متن کاملThe Bichromatic Square and Rectangle Problems
We examine a variant of the maximum empty square (or rectangle) problem: Find an axis-aligned square (or rectangle) that contains as many blue points as possible without containing any red points. Let n be the total number of red and blue points. We solve the bichromatic square problem in O(n log n) time and O(n) space. We also solve the bichromatic rectangle problem in O(n log n) time and O(n ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Geometry & Applications
سال: 1997
ISSN: 0218-1959,1793-6357
DOI: 10.1142/s0218195997000260