1098-1098/asset/olbannerleft.jpg?v=1&s=be2f67331b2f5164cb01f7c891fafdd9bd2326af)
1098-1098/asset/olbannerright.jpg?v=1&s=625bc919a4c8784eed670b90b5112a9aeee99225)
Research Article
On finding an orthogonal convex skull of a digital object
Article first published online: 11 MAR 2011
DOI: 10.1002/ima.20266
Copyright © 2011 Wiley Periodicals, Inc.
Issue
International Journal of Imaging Systems and Technology
Special Issue: Combinatorial Problems and Algorithms in Image Analysis
Volume 21, Issue 1, pages 14–27, March 2011
Additional Information
How to Cite
Dutt, M., Biswas, A., Bhowmick, P. and Bhattacharya, B. B. (2011), On finding an orthogonal convex skull of a digital object. Int. J. Imaging Syst. Technol., 21: 14–27. doi: 10.1002/ima.20266
Publication History
- Issue published online: 16 FEB 2011
- Article first published online: 11 MAR 2011
- Manuscript Accepted: 8 OCT 2010
- Manuscript Received: 15 FEB 2010
- Abstract
- Article
- References
- Cited By
Keywords:
- orthogonal convex skull;
- shape analysis;
- convex hull;
- digital geometry
Abstract
A combinatorial algorithm to compute an orthogonal convex skull of a digital object imposed on the background grid is presented in this paper. The proposed algorithm has the time complexity of O(n log n), which improves the earlier method of O(n2) time complexity for finding the convex skull of a simple orthogonal polygon. A set of rules is formulated first and then an orthogonal convex skull is derived by applying these rules while traversing along the boundary of the inner orthogonal polygon that tightly inscribes the given digital object. The algorithm uses only comparison and addition in the integer domain, which makes it amenable to fast real-world applications. Experimental results on different shapes have also been presented to demonstrate the efficacy and elegance of the proposed technique. © 2011 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 21, 14–27, 2011.