Fitting a two-joint orthogonal chain to a point set
From MaRDI portal
Publication:617541
DOI10.1016/j.comgeo.2010.07.005zbMath1209.65019OpenAlexW2147684095MaRDI QIDQ617541
Carlos Seara, Mario A. Lopez, Mercè Mora, Inmaculada Ventura, José-Miguel Díaz-Báñez
Publication date: 21 January 2011
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2117/12026
Related Items
On the \(\mathcal{O}_\beta\)-hull of a planar point set ⋮ Separating bichromatic point sets in the plane by restricted orientation convex hulls ⋮ Rectilinear Convex Hull with Minimum Area ⋮ Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing minimum-area rectilinear convex hull and \(L\)-shape
- Geometric complexity of some location problems
- Applications of a semi-dynamic convex hull algorithm
- Efficient piecewise-linear function approximation using the uniform metric
- A new algorithm for fitting a rectilinear x-monotone curve to a set of points in the plane
- Fitting a Step Function to a Point Set
- Approximating Points by a Piecewise Linear Function: I
- Approximating Points by a Piecewise Linear Function: II. Dealing with Outliers
- Computing the extreme distances between two convex polygons
- Computing the width of a set
- On Finding the Maxima of a Set of Vectors
- An optimal real-time algorithm for planar convex hulls
- Unoriented $Theta$-Maxima in the Plane: Complexity and Algorithms
- APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
- Fitting polygonal functions to a set of points in the plane
- APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR
- POLYLINE FITTING OF PLANAR POINTS UNDER MIN-SUM CRITERIA
- Fitting rectilinear polgonal curves to a set of points in the plane.
