Abstract
A set M in is rt-convex if every pair of its points is included in a 3-point subset {x,y,z} of M satisfying . We find here for various families of sets the minimal number of points necessary to add to the sets in order to render them rt-convex
References
- R. Blind, G. Valette, T. Zamfirescu: Rectangular convexity, Geom. Dedicata 9 (1980) 317–327.https://doi.org/10.1007/BF00181177Google Scholar
- K. Böröczky Jr.: Rectangular convexity of convex domains of constant width, Geom. Dedicata 34 (1990) 13–18.https://doi.org/10.1007/BF00150684Google Scholar
- E. Magazanik, M. A. Perles: Staircase connected sets, Discrete Comput. Geom. 37 (2007) 587–599.https://doi.org/10.1007/s00454-007-1308-9Google Scholar
- L. Yuan, T. Zamfirescu: Right triple convexity, manuscript.Google Scholar
- T. Zamfirescu: Right convexity, J. Convex Analysis 21 (2014) 253–260.https://doi.org/10.68381/jca21014Google Scholar
Suggested citation
Published by Heldermann Verlag, 2015. Rights now held by Banach Press LLC.
