Abstract
Given two Digital Straight Segments (DSS for short) of known minimal characteristics, we investigate the union of these DSSs: is it still a DSS ? If yes, what are its minimal characteristics ? We show that the problem is actually easy and can be solved in, at worst, logarithmic time using a state-of-the-art algorithm. We moreover propose a new algorithm of logarithmic worst-case complexity based on arithmetical properties. But when the two DSSs are connected, the time complexity of this algorithm is lowered to \(\mathcal{O}(1)\) and experiments show that it outperforms the state-of-the art one in any case.
Chapter PDF
Similar content being viewed by others
References
DGtal: Digital Geometry Tools and Algorithms Library, http://libdgtal.org
Damiand, G., Coeurjolly, D.: A generic and parallel algorithm for 2D digital curve polygonal approximation. Journal of Real-Time Image Processing (JRTIP) 6(3), 145–157 (2011)
Debled-Rennesson, I., Feschet, F., Rouyer-Degli, J.: Optimal blurred segments decomposition of noisy shapes in linear time. Computers & Graphics 30(1), 30–36 (2006)
Debled-Rennesson, I., Reveillès, J.P.: A linear algorithm for segmentation of digital curves. Inter. Jour. of Pattern Recog. and Art. Intell. 9(6), 635–662 (1995)
Debled-Rennesson, I., Reveillès, J.P.: A new approach to digital planes. In: SPIE - Vision Geometry III (1994)
Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics. Addisson-Wesley (1994)
Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestor. SIAM Journal on Computing 13(2), 338–355 (1984)
Jacob, M.A.: Applications quasi-affines. Ph.D. thesis, Université Louis Pasteur, Strasbourg, France (1993)
Lachaud, J.O., Said, M.: Two efficient algorithms for computing the characteristics of a subsegment of a digital straight line. Discrete Applied Mathematics 161(15), 2293–2315 (2013)
McIlroy, M.D.: A note on discrete representation of lines. AT&T Technical Journal 64(2), 481–490 (1985)
O’Rourke, J.: An on-line algorithm for fitting straight lines between data ranges. Commun. ACM 24(9), 574–578 (1981)
O’Rourke, J.: Computational Geometry in C. Cambridge University Press (1998)
Roussillon, T., Tougne, L., Sivignon, I.: Computation of binary objects sides number using discrete geometry, application to automatic pebbles shape analysis. In: Int. Conf. on Image Analysis and Processing, pp. 763–768 (2007)
Roussillon, T.: Algorithmes d’extraction de modèles géométriques discrets pour la représentation robuste des formes. Ph.D. thesis, Université Lumière Lyon 2 (2009)
Said, M., Lachaud, J.O., Feschet, F.: Multiscale analysis of digital segments by intersection of 2D digital lines. In: ICPR 2010, pp. 4097–4100 (2010)
Sivignon, I., Dupont, F., Chassery, J.M.: Digital intersections: minimal carrier, connectiviy and periodicity properties. Graphical Models 66(4), 226–244 (2004)
Sivignon, I.: Walking in the farey fan to compute the characteristics of a discrete straight line subsegment. In: Gonzalez-Diaz, R., Jimenez, M.-J., Medrano, B. (eds.) DGCI 2013. LNCS, vol. 7749, pp. 23–34. Springer, Heidelberg (2013)
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
Sivignon, I. (2014). Algorithms for Fast Digital Straight Segments Union. 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_29
Download citation
DOI: https://doi.org/10.1007/978-3-319-09955-2_29
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09954-5
Online ISBN: 978-3-319-09955-2
eBook Packages: Computer ScienceComputer Science (R0)