Neighborhood graphs are an effective and very widespread technique in several fields. But, in spite of the neighborhood graphs interest, their construction algorithms suffer from a very high complexity what prevents their implementation for great data volumes processing applications. With this high complexity, the update task is also affected. These structures constitute actually a possible representation of the point location problem in a multidimensional space. The point location on an axis can be solved by a binary research. This same problem in the plan can be solved by using a voronoi diagram, but when dimension becomes higher, the location becomes more complex and difficult to manage. We propose in this paper an effective method for point location in a multidimensional space with an aim of effectively and quickly updating neighborhood graphs. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Hacid, H., & Zighed, A. D. (2005). An effective method for locally neighborhood graphs updating. In Lecture Notes in Computer Science (Vol. 3588, pp. 930–939). Springer Verlag. https://doi.org/10.1007/11546924_91
Mendeley helps you to discover research relevant for your work.