141 search results - page 5 / 29 » Partitioning Approach to Visualization of Large Graphs |
ACSC
2005
IEEE
14 years 1 months ago
2005
IEEE
Many classical graph visualization algorithms have already been developed over the past decades. However, these algorithms face difficulties in practice, such as the overlapping n...
PAKDD
2004
ACM
14 years 25 days ago
2004
ACM
This paper proposes a two-step graph partitioning method to discover constrained clusters with an objective function that follows the well-known minmax clustering principle. Compar...
ICAT
2007
IEEE
14 years 1 months ago
2007
IEEE
This study concerns the development of 3D interfaces that aid the navigation of large data structures through the usage of the HSV color space, and the ensuing “spatial framesâ€...
ICRA
1999
IEEE
13 years 11 months ago
1999
IEEE
We present a novel approach we call partitioning where the robot's degrees- of-freedom (D OF) are categorized into two classes based on joint kinematics and dynamics to desig...
GD
1998
Springer
13 years 11 months ago
1998
Springer
We describe a new approach for cluster-based drawing of very large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type de...