Counting convex polygons in planar point sets (Q1350236): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q170010
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Gerhard J. Woeginger / 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.1016/0020-0190(95)00130-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2108498688 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3928584 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topologically sweeping an arrangement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763392 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding minimum area \(k\)-gons / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a triangle counting problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedoids / 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

Latest revision as of 11:04, 27 May 2024

scientific article
Language Label Description Also known as
English
Counting convex polygons in planar point sets
scientific article

    Statements

    Counting convex polygons in planar point sets (English)
    0 references
    0 references
    0 references
    0 references
    27 February 1997
    0 references
    0 references
    Computational geometry
    0 references
    Convexity
    0 references
    Combinatorics
    0 references
    Dynamic programming
    0 references
    0 references