On one-dimensional continua uniformly approximating planar sets
Article
First Online:
Received:
Accepted:
- 38 Downloads
- 3 Citations
Abstract
Consider the class of closed connected sets \(\Sigma\subset {\cal R}^n\) satisfying length constraint \({\cal H}(\Sigma)\leq l\) with given l>0. The paper is concerned with the properties of minimizers of the uniform distance F M of Σ to a given compact set \(M\subset {\cal R}^n\),
where dist(y, Σ) stands for the distance between y and Σ. The paper deals with the planar case n=2. In this case it is proven that the minimizers (apart trivial cases) cannot contain closed loops. Further, some mild regularity properties as well as structure of minimizers is studied.
$$
F_M(\Sigma):= \max_{y\in M} dist(y,\Sigma),
$$
(22)
Keywords
Optimal Transportation Minimal Network Energetic Point Homeomorphic Image Optimal Transportation Problem
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
- 1.Ambrosio, L., Fusco, N., Pallara, D.: Functions of Bounded Variation and Free Discontinuity Problems. Oxford mathematical monographs. Oxford University Press, Oxford (2000)Google Scholar
- 2.Buttazzo, G., Oudet, E., Stepanov, E.: Optimal transportation problems with free Dirichlet regions. Progress in Nonlinear Diff. Equations and their Applications 51, 41–65 (2002)MathSciNetGoogle Scholar
- 3.Buttazzo, G., Stepanov, E.: Optimal transportation networks as free Dirichlet regions in the Monge-Kantorovich problem. Ann. Scuola Norm. Sup. Pisa Cl. Sci II(4), 631–678 (2003)MathSciNetGoogle Scholar
- 4.Buttazzo, G., Stepanov, E.: Minimization problems for average distance functionals. Calculus of Variations: Topics from the Mathematical Heritage of Ennio De Giorgi, D. Pallara (ed.), Quaderni di Matematica, Series edited by Dipartimento di Matematica 14 (2004), 47–83, Seconda Università di Napoli, CasertaMATHMathSciNetGoogle Scholar
- 5.David, G., Semmes, S.: Analysis of and on uniformly rectifiable sets, vol. 38 of Math. Surveys Monographs. Amer. Math. Soc., Providence, RI (1993)Google Scholar
- 6.Drezner, Z. (ed.): Facility location: A survey of applications and methods. Springer series in operations research. Springer Verlag (1995)Google Scholar
- 7.Ivanov, A.O., Tuzhilin, A.A.: Minimal networks: The Steiner problem and its generalizations. CRC Press (1994)Google Scholar
- 8.Kuratowski, C.: Topologie, vol. 1. Państwowe Wydawnictwo Naukowe, Warszawa (1958) in FrenchGoogle Scholar
- 9.Morgan, F., Bolton, R.: Hexagonal economic regions solve the location problem. Amer. Math. Monthly 109(2), 165–172 (2001)CrossRefMathSciNetGoogle Scholar
- 10.Pollack, P.: Lazy traveling salesman problem. Master's thesis, The Technion–Israel Institute of Technology, Haifa (2002)Google Scholar
- 11.Suzuki, A., Drezner, Z.: The p-center location. Location science 4(1–2), 69–82 (1996)Google Scholar
- 12.Suzuki, A., Okabe, A.: Using Voronoi diagrams. In: Drezner, Z. (ed.): Facility location: A survey of applications and methods, Springer series in operations research, pp. 103–118. Springer Verlag (1995)Google Scholar
Copyright information
© Springer-Verlag 2006