215 search results - page 29 / 43 » Farthest-Polygon Voronoi Diagrams |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
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...
DAC
2012
ACM
11 years 10 months ago
2012
ACM
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...
ISPD
2000
ACM
13 years 12 months ago
2000
ACM
We address the problem of computing critical area for missing material defects in a circuit layout. The extraction of critical area is the main computational problem in VLSI yield...
AAIM
2009
Springer
14 years 2 months ago
2009
Springer
We develop algorithms to compute Voronoi diagrams, shortest path maps, and the Fr´echet distance in the plane with polygonal obstacles. Distances between points are measured eithe...
SIBGRAPI
2005
IEEE
14 years 1 months ago
2005
IEEE
We present an algorithm that creates a mosaic effect for an image in an adaptive and automatic fashion. The algorithm is automatic because it does not need user intervention, exce...