Sciweavers

118 search results - page 2 / 24
» Algorithms for the placement of diagrams on maps
Sort
View
SOFTVIS
2006
ACM
13 years 11 months ago
Evolutionary layout: preserving the mental map during the development of class models
It is vital for any developer to keep track of changes during his project. Thus, it is common practice to take static snapshots of single class diagrams. But to preserve the menta...
Susanne Jucknath-John, Dennis Graf, Gabriele Taent...
COMPGEOM
1999
ACM
13 years 9 months ago
Crust and Anti-Crust: A One-Step Boundary and Skeleton Extraction Algorithm
We wish to extract the topology from scanned maps. In previous work [15] this was done by extracting a skeleton from the Voronoi diagram, but this required vertex labelling and wa...
Christopher M. Gold
GD
2005
Springer
13 years 10 months ago
Stress Majorization with Orthogonal Ordering Constraints
Force-directed placement is a widely used approach to automatically arranging the nodes and edges of a relational diagram or graph in an aesthetically pleasing manner. The adoption...
Tim Dwyer, Yehuda Koren, Kim Marriott
IPPS
2003
IEEE
13 years 10 months ago
Fast Online Task Placement on FPGAs: Free Space Partitioning and 2D-Hashing
Partial reconfiguration allows for mapping and executing several tasks on an FPGA during runtime. Multitasking on FPGAs raises a number of questions on the management of the reco...
Herbert Walder, Christoph Steiger, Marco Platzner
ICCAD
1997
IEEE
95views Hardware» more  ICCAD 1997»
13 years 9 months ago
An exact solution to simultaneous technology mapping and linear placement problem
In this paper, we present an optimal algorithm for solving the simultaneous technology mapping and linear placement problem for tree-structured circuits with the objective of mini...
Jinan Lou, Amir H. Salek, Massoud Pedram