142 search results - page 28 / 29 » Augmenting the connectivity of geometric graphs |
SMA
2003
ACM
13 years 11 months ago
2003
ACM
3D scanners developed over the past several decades have facilitated the reconstruction of complicated engineering parts. Typically the boundary representation of a part is recons...
ICCAD
1999
IEEE
13 years 10 months ago
1999
IEEE
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
IPPS
1999
IEEE
13 years 10 months ago
1999
IEEE
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
SIGGRAPH
1991
ACM
13 years 9 months ago
1991
ACM
The number of polygons comprising interesting architectural models is many more than can be rendered at interactive frame rates. However, due to occlusion by opaque surfaces (e.g....
TSP
2010
13 years 20 days ago
2010
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...