339 search results - page 44 / 68 » Geometry of Graphs |
COMPGEOM
2010
ACM
14 years 2 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
TNN
2010
13 years 3 months ago
2010
In this paper we provide theoretical and numerical analysis of a geometric activity flow network model which is aimed at explaining mathematically the scale-free functional graph s...
COMPGEOM
2004
ACM
14 years 2 months ago
2004
ACM
A geometric graph is a simple graph G = (V, E) with an embedding of the set V in the plane such that the points that represent V are in general position. A geometric graph is said...
RT
1999
Springer
14 years 1 months ago
1999
Springer
A visibility algorithm for triangulated panoramas is proposed. The algorithm can correctly resolve the visibility without making use of any depth information. It is especially usef...
INFOCOM
2007
IEEE
14 years 3 months ago
2007
IEEE
— Wireless routing based on an embedding of the connectivity graph is a very promising technique to overcome shortcomings of geographic routing and topology-based routing. This i...