Computer Science – Discrete Mathematics
Scientific paper
2009-11-03
Computer Science
Discrete Mathematics
Scientific paper
When drawing graphs whose edges and nodes contain text or graphics, such informa tion needs to be displayed without overlaps, either as part of the initial layout or as a post-processing step. The core problem in removing overlaps lies in retaining the structural information inherent in a layout, minimizing the additional area required, and keeping edges as straight as possible. This paper presents a unified node and edge overlap removal algorithm that does well at solving this problem.
No associations
LandOfFree
Visualizing Graphs with Node and Edge Labels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Visualizing Graphs with Node and Edge Labels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Visualizing Graphs with Node and Edge Labels will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-256927