Sciweavers

215 search results - page 35 / 43
» Bregman Voronoi Diagrams
Sort
View
CORR
2010
Springer
152views Education» more  CORR 2010»
13 years 6 months ago
Applications of Geometric Algorithms to Reduce Interference in Wireless Mesh Network
In wireless mesh networks such as WLAN (IEEE 802.11s) or WMAN (IEEE 802.11), each node should help to relay packets of neighboring nodes toward gateway using multi-hop routing mec...
Hung-Chin Jang
DAC
2012
ACM
11 years 10 months ago
GDRouter: interleaved global routing and detailed routing for ultimate routability
Improving detailed routing routability is an important objective of a global router. In this paper, we propose GDRouter, an interleaved global routing and detailed routing algorit...
Yanheng Zhang, Chris Chu
WADS
1993
Springer
163views Algorithms» more  WADS 1993»
13 years 11 months ago
Minimum Weight Euclidean Matching and Weighted Relative Neighborhood Graphs
The Minimum Weight Euclidean Matching (MWEM) problem is: given 2n point sites in the plane with Euclidean metric for interpoint distances, match the sites into n pairs so that the...
Andy Mirzaian
VLDB
2006
ACM
171views Database» more  VLDB 2006»
14 years 7 months ago
Grid-partition index: a hybrid method for nearest-neighbor queries in wireless location-based services
Abstract Traditional nearest-neighbor (NN) search is based on two basic indexing approaches: object-based indexing and solution-based indexing. The former is constructed based on t...
Baihua Zheng, Jianliang Xu, Wang-Chien Lee, Dik Lu...
COMPGEOM
2010
ACM
14 years 21 days ago
Kinetic stable Delaunay graphs
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 ...
Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Ha...