algorithm - Smoothing Digitised Convex 2D polygon within Boundary polygons -
i looking smoothing algorithm 2d convex polygons.
the polygons generated digitiser tracing template. template hand cut , has anomalies, need smoothed out.
the polygon has constraint, described follows. 2 concentric polygons generated around initial polygon. outer polygon xmm larger initial polygon, , inner polygon xmm smaller. calculation assumes line drawn polygon cg (centre of gravity) through each point, either adding xmm or deducting xmm.
this generates corridor, , smoothing has stay inside corridor. corridor represents polygon accuracy. assumed smoothing process can , reduce total number of points. lines , arcs can substituted.
i have seen algorithm number of years ago, , efforts find have been unsuccessful.
hopefully, on forum can point me in rigfht direction.
Comments
Post a Comment