8 search results - page 2 / 2 » Crossing Reduction in Circular Layouts |
GD
2007
Springer
14 years 1 months ago
2007
Springer
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...
ICDAR
2003
IEEE
14 years 19 days ago
2003
IEEE
In this paper we present a system to locate, extract and recognize Telugu text. The circular nature of Telugu script is exploited for segmenting text regions using the Hough Trans...
GD
2009
Springer
13 years 12 months ago
2009
Springer
Abstract. In this paper we propose three layout algorithms for semibipartite graphs—bipartite graphs with edges in one partition—that emerge from microarray experiment analysis...