VISUALIZATION
1999
IEEE
13 years 8 months ago
1999
IEEE
Many applications produce three-dimensional points that must be further processed to generate a surface. Surface reconstruction algorithms that start with a set of unorganized poi...
ISAAC
2009
Springer
13 years 9 months ago
2009
Springer
An induced packing of odd cycles in a graph is a packing such that there is no edge in a graph between any two odd cycles in the packing. We prove that the problem is solvable in t...
ESA
2003
Springer
13 years 9 months ago
2003
Springer
Let G = (V, E) be an undirected graph, with three numbers d0(e) ≥ d1(e) ≥ d2(e) ≥ 0 for each edge e ∈ E. A solution is a subset U ⊆ V and di(e) represents the cost contr...
WWW
2003
ACM
13 years 9 months ago
2003
ACM
In the past few years we have seen a huge industrial investment on the development of content delivery networks (CDNs) which provide a large number of caches and storage devices a...
IWPEC
2004
Springer
13 years 9 months ago
2004
Springer
Let G = V; E be a graph. The linear-width of G is de ned as the smallest integer k such that E can be arranged in a linear ordering e1; : : : ; er such that for every i = 1; :...
SAC
2004
ACM
13 years 9 months ago
2004
ACM
Extracting object boundaries in thermal images is a challenging task because of the amorphous nature of the images and the lack of sharp boundaries. Classical edge-based segmentat...
INFOCOM
2005
IEEE
13 years 10 months ago
2005
IEEE
— We consider the problem of link scheduling in a sensor network employing a TDMA MAC protocol. Our link scheduling algorithm involves two phases. In the first phase, we assign ...
WADS
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. Edge casing is a well-known method to improve the readability of drawings of non-planar graphs. A cased drawing orders the edges of each edge crossing and interrupts the ...
GD
2007
Springer
13 years 10 months ago
2007
Springer
Let G = (V, E) be a graph with n vertices and m ≥ 4n edges drawn in the plane. The celebrated Crossing Lemma states that G has at least Ω(m3 /n2 ) pairs of crossing edges; or ...