Sciweavers

22 search results - page 2 / 5
» Improved Dynamic Planar Point Location
Sort
View
SODA
1997
ACM
144views Algorithms» more  SODA 1997»
13 years 8 months ago
Methods for Achieving Fast Query Times in Point Location Data Structures
Given a collection S of n line segments in the plane, the planar point location problem is to construct a data structure that can e ciently determine for a given query point p the...
Michael T. Goodrich, Mark W. Orletsky, Kumar Ramai...
IJRA
2011
101views more  IJRA 2011»
13 years 2 months ago
Information Surfing for Radiation Map Building
We develop a control scheme for a group of mobile sensors to map radiation over a given planar polygonal region. The advantage of this methodology is that it provides quick situat...
R. Andres Cortez, Herbert G. Tanner, Ron Lumia, Ch...
CHI
2009
ACM
14 years 8 months ago
The angle mouse: target-agnostic dynamic gain adjustment based on angular deviation
We present a novel method of dynamic C-D gain adaptation that improves target acquisition for users with motor impairments. Our method, called the Angle Mouse, adjusts the mouse C...
Jacob O. Wobbrock, James Fogarty, Shih-Yen (Sean) ...
GIS
2005
ACM
14 years 8 months ago
Improving the R*-tree with outlier handling techniques
The R*-tree, as a state-of-the-art spatial index, has already found its way into commercial systems like Oracle. In this paper, we aim at improving query performance of the R*tree...
Tian Xia, Donghui Zhang
IJCNN
2006
IEEE
14 years 1 months ago
Improved Snake Model for Fast Image Segmentation
—This paper presents an Improved Snake Model (ISM) effective for performing fast image segmentation. The work takes advantage of two well-known snake models of Balloon [1] and GG...
Chi-Cheng Ting, Jhan-Syuan Yu, Jiun-Shuen Tzeng, J...