Results 221 to 230 of about 130,251 (258)

Selective harmonic elimination in T-type multilevel inverter with reduced switch count using Sea-Horse Algorithm. [PDF]

Sci Rep
Hussain AT, Almulaisi T, Desa H, Bektaş E, Sekhar R, Shah P, Radhi AD, Abed NN, Yaakob SB.   +8 more
europepmc   +1 more source

Hyperchaos and the fusion of Moore's automaton with gold sequences for augmented medical image encryption. [PDF]

Sci Rep
Gabr M, Mamdouh E, El-Damak D, El-Aasser M, Alexan W, Aboshousha A.   +5 more
europepmc   +1 more source

Joint Transmit-Receive Weight Optimization for FDA Radar to Balance Active Detection and RF Stealth. [PDF]

Sensors (Basel)
Guan H, Zhang S, Wang WQ.
europepmc   +1 more source

A simple output-sensitive algorithm for hidden surface removal

, 1989
Sharir, M., Overmars, M.H.
openaire   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Faster output-sensitive skyline computation algorithm

Information Processing Letters, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jinfei Liu, Li Xiong
exaly   +3 more sources

Output-Sensitive Algorithm for Computing β-Skeletons

Computing (Vienna/New York), 2000
A \(\beta\)-skeleton of a planar set of \(n\) points, i.e. the geometric graph obtained by joining the pair of points whose \(\beta\)-neighborhood is empty, can be computed by a standard algorithm in time \(O(n^{5/2}\log n)\). An algorithm is proposed to detect the \(\beta\)-skeleton in time \(O(n\log n+k)\), where \(k\) is the size of the output graph.
S V Rao, Rao S V
exaly   +2 more sources

Output-Sensitive Parallel Algorithm for Polygon Clipping

2014 43rd International Conference on Parallel Processing, 2014
Polygon clipping is one of the complex operations in computational geometry. It is a primitive operation in many fields such as Geographic Information Systems (GIS), Computer Graphics and VLSI CAD. Sequential algorithms for this problem are in abundance in literature but there are very few parallel algorithms solving it in its most general form.
Satish Puri, Sushil K Prasad
exaly   +2 more sources

A general algorithm for output-sensitive visibility preprocessing

Proceedings of the 2005 symposium on Interactive 3D graphics and games, 2005
Occlusion culling based on precomputed visibility information is a standard method for accelerating the rendering in real-time graphics applications. In this paper we present a new general algorithm that performs the visibility precomputation for a group of viewcells in an output-sensitive fashion.
Samuli Laine
exaly   +2 more sources