Boundaries and Hulls of Euclidean Graphs: From Theory to Practice

Ahcene Bounceur, Madani Bezoui, Reinhardt Euler

August 7, 2018 Forthcoming by Chapman and Hall/CRC
Reference - 200 Pages - 127 B/W Illustrations
ISBN 9781138048911 - CAT# K33059

was $99.95

USD$79.96

SAVE ~$19.99

Add to Wish List
FREE Standard Shipping!

Features

      • Presents new concepts and efficient algorithms to find the boundary nodes in a Euclidean graph, connected or not, plane or not, their centralized and distributed versions, and their applications
      • Introduces a new simulator allowing simulation of distributed communication systems, in general, and Wireless Sensor Networks (WSNs), in particular
      • Illustrates applications that can be modelled as a problem of finding the boundary nodes in a graph (e.g., medicine, military, emergency, civil, Internet of Things (IoT), Big Data, security, etc.)

       

      Summary

      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.

      Instructors

      We provide complimentary e-inspection copies of primary textbooks to instructors considering our books for course adoption.

      Request an
      e-inspection copy

      Share this Title