Abstract
This paper analyses the properties of generalized conics that are defined by N focal points with weights. The generated shapes can be convex or concave. By varying the weights, it is possible to obtain up to N corners associated with the focal points. From the shape analysis perspective, the generalized conics extend the capabilities of the ellipse by adding the single extra parameter. In general, they enrich the potential of approaches to describe or represent the shape.
A. Gabdulkhakova—Supported by the Austrian Agency for International Cooperation in Education and Research (OeAD) within the OeAD Sonderstipendien program, financed by the Vienna PhD School of Informatics.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Borgefors, G.: Distance transformations in digital images. Comput. Vis. Graph. Image Process. 34(3), 344–371 (1986)
Gabdulkhakova, A., Kropatsch, W.G.: Confocal ellipse-based distance and confocal elliptical field for polygonal shapes. In: Proceedings of the International Conference on Pattern Recognition, pp. 3025–3030 (2018)
Gabdulkhakova, A., Kropatsch, W.G.: Generalized conics: properties and applications. In: Proceedings of the International Conference on Pattern Recognition, pp. 10728–10735 (2020)
Gabdulkhakova, A., Langer, M., Langer, B.W., Kropatsch, W.G.: Line Voronoi Diagrams using elliptical distances. In: Bai, X., Hancock, E.R., Ho, T.K., Wilson, R.C., Biggio, B., Robles-Kelly, A. (eds.) S+SSPR 2018. LNCS, vol. 11004, pp. 258–267. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-97785-0_25
Hilbert, D.: The Foundations of Geometry. Open Court Publishing Company, Chicago (1902)
Langer, M., Gabdulkhakova, A., Kropatsch, W.G.: Non-centered Voronoi Skeletons. In: Couprie, M., Cousty, J., Kenmochi, Y., Mustafa, N. (eds.) DGCI 2019. LNCS, vol. 11414, pp. 355–366. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-14085-4_28
Ostresh, L.M., Jr.: On the convergence of a class of iterative methods for solving the Weber location problem. Oper. Res. 26(4), 597–609 (1978)
Pickover, C.A.: The Math Book: From Pythagoras to the 57th Dimension, 250 Milestones in the History of Mathematics. Sterling Publishing Company, New York (2009)
Sekino, J.: n-ellipses and the minimum distance sum problem. Am. Math. Mon. 106(3), 193–202 (1999)
Torricelli, E.: Opere di Evangelista Torricelli. In: Vassura, G., Loria, G., Montanari, G. (eds.) vol. I/2, pp. 90–97 (1919)
Torricelli, E.: Opere di Evangelista Torricelli. In: Vassura, G., Loria, G., Montanari, G. (eds.) vol. III, pp. 426–431 (1919)
Weber, A., Pick, G.: Über den Standort der Industrien. Mohr, J.C.B (1922)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Appendices
Appendix A
Proof of Theorem 1
The pair of focal points, \(F_1 \text { and } F_2\), generates the weighted multifocal ellipse, such that the weight, \(0<\mu \le 1\), corresponds to \(F_2\) (Fig. 3b). Let us denote \(\delta (F_1,F_2)=2f\), \(\delta (F_1,P)=n\), \(\delta (F_2,P)=m\), and \(\widehat{F_1F_2P}=\alpha \). By definition the level set contains a group of points mapped to the same distance value. So the distance value at \(F_2\) is identical to the one at P. According to the normalized version of Eq. 6, it equals:
As noted from Eq. 12, the distance value corresponding to the level set with the corner equals the length of the line segment \(\overline{F_1F_2}\). Let us substitute it in the analogical equation for P:
To derive an alternative estimate of m, consider a triangle \(\bigtriangleup F_1PF_2\). According to the law of cosines [8]:
Substituting the value of n from Eq. 15 in Eq. 16 leads to:
The important assumption about the point P in continuous space states that it is infinitely close to \(F_2\). This implies that the length of m converges to zero. Then Eq. 18 is further simplified:
According to Eq. 20, the angle formed at the corner of the level set depends on the weight of the focal point and not on the distance between the focal points.
Appendix B
Proof of Theorem 2
The pair of focal points, \(F_1\) and \(F_2\), generates the weighted multifocal hyperbola (Fig. 6b). The level set passing through \(F_2\) contains the sharp corner. Let us denote \(\delta (F_1,F_2)=2f\), \(\delta (F_1,P)=n\), \(\delta (F_2,P)=m\), and \(\widehat{F_1F_2P}=\beta \). Assuming the normalized version of Eq. 9, the distance value at \(F_2\) equals:
Similar to the proof for the egg-shape, consider the triangle \(\bigtriangleup F_1PF_2\) and derive the following relations:
In continuous space, m is infinitely small. In discrete space, it can be assigned to zero, resulting in: \(\mu = -\cos \beta \). So the angle at the corner of the hyperbolic shape depends only on the weight of the respective focal point.
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Gabdulkhakova, A., Kropatsch, W.G. (2021). Generalized Conics with the Sharp Corners. In: Tavares, J.M.R.S., Papa, J.P., González Hidalgo, M. (eds) Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications. CIARP 2021. Lecture Notes in Computer Science(), vol 12702. Springer, Cham. https://doi.org/10.1007/978-3-030-93420-0_39
Download citation
DOI: https://doi.org/10.1007/978-3-030-93420-0_39
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-93419-4
Online ISBN: 978-3-030-93420-0
eBook Packages: Computer ScienceComputer Science (R0)