The paper introduces a shape measure intended to describe the extent to which a closed polygon is rectilinear. Other than somewhat obvious measures of rectilinearity (e.g. the sum of the differences of each corner’s angle from 90◦) there has been little work in deriving a measure that is straightforward to compute, is invarient under scale and translation, and corresponds with the intuitive not...

The advances in VLSI technology have led to complex and larger circuits. As the circuits become complex and large, the amount of time required for the design of such circuits increases. The people in the VLSI industry are looking for faster EDA (Electronic Design Automation) tools so as to reduce the design time. Routing is a phase in the design (physical design) of electronic circuits, wherein...

We reduce the problem of computing a rectilinear shortest path between two given points s and t in the splinegonal domain S to the problem of computing a rectilinear shortest path between two points in the polygonal domain. As part of this, we define a polygonal domain P from S and transform a rectilinear shortest path computed in P to a path between s and t amid splinegon obstacles in S. When ...

Introduction: Human anatomy is essential for both clinical and surgical practice. Although the anterior jugular veins (AJVs) are of great importance in many surgeries, there few studies addressing anatomic variations these vessels. This study highlights venous drainage head neck anatomical AJVs. Objective: To observe describe evaluate whether patterns influenced by anthropometric factors or com...

A main task in designing IC/PCB is to pack rectilinear modules under various constraints and objectives. If modules are all rectangles without any positional constraint, recently proposed BSG and Sequence-pair based packing algorithms have been proved to work fast enough for practical use. Focusing BSG, to support an e ective use, this paper develops techniques to handle rectilinear modules and...

Finding the best rectilinear path with respect to the bends and the lengths of paths connecting two given points in the presence of rectilinear obstacles in a two-layer model is studied in this paper. In this model, rectilinear obstacles on each layer are speciied separately, and the orientation of routing in each layer is xed. An algorithm is presented to transform any problem instance in the ...

We show the power of posets in computational geometry by solving several problems posed on a set S of n points in the plane: (1) nd the n ? k ? 1 rectilinear farthest neighbors (or, equivalently, k nearest neighbors) to every point of S (extendable to higher dimensions), (2) enumerate the k largest (smallest) rectilinear distances in decreasing (increasing) order among the points of S, (3) give...

In this paper, we deal with arbitrarily shaped rectilinear module placement using the transitive closure graph (TCG) representation. The geometric meanings of modules are transparent to TCG as well as its induced operations, which makes TCG an ideal representation for floorplanning/placement with arbitrary rectilinear modules. We first partition a rectilinear module into a set of submodules and...