On determining the on-line minimax linear fit to a discrete point set in the plane
From MaRDI portal
Recommendations
Cites work
- Algorithm 495: Solution of an Overdetermined System of Linear Equations in the Chebychev Norm [F4]
- An efficient algorithm for determining the convex hull of a finite planar set
- An example of cycling in a feasible point algorithm
- An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons
- An optimal real-time algorithm for planar convex hulls
- Another efficient algorithm for convex hulls in two dimensions
- Complexity, convexity, and unimodality
- Convex hull of a finite set of points in two dimensions
- Convex hulls of finite sets of points in two and three dimensions
- Divide and conquer for linear expected time
- scientific article; zbMATH DE number 3945383 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3507890 (Why is no real title available?)
- scientific article; zbMATH DE number 3558853 (Why is no real title available?)
- scientific article; zbMATH DE number 3557226 (Why is no real title available?)
- scientific article; zbMATH DE number 3258269 (Why is no real title available?)
- Maintenance of configurations in the plane
- On the identification of the convex hull of a finite set of points in the plane
- On the multimodality of distances in convex polygons
- Uniform convergence of the empirical distribution function over convex sets
This page was built for publication: On determining the on-line minimax linear fit to a discrete point set in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1098638)