New applications of computational geometry and graph theory to cellular mobile communications
Hiroshi Tamura, M. Sengoku, Shoji Shinoda · 2002
Various problems exist to which computational geometry and graph and network theory are applicable in mobile communication services. For example, it is well known that the coloring algorithms of graphs are applicable in channel assignment algorithms in cellular systems. In this paper, we show some examples of new applications of computational geometry and graph theory to cellular mobile communications.