Showing papers on "Line segment published in 1975"
Patent•
[...]
22 Dec 1975
TL;DR: In this paper, a self-contained operator responsive video game system is described, capable of generating a virtually unlimited number of games where a player responds to and controls high resolution objects drawn on a display device such as a cathode ray tube.
Abstract: A self-contained operator responsive video game system is disclosed. The system is capable of generating a virtually unlimited number of games where a player responds to and controls high resolution objects drawn on a display device such as a cathode ray tube. The system includes two interdependent sections, a computational section and a display section. The computational section includes means for entering operator commands, a program memory for storing the game rules and a digital processor for determining trajectories of moving objects and generating the line segment specification parameters required by the display section. The display section includes the same digital processor included in the computational section for transforming the line segment specification parameters into digital line drawing values and generating timed gating signals, digital-to-analog converters for converting the digital line drawing values into proportional signals and display drivers for generating the specified line segments on the screen of the cathode ray tube. Composites of the line segments repetitively drawn ultimately result in recognizable animated objects.
57 citations
TL;DR: The assignment problem arose in connection with the efficient rearrangement of desks located in offices along a corridor which encircles one floor of a building and it is shown that the optimal assignment Q can be computed in a number of steps proportional to the number of points.
54 citations
Posted Content•
TL;DR: In this paper, a family of integer programs whose right-hand-sides lie on a given line segment is considered, called a parametric integer program (PIP), and a simple generalization of the conventional branch-and-bound approach to integer programming is presented.
Abstract: A family of integer programs is considered whose right-hand-sides lie on a given line segment L. This family is called a parametric integer program (PIP). Solving a (PIP) means finding an optimal solution for every program in the family. It is shown how a simple generalization of the conventional branch-and-bound approach to integer programming makes it possible to solve such a (PIP). The usual bounding test is extended from a comparison of two point values to a comparison of two functions defined on the line segment L. The method is illustrated on a small example and computational results for some larger problems are reported.
52 citations
TL;DR: This article showed that small but consistent, errors in an alignment task occur for oblique lines when the variable stimulus is a line segment but not when it is a dot, this discrepancy could have been due to the structure of the variable stimuli or its path of motion.
Abstract: Previous studies have shown that small, but consistent, errors in an alignment task occur for oblique lines when the variable stimulus is a line segment but not when it is a dot. This discrepancy could have been due to the structure of the variable stimulus or its path of motion. These alternative hypotheses were tested in two experiments. The results indicated that motion path is irrelevant but that errors generally occur when extended line segments are adjusted and do not occur in the adjustment of very short line segments (“dots”).
12 citations
Posted Content•
TL;DR: In this article, a family of integer programs whose right-hand-sides lie on a given line segment is considered, called a parametric integer program (PIP), and a simple generalization of the conventional branch-and-bound approach to integer programming is presented.
Abstract: A family of integer programs is considered whose right-hand-sides lie on a given line segment L. This family is called a parametric integer program (PIP). Solving a (PIP) means finding an optimal solution for every program in the family. It is shown how a simple generalization of the conventional branch-and-bound approach to integer programming makes it possible to solve such a (PIP). The usual bounding test is extended from a comparison of two point values to a comparison of two functions defined on the line segment L. The method is illustrated on a small example and computational results for some larger problems are reported.
11 citations
Journal Article•
6 citations
Patent•
10 Oct 1975TL;DR: In this article, a colored original is scanned along a plurality of line paths, each of which can be divided into one or more colored line segments, and encoders are provided to characterize each of the line segments by a corresponding first code representing the color of the segment and a second code corresponding the run length of a segment.
Abstract: A colored original which is painted with a plurality of predetermined colors is scanned along each of a plurality of line paths each of which can be divided into one or more colored line segments. Encoders are provided to characterize each of the line segments by a corresponding first code representing the color of the segment and a second code representing the run length of the segment. The first and second codes are sequentially recorded in a data file memory. The recorded information is repeatedly retrieved from the memory and transferred to a shift register. Line segments carrying the same color within each line path are detected by comparing the corresponding first code with a specified code. The second code is sequentially decoded into run lengths which are accumulated to measure the position of color transitions relative to the colored original. A video signal is generated upon occurrence of coincidence between the first code and the specified code. A photographic film is scanned by a light beam modulated with the video signal to develop an image carrying the detected color on a specified portion of the film in correspondence with the specified code. The codes to be specified are sequentially changed to detect the line segments of different colors in a predetermined sequence within the period of the scanning. In synchronism with the code change, the shift register is shifted to recirculate the data.
4 citations
TL;DR: Subjects were given written descriptions of simple open geometric forms and made decisions about the location of the point at which each constructed form terminated, where it appeared that subjects took approximately 1 sec to encode a symbol as a line segment and add it to a mental image.
Abstract: Subjects were given written descriptions of simple open geometric forms and made decisions about the location of the point at which each constructed form terminated. Their reaction time increased approximately 1 sec for each segment in the constructed figure. Reaction time for a comparable decision did not vary as a function of the number of segments in actually presented figures. It appeared that subjects took approximately 1 sec to encode a symbol as a line segment and add it to a mental image. In another part of the experiment, intended to measure the time taken to name a line segment, subjects made decisions about the presence of a target item in a list of visual symbols or in a geometric form. Visual search through a list of symbols seemed to be self-terminating, while search through the segments of a geometric form seemed to be largely exhaustive. However, no clear conclusions were possible about the visual-to-verbal transformations which had been expected to occur in this part of the experiment.
3 citations
01 Feb 1975
TL;DR: A compact planar set is defined to be a compact set of zero measure which contains a translate of any line segment lying in a disk of diameter one as mentioned in this paper, and it is shown that for almost all such sequences a BTset is obtained.
Abstract: A BTset is defined to be a compact planar set of zero measure which contains a translate of any line segment lying in a disk of diameter one. A construction is given which associates a unique compact planar set with each sequence in a closed interval, and it is shown that for almost all such sequences a BTset is obtained. The construction depends on the measure properties of certain perfect linear sets. Several related problems of a subtler nature are also considered.
2 citations
TL;DR: In this article, a subset of a linear topological space is defined to be locally convex if and only if every m-member subset of line segments determined by these points lies in S. If S fails to be local convex at some point q in S, then q is called a point of local nonconvexity (lnc point).
Abstract: Let S be a subset of some linear topological space. The set S is said to be m-convex, m ≧ 2, if and only if for every m-member subset of line segments determined by these points lies in S. A point x in S is called a point of local convexity of S if and only if there is some neighborhood N of x such that if y, z ∈ N⋂ S, then [y, z] ⊆ S. If S fails to be locally convex at some point q in S, then q is called a point of local nonconvexity (lnc point) of S.
1 citations
TL;DR: In this article, integral transformations are developed to construct three and five axisymmetric potentials for a needle or straight line segment, and one of the main results is for streaming flow past a line segment in which the fluid velocity vanishes on the boundary.
Abstract: Integral transformations are developed to construct three and five axisymmetric potentials for a needle or straight line segment. These potentials are applied to flow past a needle and one of the main results is for streaming flow past a line segment in which the fluid velocity vanishes on the boundary. This solution may also be regarded as a Stokes flow or an inviscid potential flow.