On determining the on-line minimax linear fit to a discrete point set in the plane (Q1098638): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q213999
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Rabab Kreidieh Ward / 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(87)90101-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2081051284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Another efficient algorithm for convex hulls in two dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3716335 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the multimodality of distances in convex polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 495: Solution of an Overdetermined System of Linear Equations in the Chebychev Norm [F4] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130890 / 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: Convex hull of a finite set of points in two dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5543516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform convergence of the empirical distribution function over convex sets / 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: On the identification of the convex hull of a finite set of points in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintenance of configurations in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: An example of cycling in a feasible point algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4088210 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal real-time algorithm for planar convex hulls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex hulls of finite sets of points in two and three dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity, convexity, and unimodality / 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

Latest revision as of 15:07, 18 June 2024

scientific article
Language Label Description Also known as
English
On determining the on-line minimax linear fit to a discrete point set in the plane
scientific article

    Statements

    On determining the on-line minimax linear fit to a discrete point set in the plane (English)
    0 references
    0 references
    0 references
    1987
    0 references
    off-line processing
    0 references
    order of computational time
    0 references
    on-line algorithm
    0 references
    minimax linear fit
    0 references
    convex hull
    0 references

    Identifiers

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