Proceedings of the Workshop on Proximity Graphs (1st) Held in Las Cruces, New Mexico on 30 November-2 December 1989

Abstract

Abstract : The motivations for holding this workshop came from the recently discovered associations between proximity graphs and Pathfinder networks. The elegant theoretical domain and the breadth of applications make this a very rich area indeed. The workshop was attended by several of the leading researchers in proximity graphs, and was organized so that there would be adequate opportunity for discussion of common interests. The presentation were organized into four sections: theoretical foundations, algorithms and computational aspects, applications, and graphics and unsolved problems. There were also demonstrations of three systems based on proximity graphs: information retrieval using Pathfinder networks, a robotic vision database system organized as a monotonic search network, and a UNIX help system on a Hypertext Browser organized as a Pathfinder network. A tool to display and manipulate large graphs was also demonstrated. The workshop brought together some mainstream graph theorists and the researchers who had been working on proximity graphs as a special case of graph theory, and the interchange was profitable for all.