| Description |
1 online resource (xv, 201 pages) : illustrations |
| Contents |
Fundamentals on graphs and computational geometry -- Hulls of point sets and graphs -- Centralized algorithms for boundary detection -- Distributed algorithms for boundary detection -- The simulator CupCarbon and boundary detection -- Applications |
| 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--back cover |
| Bibliography |
Includes bibliographical references and index |
| Notes |
Print version record |
| Subject |
Graph theory.
|
|
MATHEMATICS -- General.
|
|
Graph theory
|
| Form |
Electronic book
|
| Author |
Bezoui, Madani, author.
|
|
Euler, Reinhardt, 1950- author.
|
| ISBN |
9781351690270 |
|
1351690272 |
|
9781315169897 |
|
1315169894 |
|
