Sciweavers

35 search results - page 6 / 7
» Envelope surfaces
Sort
View
COMPGEOM
1995
ACM
13 years 11 months ago
A New Technique for Analyzing Substructures in Arrangements
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...
Boaz Tagansky
ESA
2007
Springer
176views Algorithms» more  ESA 2007»
14 years 1 months ago
Arrangements in Geometry: Recent Advances and Challenges
We review recent progress in the study of arrangements in computational and combinatorial geometry, and discuss several open problems and areas for further research. In this talk I...
Micha Sharir
OZCHI
2006
ACM
14 years 1 months ago
Applying reach in direct manipulation user interfaces
The HCI community currently faces the problem of making tangible user interfaces actively responsive to their user’s current physical context. This paper explores the context of...
Aaron Toney, Bruce H. Thomas
AIPR
2005
IEEE
14 years 1 months ago
Hyperspectral Detection Algorithms: Operational, Next Generation, on the Horizon
Abstract—The multi-band target detection algorithms implemented in hyperspectral imaging systems represent perhaps the most successful example of image fusion. A core suite of su...
A. Schaum
EOR
2010
178views more  EOR 2010»
13 years 7 months ago
Facility location problems in the plane based on reverse nearest neighbor queries
For a finite set of points S, the (monochromatic) Reverse Nearest Neighbor (RNN) rule associates with any query point q the subset of points in S that have q as its nearest neighb...
Sergio Cabello, José Miguel Díaz-B&a...