A set in
is called
-convex if, for any two distinct points in
, there exists a third point in
, such that one of the three points is equidistant from the others. In this paper we first investigate nondiscrete
-convex sets, then discuss about the
-convexity of the eleven Archimedean tilings, and treat subsequently finite subsets of the square lattice. Finally, we obtain a lower bound on the number of isosceles triples contained in an
-point
-convex set.
Isosceles triple convexity
Yuang, Liping, Zamfirescu, Tudor and Zhang, Yue
Abstract
![Download PDF file](https://www.carpathian.cunbm.utcluj.ro/wp-content/uploads/2016/07/adobe-PDF-icon.jpg)
Full PDF
![Download PDF file](https://www.carpathian.cunbm.utcluj.ro/wp-content/uploads/2016/07/adobe-PDF-icon.jpg)
Additional Information
Author(s) | Yuan, Liping, Zamfirescu, Tudor, Zhang, Yue |
---|---|
DOI | https://doi.org/10.37193/CJM.2017.01.13 |