Sciweavers

Share
CORR
2008
Springer
138views Education» more  CORR 2008»
9 years 2 days ago
Computing Minimum Spanning Trees with Uncertainty
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...
Thomas Erlebach, Michael Hoffmann 0002, Danny Kriz...
CGF
2010
112views more  CGF 2010»
9 years 3 days ago
Winding Roads: Routing edges into bundles
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...
A. Lambert, Romain Bourqui, David Auber
CGF
2010
169views more  CGF 2010»
9 years 3 days ago
Image-Based Edge Bundles: Simplified Visualization of Large Graphs
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 ...
Alexandru Telea, Ozan Ersoy
ALGORITHMICA
2008
63views more  ALGORITHMICA 2008»
9 years 4 days ago
The Swap Edges of a Multiple-Sources Routing Tree
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 ...
Bang Ye Wu, Chih-Yuan Hsiao, Kun-Mao Chao
DICTA
2003
9 years 1 months ago
Phase Congruency Detects Corners and Edges
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 ...
Peter Kovesi
CGIM
2003
9 years 1 months ago
Snake for Band Edge Extraction and Its Applications
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...
Min Li, Chandra Kambhamettu, Maureen C. Stone
ICALP
2000
Springer
9 years 3 months ago
Two-coloring Random Hypergraphs
: 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...
Dimitris Achlioptas, Jeong Han Kim, Michael Krivel...
COCOON
2006
Springer
9 years 3 months ago
Restricted Mesh Simplification Using Edge Contractions
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...
Mattias Andersson, Joachim Gudmundsson, Christos L...
GD
1998
Springer
9 years 4 months ago
A Framework for Drawing Planar Graphs with Curves and Polylines
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...
Michael T. Goodrich, Christopher G. Wagner
VVS
1998
IEEE
107views Visualization» more  VVS 1998»
9 years 4 months ago
Edge Preservation in Volume Rendering Using Splatting
: 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...
Jian Huang, Roger Crawfis, Don Stredney
books