Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set (Q1316098): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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 / cites work
 
Property / cites work: A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Divide and conquer for linear expected time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining the minimum-area encasing rectangle for an arbitrary closed curve / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for determining the convex hull of a finite planar set / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Multistage Solution of the Template-Layout Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear multiplicative programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parametric successive underestimation method for convex multiplicative programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5589748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: State Constraints in Convex Control Problems of Bolza / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Efficiency of the Simplex Method: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:29, 22 May 2024

scientific article
Language Label Description Also known as
English
Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set
scientific article

    Statements

    Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set (English)
    0 references
    0 references
    27 November 1994
    0 references
    0 references
    nonconvex minimization
    0 references
    global optimization
    0 references
    computational geometry
    0 references
    rectangle of minimum area
    0 references
    parametric simplex algorithm
    0 references
    successive underestimation method
    0 references