Abstract
This chapter describes a method for reversible straight line edge reconstruction. It presents an algorithm for fitting a sequence of line segments to the jagged edge contour formed by a chain of pixels. Only a single trace through the pixel edges is required. The algorithm is based on the inverse process of Bresenham's midpoint line algorithm. Only integer arithmetic is required in the reconstruction process, and the time complexity of the algorithm is O(N), where N is the number of raster edges in the given image. The efficiency of the algorithm makes it useful as a preprocessing pass used to locate the sharp corners prior to employing conventional curve fitting techniques. Furthermore, the straight lines resulting have a valuable property—they can perfectly reconstruct the original jagged pattern if re-rasterized using Bresenham's algorithm. This reversibility makes it possible to use the fitted edges as a lossless data representation of the original.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call