Sciweavers

1265 search results - page 29 / 253
» Algorithms for Drawing Media
Sort
View
COMPCON
1996
IEEE
14 years 19 days ago
Broadband Algorithms with the MicroUnity MediaProcessor
An important objective of the MicroUnity mediaprocessor is to allow the design of systems that replace hardwired functionality with software. One of the key design techniques that...
Curtis Abbott, Henry Massalin, Kevin Peterson, Tom...
CLA
2007
13 years 10 months ago
An FDP-Algorithm for Drawing Lattices
In this work we want to discuss an algorithm for drawing line diagrams of lattices based on force directed placement (FDP). This widely used technique in graph drawing introduces f...
Christian Zschalig
MVA
1990
123views Computer Vision» more  MVA 1990»
13 years 9 months ago
Randomized Hough Transform (RHT) in Engineering Drawing Vectorization System
Abstract When the data is processed from the digitized drawThis paper presents how the recently presented Randomized IIough Transform (RHT) method can be used as a part of an engin...
Pekka Kultanen, Erkki Oja, Lei Xu
APVIS
2006
13 years 10 months ago
Increasing the readability of graph drawings with centrality-based scaling
A common problem in visualising some networks is the presence of localised high density areas in an otherwise sparse graph. Applying common graph drawing algorithms on such networ...
Damian Merrick, Joachim Gudmundsson
ENDM
2008
123views more  ENDM 2008»
13 years 8 months ago
Morphing Planar Graph Drawings with Bent Edges
We give an algorithm to morph between two planar drawings of a graph, preserving planarity, but allowing edges to bend. The morph uses a polynomial number of elementary steps, whe...
Anna Lubiw, Mark Petrick