A new technique for on-line and off-line high speed computation

1989 ◽  
Vol 36 (5) ◽  
pp. 1480-1484 ◽  
Author(s):  
E.P. Hartouni ◽  
D.A. Jensen ◽  
B. Klima ◽  
M.N. Kreisler ◽  
M.S.Z. Rabin ◽  
...  
Keyword(s):  
High Speed ◽  
New Technique ◽  
On Line ◽  
A New Technique

A New Technique for High-Speed On-Line Object Recognition

1988 ◽  
Vol 21 (2) ◽  
pp. 141-144
Author(s):  
Q.M. Wu ◽  
M.G. Rodd ◽  
F. Deravi
Keyword(s):  
Object Recognition ◽  
High Speed ◽  
New Technique ◽  
On Line ◽  
A New Technique

Liquid-liquid/solid three-phase high-speed counter-current chromatography, a new technique for separation of polyphenols from Geranium wilfordii Maxim

2012 ◽  
Vol 35 (16) ◽  
pp. 2146-2151 ◽  
Author(s):  
Dan Liu ◽  
Yan Ma ◽  
Ming Gu ◽  
Jan-Christer Janson ◽  
Changhai Wang ◽  
...  
Keyword(s):  
High Speed ◽  
New Technique ◽  
Three Phase ◽  
A New Technique ◽  
Counter Current

VISIBILITY STABS AND DEPTH-FIRST SPIRALLING ON LINE SEGMENTS IN OUTPUT SENSITIVE TIME

2000 ◽  
Vol 10 (05) ◽  
pp. 535-552 ◽  
Author(s):  
MARK KEIL ◽  
DAVID M. MOUNT ◽  
S. K. WISMATH
Keyword(s):  
Practical Method ◽  
Visibility Graph ◽  
New Technique ◽  
Line Segments ◽  
Depth First Search ◽  
On Line ◽  
A New Technique ◽  
Visibility Polygons

Given a set S of n non-intersecting line segments in the plane, we vpresent a new technique for efficiently traversing the endpoint visibility graph of S to solve a variety of visibility problems in output sensitive time. In particular, we develop two techniques to compute the 2n visibility polygons of the endpoints of S, in output sensitive time. Depth-first spiralling is a technique that relies on the ordered endpoint visibility graph information to traverse the endpoints of S in a spiral-like manner using a combination of Jarvis' March and depth-first search. It is a practical method and has been implemented in C++ using LEDA.

Sign in / Sign up

Export Citation Format

Share Document