Fitting a two-joint orthogonal chain to a point set

DOI10.1016/J.COMGEO.2010.07.005zbMATH Open1209.65019OpenAlexW2147684095MaRDI QIDQ617541FDOQ617541

Authors: Mario A. Lopez, Mercè Mora, Carlos Seara, J. M. Díaz-Báñez, I. Ventura 

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

Recommendations

• Fitting rectilinear polgonal curves to a set of points in the plane.
• On the \(\mathcal{O}_\beta\)-hull of a planar point set
• Approximation of point sets by 1-corner polygonal chains
• Fitting polygonal functions to a set of points in the plane
• Algorithms and Computation

zbMATH Keywords

algorithmscombinatorial optimizationpolygonal approximationcurve Fitting

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10)

Cites Work

• Introduction to algorithms
• On Finding the Maxima of a Set of Vectors
• APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
• Fitting polygonal functions to a set of points in the plane
• Efficient piecewise-linear function approximation using the uniform metric
• Applications of a semi-dynamic convex hull algorithm
• Geometric complexity of some location problems
• Computing the width of a set
• POLYLINE FITTING OF PLANAR POINTS UNDER MIN-SUM CRITERIA
• An optimal real-time algorithm for planar convex hulls
• 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
• Fitting rectilinear polgonal curves to a set of points in the plane.
• Computing the extreme distances between two convex polygons
• A new algorithm for fitting a rectilinear \(x\)-monotone curve to a set of points in the plane
• Title not available (Why is that?)
• Title not available (Why is that?)
• Unoriented $Theta$-Maxima in the Plane: Complexity and Algorithms
• APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR
• Computing minimum-area rectilinear convex hull and \(L\)-shape

Cited In (8)

• Title not available (Why is that?)
• Extremal reaches in polynomial time
• Rectilinear convex hull of points in 3D and applications
• Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations
• Separating bichromatic point sets in the plane by restricted orientation convex hulls
• On the \(\mathcal{O}_\beta\)-hull of a planar point set
• Rectilinear convex hull with minimum area
• The rectilinear convex hull of line segments

This page was built for publication: Fitting a two-joint orthogonal chain to a point set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q617541)