Divide-and-conquer in planar geometry (Q3802611): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Ralf Hartmut Gueting / rank
Normal rank
 
Property / author
 
Property / author: Ralf Hartmut Gueting / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/00207168608803493 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1969431600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Reporting and Counting Geometric Intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to rectangle intersections part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal contour algorithm for iso-oriented rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Rectangle Intersections by Divide-and-Conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved algorithm for the rectangle enclosure problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting and Reporting Intersections of d-Ranges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal algorithms to compute the closure of a set of iso-rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: The measure problem for rectangular ranges in d-space / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:11, 18 June 2024

scientific article
Language Label Description Also known as
English
Divide-and-conquer in planar geometry
scientific article

    Statements

    Divide-and-conquer in planar geometry (English)
    0 references
    1986
    0 references
    planar geometry
    0 references
    computational geometry
    0 references
    geometric algorithm
    0 references
    line-sweep
    0 references
    divide-and-conquer
    0 references
    line segment intersection problem
    0 references
    measure problem
    0 references
    contour problem
    0 references

    Identifiers