Abstract
A linear axis is a skeleton recently introduced for simple polygons by Tanase and Veltkamp. It approximates the medial axis up to a certain degree, which is controlled by means of parameter ε> 0. A significant advantage of a linear axis is that its edges are straight line segments. We generalize the notion of a linear axis and the algorithm for its efficient computation to the case of general polygons, which might contain holes. We show that a linear axis ε-equivalent to the medial axis can be computed from the latter in linear time for almost all general polygons. If the medial axis is not pre-computed, and the polygon contains holes, this implies O(nlogn) total computation time for a linear axis.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aichholzer, O., Aurenhammer, F., Alberts, D., Gärtner, B.: A novel type of skeleton for polygons. The Journal of Universal Computer Science 1, 752–761 (1995)
Aichholzer, O., Aurenhammer, F.: Straight skeletons for general polygonal figures. In: Cai, J.-Y., Wong, C.K. (eds.) COCOON 1996. LNCS, vol. 1090, pp. 117–126. Springer, Heidelberg (1996)
Eppstein, D., Erickson, J.: Raising roofs, crashing cycles, and playing pool: applications of a data structure for finding pairwise interactions. Discrete and Computational Geometry 22(4), 569–592 (1999)
Kirkpatrick, D.G.: Efficient computation of continuous skeletons. In: Proc. 20th IEEE Annual Symp. on Foundations of Comput, pp. 18–27. IEEE Computer Society Press, Los Alamitos (1979)
Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Springer, Heidelberg (1985)
Tǎnase, M.: Shape Decomposition and Retrieval. Ph.D. Thesis, Utrecht University (2005)
Tǎnase, M., Veltkamp, R.C.: Straight skeleton approximating the medial axis. In: Proc. 12th Annual European Symposium on Algorithms, pp. 809–821 (2004)
Trofimov, V., Vyatkina, K.: Linear axis computation for polygons with holes. In: Proc. 23rd European Workshop on Computational Geometry, pp. 214–217 (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Trofimov, V., Vyatkina, K. (2007). Linear Axis for General Polygons: Properties and Computation. In: Gervasi, O., Gavrilova, M.L. (eds) Computational Science and Its Applications – ICCSA 2007. ICCSA 2007. Lecture Notes in Computer Science, vol 4705. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74472-6_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-74472-6_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74468-9
Online ISBN: 978-3-540-74472-6
eBook Packages: Computer ScienceComputer Science (R0)