Sciweavers

1265 search results - page 81 / 253
» Algorithms for Drawing Media
Sort
View
146
Voted
GD
1995
Springer
15 years 7 months ago
Fast Interactive 3-D Graph Visualization
We present a 3-D version of GEM [6], a randomized adaptive layout algorithm for nicely drawing undirected graphs, based on the spring-embedder paradigm [4]. The new version, GEM-3D...
Ingo Bruß, Arne Frick
121
Voted
ICDIM
2008
IEEE
15 years 10 months ago
Population-variance and explorative power of Harmony Search: An analysis
This paper presents a simple mathematical analysis of some features of the Harmony Search algorithm (HS). HS is a recently developed derivative-free optimization algorithm, which ...
Arpan Mukhopadhyay, Anwit Roy, Sourav Das, Swagata...
127
Voted
WSCG
2001
89views more  WSCG 2001»
15 years 5 months ago
Searching Triangle Strips Guided by Simplification Criterion
Triangle strips are widely used as a method to accelerate the visualisation process of polygon models in interactive graphics applications. Another widely used method to improve d...
Oscar Belmonte, José Ribelles, Inmaculada R...
106
Voted
APVIS
2009
15 years 4 months ago
Extending the spring-electrical model to overcome warping effects
The spring-electrical model based force directed algorithm is widely used for drawing undirected graphs, and sophisticated implementations can be very efficient for visualizing la...
Yifan Hu, Yehuda Koren
134
Voted
MM
2003
ACM
84views Multimedia» more  MM 2003»
15 years 9 months ago
Temporal event clustering for digital photo collections
We present similarity-based methods to cluster digital photos by time and image content. The approach is general, unsupervised, and makes minimal assumptions regarding the structu...
Matthew L. Cooper, Jonathan Foote, Andreas Girgens...