Faster counting empty convex polygons in a planar point set (Q2059898): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1016/j.ipl.2021.106221 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3212295152 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holes and Islands in Random Point Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Empty Simplices in Euclidean Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar point sets with a small number of empty convex polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching for empty convex polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar sets with few empty convex polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3207683 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5759552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3286826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Empty convex hexagons in planar point sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Konvexe Fünfecke in ebenen Punktmengen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sets with No Empty Convex 7-Gons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting convex polygons in planar point sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The empty hexagon theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On empty convex polygons in a planar point set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting \(k\)-subsets and convex \(k\)-gons in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting convex \(k\)-gons in planar point sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Erdős-Szekeres convex polygon problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer solution to the 17-point Erdős-Szekeres problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5290279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4879100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains / rank
 
Normal rank

Latest revision as of 12:17, 27 July 2024

scientific article
Language Label Description Also known as
English
Faster counting empty convex polygons in a planar point set
scientific article

    Statements

    Faster counting empty convex polygons in a planar point set (English)
    0 references
    0 references
    14 December 2021
    0 references
    Erdös-Szekeres problem
    0 references
    counting problem
    0 references
    polygon
    0 references
    discrete geometry
    0 references
    computational geometry
    0 references

    Identifiers