A straight-line grid drawing of a plane graph G is a planar drawing of G, where each vertex is drawn at a grid point of an integer grid and each edge is drawn as a straight-line segment. The area of such a drawing is the area of the smallest axis-aligned rectangle on the grid which encloses the drawing. A minimum-area drawing of a plane graph G is a straight-line grid drawing of G where the are...

A rectangular drawing is a plane drawing of a graph in which every face is a rectangle. Rectangular drawings have an application for floorplans, which may have a huge number of faces, so compact code to store the drawings is desired. The most compact code for rectangular drawings needs at most 4 f − 4 bits, where f is the number of inner faces of the drawing. The code stores only the graph stru...

A two-dimensional grid with dots is called a configuration with distinct differences if any two lines which connect two dots are distinct either in their length or in their slope. These configurations are known to have many applications such as radar, sonar, physical alignment, and time-position synchronization. Rather than restricting dots to lie in a square or rectangle, as previously studied...

orography plays a substantial role in the formation and evolution of many atmospheric phenomena. observations indicate that two mountain ranges to the southwest of the red sea and west of iran (zagross mountain range) play a crucial role in the formation, evolution and activities of synoptic weather systems over iran. observations also, indicate that there are considerable differences between t...

We revisit the following problem (along with its higher dimensional variant): Given a set S of n points inside an axis-parallel rectangle U in the plane, find a maximum-area axis-parallel sub-rectangle that is contained in U but contains no points of S. (I) We present an algorithm that finds a large empty box amidst n points in [0, 1]: a box whose volume is at least log d 4(n+log d) can be comp...

The nearest goal of ShanghaiGrid is to going to connect all supercomputers in this metropolis together to form a sharing environment for massive storage and grid computing. The first stage projects of ShanghaiGrid comprise four sub-projects, including 1) research on environment, protocols and standards of information gird infrastructure; 2) development of system software for information grid an...

We study the mixing time of a systematic scan Markov chain for sampling from the uniform distribution on proper 7-colourings of a finite rectangular sub-grid of the infinite square lattice, the grid. A systematic scan Markov chain cycles through finite-size subsets of vertices in a deterministic order and updates the colours assigned to the vertices of each subset. The systematic scan Markov ch...

The impact of sub-grid variability of precipitation and canopy water storage is investigated over Central-South Europe by applying a new canopy interception scheme into the Community Atmosphere Model (CAM, Version 3) coupled with the Community Land Model (CLM, Version 3). The study shows that while sub-grid variability exerts great impact on the land surface water budget, the impact on the atmo...

Let P be a set of n points in R. Given a rectangle Q = [α1, α2] × [β1, β2], a range skyline query returns the maxima of the points in P ∩Q. An important variant is the so-called topopen queries, where Q is a 3-sided rectangle whose upper edge is grounded at y = ∞ (that is, β2 = ∞). These queries are crucial in numerous database applications. In internal memory, extensive research has been devot...

1 I n t r o d u c t i o n In this paper we examine drawings of rooted binary trees. We study the h-v drawing convention studied by Crescenzi, Di Bat t is ta and Piperno [3] and Eades, Lin and Lin [7]. Our results extend to the inclusion convention [6], and to slicing floorplanning [10, 2]. The drawing of a rooted binary tree using the h-v drawing convention is a planar grid drawing in which tre...