21 search results - page 1 / 5 » On the Complexity of Point Recolouring in Geometric Graphs |
CCCG
2008
13 years 8 months ago
2008
Given a collection of points representing geographic data we consider the task of delineating boundaries based on the features of the points. Assuming that the features are binary...
DCG
2011
13 years 2 months ago
2011
We study the expected topological properties of ˇCech and Vietoris-Rips complexes built on random points in Rd . We find higher dimensional analogues of known results for connect...
CCCG
2004
13 years 8 months ago
2004
We propose a definition of locality for properties of geometric graphs. We measure the local density of graphs using region-counting distances [8] between pairs of vertices, and w...
DIS
2007
Springer
13 years 11 months ago
2007
Springer
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
GIS
2010
ACM
13 years 5 months ago
2010
ACM
We consider the problem of automatically cleaning massive sonar data point clouds, that is, the problem of automatically removing noisy points that for example appear as a result ...