Sprache: Englisch
Verlag: Harbin Institute of Technology Press, 2021
ISBN 10: 756034402X ISBN 13: 9787560344027
Anbieter: liu xing, Nanjing, JS, China
paperback. Zustand: New. Paperback. Pub Date: 2021-08-01 Pages: 132 Language: English Publisher: Harbin Institute of Technology Press Geometric Path: Theory and Practice (English) is an English edition of a monograph on computational geometry. The Chinese title or It can be translated as Geometric Path-Theory and Practice.?Geometric Path: Theory and Practice (English) provides an in-depth introduction to the optimization path problem of geometric graphs.?A geometric graph is a graph in which each node has position in.
Taschenbuch. Zustand: Neu. Geometric Routing | Theory and practice | Sada Narayanappa | Taschenbuch | Englisch | VDM Verlag Dr. Müller | EAN 9783639202182 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.
Anbieter: Mispah books, Redhill, SURRE, Vereinigtes Königreich
EUR 185,38
Anzahl: 1 verfügbar
In den WarenkorbPaperback. Zustand: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Anbieter: moluna, Greven, Deutschland
EUR 46,32
Anzahl: Mehr als 20 verfügbar
In den WarenkorbKartoniert / Broschiert. Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Narayanappa SadaSada Narayanappa received his Ph.D in Mathematics and Computer Science from the University of Denver in 2006. His research interests include computational geometry, graph theory, algorithms, design and implementati.
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - This book is provides an insight into the problem of optimal routing in geometric graphs. A geometric graph is a graph in which each node has location information, and edges have some geometrical constraints. The problems considered in this book fall into two main categories(1) routing in ad hoc wireless networks (2) routing through weighted regions. The fundamental problem in ad hoc wireless networks is broadcasting messages without flooding and it is modeled on unit disk graphs. The Weighted Region Problem deals with finding an optimal route between two points in the plane, and is modeled on a planar graph where paths are allowed to pass through the faces.