This paper presents the state of the art in the area of topology‐based visualization. It
describes the process and results of an extensive annotation for generating a definition and …

Creating a static visualization for a time-dependent scalar field is a non-trivial task, yet very
insightful as it shows the dynamics in one picture. Existing approaches are based on a …

Considering the size discreteness of commercially available metal plates and the intrinsic
buckling strength vulnerability of slender silo, this paper proposed a methodology, which …

Combinatorial optimization problems and corresponding (meta-) heuristics have received
much attention in the literature. Especially, the structural or topological analysis of search …

Implicit polynomial can efficiently represent the object contour for the curve fitting, and
fractional implicit polynomial (FIP) is capable of describing complex objects at lower degree …

Discrete combinatorial optimization problems such as the Traveling Salesman Problem
have various applications in science and in everyday life. The complexity of the problem and …

Particle swarm optimization (PSO) is a metaheuristic where a swarm of particles moves
within a search space in order to find an optimal solution. PSO has been applied to …

Visualization of an evolutionary algorithm may lead to better understanding of how it works.
In this paper, three dimension reduction techniques (ie PCA, Sammon mapping, and …

Dynamic hierarchical data describes phenomena in a wide range of domains, from file
management to demographics and business administration, as well as feature extraction …

In this paper we propose some changes and extensions of the visualization approach that is
used in the visualization tool dPSO-Vis. It is shown also how corresponding visualizations …