Sciweavers

4302 search results - page 339 / 861
» Index Pairs Algorithms
Sort
View
ISAAC
2009
Springer
78views Algorithms» more  ISAAC 2009»
15 years 11 months ago
Reconstructing Polygons from Scanner Data
A range-finding scanner can collect information about the shape of an (unknown) polygonal room in which it is placed. Suppose that a set of scanners returns not only a set of poin...
Therese C. Biedl, Stephane Durocher, Jack Snoeyink
WCNC
2008
IEEE
15 years 11 months ago
Providing QoS to Real and Data Applications in WiMAX Mesh Networks
— We consider the problem of centralized routing and scheduling for IEEE 802.16 mesh networks so as to provide Quality of Service (QoS) to individual real and interactive data ap...
Vinod Sharma, A. Anil Kumar, S. R. Sandeep, M. Sid...
130
Voted
COMPGEOM
2006
ACM
15 years 11 months ago
Refolding planar polygons
Abstract This paper describes an algorithm for generating a guaranteed intersectionfree interpolation sequence between any pair of compatible polygons. Our algorithm builds on prio...
Hayley N. Iben, James F. O'Brien, Erik D. Demaine
151
Voted
ISCAS
1994
IEEE
124views Hardware» more  ISCAS 1994»
15 years 9 months ago
Efficient Gabor Filter Design Using Rician Output Statistics
Gabor filters have been applied sucessfully to a broad range of multidimensional signal processing and image processing tasks. The present paper considers the design of a single f...
Thomas P. Weldon, William E. Higgins, Dennis F. Du...
VMV
2008
151views Visualization» more  VMV 2008»
15 years 6 months ago
Adaptive surface decomposition for the distance computation of arbitrarily shaped objects
We propose an adaptive decomposition algorithm to compute separation distances between arbitrarily shaped objects. Using the Gilbert-JohnsonKeerthi algorithm (GJK), we search for ...
Marc Gissler, Matthias Teschner