Sequential and parallel algorithms for finding a maximum convex polygon (Q676573): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Computing the Largest Empty Rectangle / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Functional Approach to Data Structures and Its Use in Multidimensional Searching / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3928584 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finding minimum area \(k\)-gons / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimum polygonal separation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4284244 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4023519 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3992847 / rank | |||
Normal rank |
Latest revision as of 10:54, 27 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Sequential and parallel algorithms for finding a maximum convex polygon |
scientific article |
Statements
Sequential and parallel algorithms for finding a maximum convex polygon (English)
0 references
8 September 1997
0 references
convex polygons
0 references