A computer-controlled display of random dots was used to study perceptions of depth. In this display, a field of stationary random dots surrounded a rectangular area in which random dots moved with uniform velocity in a single direction. The boundaries of this rectangle did not move. When dot motion was perpendicular to the longer boundary of the rectangle (occluded motion), the rectangle seeme...

Given a rectangle A and a set S of n points in A, we consider the problem, called the maximum empty rectangle problem, of finding a maximum area rectangle that is fully contained in A and does not contain any point of S in its interior. An O(n’) time algorithm is presented. Furthermore, it is shown that if the points of S are drawn randomly and independently from A, the problem can be solved in...

The paper studied weeds classification system using BP neural network and 6 shape parameters (the ratio of the width and the length, complete degrees, the roundness, the rectangle, ratio of the framework proportion and frame perimeter) based on such characteristic parameters as weed leaf area, perimeter, minimum bounding rectangle, circumcircle, equivalent oval as input feature vectors; and mea...

In this paper, we propose a new lightweight block cipher named RECTANGLE. The main idea of the design of RECTANGLE is to allow lightweight and fast implementations using bit-slice techniques. RECTANGLE uses an SPnetwork. The substitution layer consists of 16 4×4 S-boxes in parallel. The permutation layer is composed of 3 rotations. As shown in this paper, RECTANGLE offers great performance in b...

The Wiener number of a connected graph is equal to the sum of distances between all pairs of its vertices. A graph formed by a row of n hexagonal cells is called an n-hexagonal chain. Wiener number of an n x m hexagonal rectangle was found by the authors. An n x m hexagonal jagged-rectangle whose shape forms a rectangle and the number of hexagonal cells in each chain alternate between n and n 1...

A hidden guard set G is a set of point guards in polygon P that all points of the polygon are visible from some guards in G under the constraint that no two guards may see each other. In this paper, we consider the problem for finding minimum hidden guard sets in histogram polygons under orthogonal visibility. Two points p and q are orthogonally visible if the orthogonal bounding rectangle for ...