Sciweavers

98 search results - page 18 / 20
» A Rectilinearity Measurement for Polygons
Sort
View
COMPGEOM
2007
ACM
14 years 1 months ago
Streaming algorithms for line simplification
We study the following variant of the well-known line-simplification problem: we are getting a possibly infinite sequence of points p0, p1, p2, . . . in the plane defining a polyg...
Mohammad Ali Abam, Mark de Berg, Peter Hachenberge...
DCOSS
2007
Springer
14 years 1 months ago
Efficient Computation of Minimum Exposure Paths in a Sensor Network Field
The exposure of a path p is a measure of the likelihood that an object traveling along p is detected by a network of sensors and it is formally defined as an integral over all poin...
Hristo Djidjev
COMPGEOM
2006
ACM
13 years 11 months ago
On the ICP algorithm
We present upper and lower bounds for the number of iterations performed by the Iterative Closest Point (ICP) algorithm. This algorithm has been proposed by Besl and McKay [4] as ...
Esther Ezra, Micha Sharir, Alon Efrat
DICTA
2007
13 years 11 months ago
Visual Tracking Based on Color Kernel Densities of Spatial Awareness
We propose a kernel-density based scheme that incorporates the object colors with their spatial relevance to track the object in a video sequence. The object is modeled by the col...
Zhuan Qing Huang, Zhuhan Jiang
VMV
2003
146views Visualization» more  VMV 2003»
13 years 11 months ago
ADB-Trees: Controlling the Error of Time-Critical Collision Detection
We present a novel framework for hierarchical collision detection that can be applied to virtually all bounding volume (BV) hierarchies. It allows an application to trade quality ...
Jan Klein, Gabriel Zachmann