126 search results - page 17 / 26 » Self-improving algorithms for delaunay triangulations |
CCCG
2008
14 years 11 months ago
2008
We study the problem of computing Voronoi diagrams distributedly for a set of nodes of a network modeled as a Unit Disk Graph (UDG). We present an algorithm to solve this problem ...
COMPGEOM
1993
ACM
15 years 1 months ago
1993
ACM
For a polygon P, the bounded Voronoi diagram of P is a partition of P into regions assigned to the vertices of P. A point p inside P belongs to the region of a vertex v if and onl...
66
Voted
ICPR
2000
IEEE
15 years 2 months ago
2000
IEEE
This paper presents a new method for the incremental integration of overlapped range images. It is assumed thatframe transformations between all pairs of views can be reliably com...
SSPR
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. In order to use structural techniques from graph-based pattern recognition, a first necessary step consists in extracting a graph in an automatic way from an image. We pr...
105
click to vote
CORR
2010
Springer
14 years 8 months ago
2010
Springer
In wireless mesh networks such as WLAN (IEEE 802.11s) or WMAN (IEEE 802.11), each node should help to relay packets of neighboring nodes toward gateway using multi-hop routing mec...