42 search results - page 7 / 9 » Triangles in Euclidean Arrangements |
SAC
2003
ACM
14 years 29 days ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
In wireless networks, the knowledge of nodal distances is essential for performance analysis and protocol design. When determining distance distributions in random networks, the u...
IJWMC
2010
13 years 5 months ago
2010
Coverage, fault tolerance and power consumption constraints make optimal placement of mobile sensors or other mobile agents a hard problem. We have developed a model for describin...
ISVD
2007
IEEE
14 years 2 months ago
2007
IEEE
Given a set of points called sites, the Voronoi diagram is a partition of the plane into sets of points having the same closest site. Several generalizations of the Voronoi diagra...
VISUALIZATION
1996
IEEE
13 years 12 months ago
1996
IEEE
This can be a costly operation. When the data is arranged according to its three-dimensional coordinates, calculating the contour surfaces requires examining each data cell. Avoidi...