CORR
2008
Springer
13 years 4 months ago
2008
Springer
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
CGF
2010
13 years 4 months ago
2010
Visualizing graphs containing many nodes and edges efficiently is quite challenging. Drawings of such graphs generally suffer from visual clutter induced by the large amount of ed...
CGF
2010
13 years 4 months ago
2010
We present a new approach aimed at understanding the structure of connections in edge-bundling layouts. We combine the advantages of edge bundles with a bundle-centric simplified ...
ALGORITHMICA
2008
13 years 4 months ago
2008
Let T be a spanning tree of a graph G and S V (G) be a set of sources. The routing cost of T is the total distance from all sources to all vertices. For an edge e of T, the swap ...
DICTA
2003
13 years 5 months ago
2003
Abstract. There are many applications such as stereo matching, motion tracking and image registration that require so called ‘corners’ to be detected across image sequences in ...
CGIM
2003
13 years 5 months ago
2003
A novel snake model suitable for edge extraction of bandshape objects is presented in this paper. Based on the proposed model, an edge tracking system, EdgeTrak, has been develope...
ICALP
2000
Springer
13 years 8 months ago
2000
Springer
: A 2-coloring of a hypergraph is a mapping from its vertex set to a set of two colors such that no edge is monochromatic. Let H = H k n p be a random k-uniform hypergraph on a ver...
COCOON
2006
Springer
13 years 8 months ago
2006
Springer
We consider the problem of simplifying a triangle mesh using edge contractions, under the restriction that the resulting vertices must be a subset of the input set. That is, contr...
GD
1998
Springer
13 years 8 months ago
1998
Springer
We describe a unified framework of aesthetic criteria and complexity measures for drawing planar graphs with polylines and curves. This framework includes several visual properties...
VVS
1998
IEEE
13 years 8 months ago
1998
IEEE
: This paper presents a method to preserve sharp edge details in splatting for volume rendering. Conventional splatting algorithms produce fuzzy images for views close to the volum...