Share This Author
An algorithm for detection of dominant points and polygonal approximation of digitized curves
Determination of optimal polygon from digital curve using L1 norm
A new split-and-merge technique for polygonal approximation of chain coded curves
ACORD--an adaptive corner detector for planar curves
A non-parametric sequential method for polygonal approximation of digital curves
Corner detection using iterative Gaussian smoothing with constant window size
A Line Segment Clipping Algorithm in 2D
- B. Ray
- Computer Science
This paper presents an algorithm for clipping line segment in 2D against rectangular window. It uses a trivial test for rejecting line segments that are completely beyond the boundaries of the…
A new approach to scale-space image
Polygonal approximation of digital planar curve using local integral deviation
An algorithm for polygonal approximation based on local integral deviation based onLocal integral deviation shows that the proposed procedure produces polygon from a digital curve approximating high as well as low curvature regions with almost equal precision.
A heuristic method for initial dominant point detection for polygonal approximations
This paper presents a novel initial dominant point detection technique for polygonal approximation in digital planar curves that has outperformed an existing similar method with respect to visual perception and numeric metrics.