Boundaries and hulls of Euclidean graphs : from theory to practice

Boundaries and Hulls of Euclidean Graphs: From Theory to Practice presents concepts and algorithms for finding convex, concave and polygon hulls of Euclidean graphs.

It also includes some implementations, determining and comparing their complexities.

Since the implementation is application-dependent, either centralized or distributed, some basic concepts of the centralized and distributed versions are reviewed.

Theoreticians will find a presentation of different algorithms together with an evaluation of their complexity and their utilities, as well as their field of application.

Practitioners will find some practical and real-world situations in which the presented algorithms can be used.