Results 271 to 280 of about 8,892,596 (302)
Some of the next articles are maybe not open access.
On an Efficient General Line-Clipping Algorithm
IEEE Computer Graphics and Applications, 1985The purpose of this note is to bring to the attention of the computer graphics community a powerful, efficient, general two- and three-dimensional line-clipping algorithm originated by Cyrus and Beck.1 This algorithm appears to be virtually unknown to the computer graphics community.
David F. Rogers, Linda M. Rybak
openaire +2 more sources
Energy-Efficient Line Planning by Implementing Express Lines
While a shift from individual transport to public transport reduces greenhouse gas emissions, public transport itself also consumes a non-negligible amount of energy. Acceleration processes have a high part in that, especially in urban transportation networks where stops are not far from each other.Roth, Sarah, Schöbel, Anita
openaire +3 more sources
On-line Profit Sharing Works Efficiently
2003Reinforcement learning constructs knowledge containing state-to-action decision rules from agent’s experiences. Most of reinforcement learning methods are action-value estimation methods which estimate the true values of state-action pairs and derive the optimal policy from the value estimates.
Tohgoroh Matsui +2 more
openaire +1 more source
Market Efficiency and Value Line's Record
The Journal of Business, 1990The Value Line investment record is frequently interpreted as evidence of market inefficiency. This article reconciles the record with market efficiency as one implication of a model that assumes a semistrong form of market efficiency and autoregressive state variables, which need not be identified.
Huberman, Gur, Kandel, Shmuel
openaire +1 more source
An efficient line clipping algorithm based on adaptive line rejection
Computers & Graphics, 2002Abstract Line clipping process often involves a lot of intersection calculations. One way for improving the efficiency of a line clipping algorithm is to save the unnecessary intersection calculations demanded by traditional algorithms either for rejecting some totally invisible lines or for clipping some partially visible lines. An adaptive clipping
Guodong Lu +2 more
openaire +2 more sources
A Simple and Efficient Haloed Line Algorithm for Hidden Line Elimination
Computer Graphics Forum, 1987AbstractAn efficient algorithm, HALO, is given to compute haloed line drawings of wire frame objects. Haloed line drawings are described by Appel et al.1HALO has two parts: CUT and DRAW. CUT uses an adaptive grid to find all edge intersections. It overlays a square grid, whose fineness is a function of the number and length of the edges, on the Scene ...
Wm. Randolph Franklin, Varol Akman
openaire +2 more sources
Efficient On-Line Computation of Constrained Optimal Control
SIAM Journal on Control and Optimization, 2002We consider constrained finite-time optimal control problems for discrete-time linear time-invariant systems with constraints on inputs and outputs based on linear and quadratic performance indices. The solution to such problems is a time-varying piecewise affine (PWA) state-feedback law and it can be computed by means of multi-parametric programming ...
Mato Baotic +3 more
openaire +4 more sources
On the Efficiency of Wald's Method of Fitting Straight Lines
Revue de l'Institut International de Statistique / Review of the International Statistical Institute, 1956In The Annals of Mathematical Statistics of 1940, Abraham Wald (1940) suggested the following method of estimating the slope of a straight line. Suppose we have two variables, x and y, and n observation pairs (xi (yi).
Theil, H., IJzeren, van, J.
openaire +2 more sources
Efficient maintenance of the union of intervals on a line, with applications
Journal of Algorithms, 1991Abstract We consider the problem of maintaining, under insertions and deletions, the union of a set S of intervals on a line. We present a scheme that reports the ordered list of intervals in the union in Θ ( k ) time, while achieving O (log n ) time in worst case for each insertion or deletion, where n is the number of intervals currently in
Siu-Wing Cheng, Ravi Janardan
openaire +4 more sources
An efficient algorithm for line and polygon clipping
The Visual Computer, 1991We present an algorithm for clipping a polygon or a line against a convex polygonal window. The algorithm demonstrates the practicality of various ideas from computational geometry. It spendsO(logp) time on each edge of the clipped polygon, wherep is the number of window edges, while the Sutherland-Hodgman algorithm spendsO(p) time per edge ...
openaire +2 more sources