A rectilinear Steiner arborescence connects points in the Euclidean plane’s first quadrant and the origin with directed rectilinear edges from the origin up and to the right. The search for arborescences of minimum total length is NP-hard and finds applications in VLSI design. A greedy heuristic for this problem often returns near-optimum arborescences. Three genetic algorithms encode candidate...

Article history: Received 2 February 2011 Received in revised form 6 January 2012 Accepted 20 January 2012 Available online 18 February 2012 A novel special motion called helical Cardan motion is introduced. The well known Cardanic motion is a special case with a zero pitch. A Cardan motion is a planar cycloidal motion, which can be produced by the internal rolling of a circle on a fixed circle...

The ultrastructure of the cells specialized for contraction in the atrium and ventricle of young adult cats are compared. The cells specialized for conduction are not included. In addition to possessing distinctive atrial granules, the cells of the atrium are smaller in diameter (5-6 micro) than ventricular cells (10-12 micro) and have strikingly fewer T tubules. These latter differences are di...

Prewetting transition is studied for the square-well fluid of attractive-well diameter lambda(ff)sigma(ff)=1.5 in the presence of a homogeneous surface modeled by the square-well potential of attractive well from 0.8sigma(ff) to 1.8sigma(ff). We investigate surface phase coexistence of thin-thick film transition using grand-canonical transition matrix Monte Carlo (GC-TMMC) and histogram reweigh...

The ultrastructure of the cells specialized for contraction in the atrium and ventricle of young adult cats are compared. The cells specialized for conduction are not included . In addition to possessing distinctive atrial granules, the cells of the atrium are smaller in diameter (5-6 μ) than ventricular cells (10-12 μ) and have strikingly fewer T tubules . These latter differences are discusse...

In this paper, we present a direct approach for routing a shortest rectilinear path between two points among a set of rectilinear obstacles in a two-layer interconnec-tion model. The previously best known direct approach for this problem takes O(n log 2 n) time and O(n log n) space. By using integer data structures and an implicit graph representation scheme, we reduce the time bound to O(n log...

In this note we describe some recent algorithms for the computation of rectangular and rectilinear cartograms.