203 search results - page 4 / 41 » Incremental computation of planar maps |
ICALP
2003
Springer
14 years 6 days ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
GIS
2003
ACM
14 years 6 days ago
2003
ACM
Accurate postal code maps have many applications within GIS as the postal code has the potential to link the address description of buildings to their location in a specified glob...
COMGEO
2007
ACM
13 years 7 months ago
2007
ACM
We consider the problem of simultaneous embedding of planar graphs. There are two variants of this problem, one in which the mapping between the vertices of the two graphs is given...
IPL
2002
13 years 6 months ago
2002
Given a planar point set, we wish to label the points with uniform circular labels such that each input point lies on the boundary of two labels, none of the interiors of the labe...
ICRA
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract— This paper presents a novel use of spectral clustering algorithms to support cases where the entries in the affinity matrix are costly to compute. The method is increm...