We propose a layout algorithm for micro/macro graphs, i.e. relational structures with two levels of detail. While the micro-level graph is given, the macro-level graph is induced b...
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
It is an important topic for segmentation on how to merge the over-segmented subimages of characters into integral characters. The conventional character segmentation has been mos...
We describe an algorithm for radial layout of undirected graphs, in which nodes are constrained to concentric circles centered at the origin. Such constraints are typical, e.g., i...
The topic of skeletal animation and its associated techniques have previously been applied in the area of animating computer-generated characters for motion pictures and computer ...