Boundaries and Hulls of Euclidean Graphs: From Theory to Practice presents concepts and algorithms for finding convex, concave and polygon hulls of Euclidean graphs.
1 Fundamentals on Graphs and Computational Geometry
2 Hulls of Point Sets and Graphs
3 Centralized Algorithms for Boundary Detection
4 Distributed Algorithms for Boundary Detection
5 The Simulator CupCarbon and Boundary Detection
6 Applications