| 000 | 01575 a2200349 4500 | ||
|---|---|---|---|
| 001 | 0367657171 | ||
| 005 | 20250317100352.0 | ||
| 008 | 250312042020xx eng | ||
| 020 | _a9780367657178 | ||
| 037 |
_bTaylor & Francis _cGBP 46.99 _fBB |
||
| 040 | _a01 | ||
| 041 | _aeng | ||
| 072 | 7 |
_aPBD _2thema |
|
| 072 | 7 |
_aPBV _2thema |
|
| 072 | 7 |
_aPBW _2thema |
|
| 072 | 7 |
_aPBD _2bic |
|
| 072 | 7 |
_aPBV _2bic |
|
| 072 | 7 |
_aPBW _2bic |
|
| 072 | 7 |
_aCOM046000 _2bisac |
|
| 072 | 7 |
_aMAT000000 _2bisac |
|
| 072 | 7 |
_aMAT003000 _2bisac |
|
| 072 | 7 |
_aMAT036000 _2bisac |
|
| 072 | 7 |
_a511.5 _2bisac |
|
| 100 | 1 | _aAhcene Bounceur | |
| 245 | 1 | 0 |
_aBoundaries and Hulls of Euclidean Graphs _bFrom Theory to Practice |
| 250 | _a1 | ||
| 260 |
_bChapman and Hall/CRC _c20200930 |
||
| 300 | _a201 p | ||
| 520 | _bBoundaries 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. | ||
| 700 | 1 |
_aMadani Bezoui _4A01 |
|
| 700 | 1 |
_aReinhardt Euler _4A01 |
|
| 999 |
_c296 _d296 |
||