This paper deals with the concept of geometric vicinity. The central question is: given a set S of n points on the plane and one of them p ͼ S, what points of S can be considered the neighbours of p in S? We review several definitions of the concept and we ask for efficient algorithms for computing the neighbours in practice. The paper to be a lesson on Geometry able to be used in the classroom in undergraduate level or even in high school.
© 2001-2024 Fundación Dialnet · Todos los derechos reservados