Efficient algorithms for counting and reporting pairwise intersections between convex polygons (Q294592): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Michiel H. M. Smid / rank
Normal rank
 
Property / author
 
Property / author: Michiel H. M. Smid / rank
Normal rank
 
Property / author
 
Property / author: Michiel H. M. Smid / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4225298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for intersecting line segments in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-optimal upper bounds for simplex range searching and new zone theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for counting and reporting pairwise intersections between convex polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient partition trees / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2066537884 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:21, 30 July 2024

scientific article
Language Label Description Also known as
English
Efficient algorithms for counting and reporting pairwise intersections between convex polygons
scientific article

    Statements

    Efficient algorithms for counting and reporting pairwise intersections between convex polygons (English)
    0 references
    0 references
    0 references
    0 references
    16 June 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    computational geometry
    0 references
    data structures
    0 references
    0 references