Fast sequential and parallel algorithms for finding the largest rectangle separating two sets

Given a bounding isothetic rectangle BR and two sets of points A and B with cardinalities n and m inside it, we have to find an isothetic rectangle containing maximum number of points from set A and no point from set B. We consider two limiting cases of this problem when the cardinalities of set A (...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	International journal of computer mathematics Ročník 37; číslo 1-2; s. 49 - 61
Hlavní autoři:	Datta, Amitava, Srikant, R., Krithivasan, Kamala
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Abingdon Gordon and Breach Science Publishers 01.01.1990 Taylor and Francis
Témata:	1.3.5 [Computational Geometry and Object Modelling] Applied sciences Artificial intelligence B.7.1 [Very Large Scale Integration] C.1.1 [Single Data Stream Architcctures] Computational geometry Computer science; control theory; systems CREW PRAM Exact sciences and technology F.2.2 [Analysis of Algorithms and Problem Complexity] isothetic rectangles line sweep paradigm Pattern recognition. Digital image processing. Computational geometry systolic array Computational geometry Parallel algorithm Fast algorithm Algorithm analysis Algorithm complexity
ISSN:	0020-7160, 1029-0265
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!