Boundary smoothing algorithm imprevement.

Registered by Simon Mouradian on 2012-05-21

The smoothing algorithm works by averaging neighbouring points. The number of neighbouring points to consider are specified by the 'degree' of smoothing. Close to the array boundaries, where 'degree' number of neighbours are not available, the array is truncated and no smoothing is performed. Given these boundaries are circular, the smoothing algorithm should be modified such that it correctly smooths array elements at the start and end of the array, by considering elements on the other end of the array.

Blueprint information

Status:
Not started
Approver:
None
Priority:
Undefined
Drafter:
None
Direction:
Needs approval
Assignee:
None
Definition:
New
Series goal:
None
Implementation:
Unknown
Milestone target:
None

Related branches

Sprints

Whiteboard

(?)

Work Items

This blueprint contains Public information 
Everyone can see this information.

Subscribers

No subscribers.