Optimal placement of convex polygons to maximize point containment (Q1265324): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q916421
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Matthew T. Dickerson / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Offset-polygon annulus placement problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Translating a convex polygon to contain a maximum number of points. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PARALLEL ALGORITHM FOR ENCLOSED AND ENCLOSING TRIANGLES / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a circle placement problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static and dynamic algorithms for k-point clustering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4344150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the smallest \(k\)-enclosing circle and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated nearest neighbors and finding minimal polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The nesting problem in the leather manufacturing industry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the smallest triangles containing a given convex polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875198 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for finding minimal enclosing triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Upper Bounds in Klee’s Measure Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0925-7721(98)00015-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2050146595 / rank
 
Normal rank

Latest revision as of 11:54, 30 July 2024

scientific article
Language Label Description Also known as
English
Optimal placement of convex polygons to maximize point containment
scientific article

    Statements

    Identifiers