Abstract
We present here a linear time and space algorithm for computing the outer hull of any discrete path encoded by its Freeman chain code. The basic data structure uses an enriched version of the data structure introduced by Brlek, Koskas and Provençal: using quadtrees for representing points in the discrete plane ℤ×ℤ with neighborhood links, deciding path intersection is achievable in linear time and space. By combining the well-known wall follower algorithm for traversing mazes, we obtain the desired result with two passes resulting in a global linear time and space algorithm. As a byproduct, the convex hull is obtained as well.
With the support of NSERC (Canada).
Chapter PDF
Similar content being viewed by others
References
Gruber, P.M.: Convex and discrete geometry. Springer (2007)
Sherali, H., Adams, W.: A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM Journal on Discrete Mathematics 3(3), 411–430 (1990)
Kim, Y.S.: Recognition of form features using convex decomposition. Computer-Aided Design 24(9), 461–476 (1992)
Kim, M.A., Lee, E.J., Cho, H.G., Park, K.J.: A visualization technique for DNA walk plot using k-convex hull. In: Proceedings of the Fifth International Conference in Central Europe in Computer Graphics and Visualization, Plzeň, Czech Republic, Západočeská univerzita, pp. 212–221 (1997)
Okabe, A., Boots, B., Sugihara, K.: Spacial tesselations: Concepts and applications of Voronoi diagrams. Wiley (1992)
Graham, R.A.: An efficient algorithm for determining the convex hull of a finite planar set. Information Processing Letters 1(4), 132–133 (1972)
Chan, T.M.: Optimal output-sensitive convex hull algorithms in two and three dimensions. Discrete & Computational Geometry 16, 361–368 (1996)
Yao, A.C.C.: A lower bound to finding the convex hulls. PhD thesis, Stanford University (April 1979)
Chazelle, B.: An optimal convex hull algorithm in any fixed dimension. Discrete & Computational Geometry 10, 377–409 (1993)
Goodman, J.E., O’Rourke, J.: Handbook of discrete and computational geometry, 2nd edn. CRC Press (2004)
McCallum, D., Avis, D.: A linear algorithm for finding the convex hull of a simple polygon. Information Processing Letters 9(5), 201–206 (1979)
Melkman, A.: On-line construction of the convex hull of a simple polyline. Information Processing Letters 25, 11–12 (1987)
Chaudhuri, B.B., Rosenfeld, A.: On the computation of the digital convex hull and circular hull of a digital region. Pattern Recognition 31(12), 2007–2016 (1998)
Brlek, S., Lachaud, J.O., Provençal, X., Reutenauer, C.: Lyndon + Christoffel = digitally convex. Pattern Recognition 42, 2239–2246 (2009)
Duval, J.P.: Factorizing words over an ordered alphabet. J. Algorithms 4(4), 363–381 (1983)
Brlek, S., Koskas, M., Provençal, X.: A linear time and space algorithm for detecting path intersection. Theoretical Computer Science 412, 4841–4850 (2011)
Blondin Massé, A.: À l’intersection de la combinatoire des mots et de la géométrie discrète: Palindromes, symétries et pavages. PhD thesis, Université du Québec à Montréal (February 2012)
Provençal, X.: Combinatoire des mots, géométrie discrète et pavages. PhD thesis, Université du Québec à Montréal (September 2008)
Freeman, H.: On the encoding of arbitrary geometric configurations. IRE Transactions on Electronic Computers EC-10(2), 260–268 (1961)
Gross, J.L., Tucker, T.W.: Topological graph theory. Wiley (1987)
Spitzer, F.: A combinatorial lemma and its application to probability theory. Transactions of the American Mathematical Society 82, 323–339 (1956)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Brlek, S., Tremblay, H., Tremblay, J., Weber, R. (2014). Efficient Computation of the Outer Hull of a Discrete Path. In: Barcucci, E., Frosini, A., Rinaldi, S. (eds) Discrete Geometry for Computer Imagery. DGCI 2014. Lecture Notes in Computer Science, vol 8668. Springer, Cham. https://doi.org/10.1007/978-3-319-09955-2_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-09955-2_11
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09954-5
Online ISBN: 978-3-319-09955-2
eBook Packages: Computer ScienceComputer Science (R0)