Boundaries and Hulls of Euclidean Graphs e-bog
403,64 DKK
(inkl. moms 504,55 DKK)
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 versi...
E-bog
403,64 DKK
Forlag
Chapman and Hall/CRC
Udgivet
3 oktober 2018
Længde
201 sider
Genrer
PBMH
Sprog
English
Format
epub
Beskyttelse
LCP
ISBN
9781351690270
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.