Características Asintóticas de las Gráficas de Proximidad

Summary

Academic presentation connecting local geometric acceptance rules in proximity graphs with global probabilistic laws, using nearest-neighbor, Gabriel, relative-neighborhood, and Delaunay graphs as motivating examples.

Context

The presentation asks what global structure emerges when a local geometric proximity rule is repeatedly applied to a point cloud.

Main contributions

• Introduces proximity graphs as geometric graphs whose edges are selected by local acceptance rules.
• Compares nearest-neighbor, Gabriel, relative-neighborhood, and Delaunay structures on a common point set.
• Connects local geometric definitions with asymptotic probabilistic behavior.