An improved implementation and analysis of the Diaz and O'Rourke algorithm for finding the Simpson point of a convex polygon (Q5852137): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: COMPUTING THE CENTER OF AREA OF A CONVEX POLYGON / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simpson Points in Planar Problems with Locational Constraints. The Round-Norm Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simpson Points in Planar Problems with Locational Constraints. The Polyhedral-Gauge Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive location in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuous Location Theory Under Majority Rule / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitions of mass-distributions and of convex bodies by hyperplanes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Voting and Competitive Location on a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden Area / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418636 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static competitive facility location: an overview of optimisation approaches. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden Regions are Convex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3278735 / rank
 
Normal rank

Latest revision as of 09:42, 2 July 2024

scientific article; zbMATH DE number 5663077
Language Label Description Also known as
English
An improved implementation and analysis of the Diaz and O'Rourke algorithm for finding the Simpson point of a convex polygon
scientific article; zbMATH DE number 5663077

    Statements

    An improved implementation and analysis of the Diaz and O'Rourke algorithm for finding the Simpson point of a convex polygon (English)
    0 references
    26 January 2010
    0 references
    competitive location
    0 references
    geometric optimisation
    0 references
    Simpson point
    0 references
    centre of area
    0 references
    iterative algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references