On the optimal binary plane partition for sets of isothetic rectangles (Q1209352): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q128017954, #quickstatements; #temporary_batch_1722291251637
 
(2 intermediate revisions by 2 users not shown)
Property / cites work
 
Property / cites work: Priority Search Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138883 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectilinear line segment intersection, layered segment trees, and dynamization / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(92)90210-m / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1994432275 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128017954 / rank
 
Normal rank

Latest revision as of 12:47, 30 July 2024

scientific article
Language Label Description Also known as
English
On the optimal binary plane partition for sets of isothetic rectangles
scientific article

    Statements

    On the optimal binary plane partition for sets of isothetic rectangles (English)
    0 references
    0 references
    0 references
    16 May 1993
    0 references
    computational geometry
    0 references
    binary space partition algorithm
    0 references
    isothetic rectangles
    0 references

    Identifiers