Learn More
In this paper we present a graph clustering software called DPClus, which we have developed based on a clustering algorithm. The algorithm tends to isolate densely connected regions of a graph as clusters. Users have freedom to choose two input parameters within reasonable range and thus to affect the outcome of the clustering up to certain extent. Though(More)
Four-dimensional (4D) space is not intuitive to human mind. Commonly used examples of 4D space, such as the deep sea and the universe, are difficult for many people to feel or image. Research on the visualization of high dimensional polygons [1] helps people become aware of high dimensional spaces and feel their beauty, complexity and variations.
  • 1