Sciweavers

37 search results - page 1 / 8
» Orthogonal Connector Routing
Sort
View
GD
2009
Springer
13 years 9 months ago
Orthogonal Connector Routing
Abstract. Orthogonal connectors are used in a variety of common network diagrams. Most interactive diagram editors provide orthogonal connectors with some form of automatic connect...
Michael Wybrow, Kim Marriott, Peter J. Stuckey
GD
2005
Springer
13 years 10 months ago
Incremental Connector Routing
Most diagram editors and graph construction tools provide some form of automatic connector routing, typically providing orthogonal or poly-line connectors. Usually the editor provi...
Michael Wybrow, Kim Marriott, Peter J. Stuckey
ENTCS
2006
158views more  ENTCS 2006»
13 years 4 months ago
Connector Colouring I: Synchronisation and Context Dependency
Reo is a coordination model based on circuit-like connectors which coordinate components through the interplay of data flow, synchronisation and mutual exclusion, state, and conte...
Dave Clarke, David Costa, Farhad Arbab
ENTCS
2007
190views more  ENTCS 2007»
13 years 4 months ago
Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
Stefano Bistarelli, Ugo Montanari, Francesca Rossi...
ASPDAC
2006
ACM
133views Hardware» more  ASPDAC 2006»
13 years 10 months ago
Monotonic parallel and orthogonal routing for single-layer ball grid array packages
— In this paper, we give the necessary and sufficient condition that all nets can be connected by monotonic routes when a net consists of a finger and a ball and fingers are on...
Yoichi Tomioka, Atsushi Takahashi