Abstract
In this paper, we deal with analytic and geometrical properties of geodesic convex sets and geodesic paths. We show that Blaschke’s Theorem for convex sets is also true for geodesic convex sets and geodesic paths in a simple polygon. Some geometrical properties of geodesic triangles are presented. Furthermore, separation of geodesic convex sets is shown.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Toussaint, G.T.: Computing geodesic properties inside a simple polygon. Rev. Intell. Artif. 3, 9–42 (1989)
Ganguli, A., Cortes, J., Bullo, F.: Multirobot rendezvous with visibility sensors in nonconve environments. IEEE Trans. Robot. 25(2), 340–352 (2009)
Aronov, B., Fortune, S., Wilfong, G.: The furthest-site geodesic voronoi diagram. Discrete Comput. Geom. 9, 217–255 (1993)
An, P.T., Giang, D.T., Hai, N.N.: Some computational aspects of geodesic convex sets in a simple polygon. Numer. Funct. Anal. Optim. 31(4), 221–231 (2010)
Pollack, R., Sharir, M., Rote, G.: Computing the geodesic center of a simple polygon. Discrete Comput. Geom. 4(1), 611–626 (1989)
Suri, S.: Computing geodesic furthest neighbors in simple polygons. J. Comput. Syst. Sci. 39, 220–235 (1989)
Rapcsák, T.: Smooth Nonlinear Optimization in ℝn. Kluwer Academic, Dordrecht (1997)
O’Rourke, J.: Computational Geometry in C, 2nd edn. Cambridge University Press, Cambridge (1998)
Lee, T., Preparata, F.P.: Euclidean shortest paths in the presence of rectilinear barriers. Networks 14, 393–410 (1984)
de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications, 2nd edn. Springer, Berlin (2000)
Mitchell, J.S.B.: Geometric shortest paths and network optimization. In: Sack, J.R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 633–701. Elsevier, Amsterdam (2000)
Aubin, J.P.: Applied Abstract Analysis. Wiley, New York (1977)
Webster, R.: Convexity. Oxford University Press, London (1994)
An, P.T.: Method of orienting curves for determining the convex hull of a finite set of points in the plane. Optimization 59(2), 175–179 (2010)
An, P.T.: A modification of Graham’s algorithm for determining the convex hull of a finite planar set. Ann. Math. Inform. 34, 3–8 (2007)
Preparata, F.P., Shamos, M.I.: Computational Geometry—An Introduction, 2nd edn. Springer, Berlin (1988)
Benson, R.V.: Euclidean Geometry and Convexity. McGraw-Hill, New York (1966)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Constantin Zalinescu.
Rights and permissions
About this article
Cite this article
Hai, N.N., An, P.T. Blaschke-Type Theorem and Separation of Disjoint Closed Geodesic Convex Sets. J Optim Theory Appl 151, 541–551 (2011). https://doi.org/10.1007/s10957-011-9868-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10957-011-9868-5