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.
1 Fundamentals on graphs and computational geometry. 2 Hulls of point sets and graphs. 3 Centralized algorithms. 4 Distributed algorithms. 5 The Simulator CupCarbon and Boundary Detection. 6 Applications
Ahcène Bounceur is an associate professor of computer science at Lab-STICC laboratory (CNRS 6285), University of Brest, France. His current research activities are focused on: tools for parallel and physical simulation of WSNs dedicated to Smart-cities and IoT, distributed algorithms and sampling methods for Big Data mining.
Madani Bezoui is an assistant professor of operations research at the University of Boumerdes, Algeria. His research interests include: combinatorial algorithms and optimization, multi-objective optimization, portfolio selection, Big Data and IoT.
Reinhardt Euler is a professor of computer science at Lab-STICC laboratory (CNRS 6285), University of Brest, France. His research interests include: combinatorial algorithms and optimization, graph theory, and the efficient solution of large-scale, real-life problem instances.
Rohkem infot Taylor & Francis e-raamatute kohta