Sciweavers

70 search results - page 8 / 14
» On Convex Quadrangulations of Point Sets on the Plane
Sort
View
JACM
2010
135views more  JACM 2010»
14 years 8 months ago
A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
We present a fully dynamic randomized data structure that can answer queries about the convex hull of a set of n points in three dimensions, where insertions take O(log3 n) expect...
Timothy M. Chan
EJC
2008
14 years 9 months ago
A simple proof for open cups and caps
Let X be a set of points in general position in the plane. General position means that no three points lie on a line and no two points have the same x-coordinate. Y X is a cup, r...
Jakub Cerný
ICRA
1999
IEEE
123views Robotics» more  ICRA 1999»
15 years 1 months ago
Planar Image Based Visual Servoing as a Navigation Problem
We describe a hybrid planar image-based servo algorithm which, for a simplified planar convex rigid body, converges to a static goal for all initial conditions within the workspac...
Noah J. Cowan, Daniel E. Koditschek
ICDM
2009
IEEE
126views Data Mining» more  ICDM 2009»
15 years 4 months ago
Convex Non-negative Matrix Factorization in the Wild
Abstract—Non-negative matrix factorization (NMF) has recently received a lot of attention in data mining, information retrieval, and computer vision. It factorizes a non-negative...
Christian Thurau, Kristian Kersting, Christian Bau...
CAD
2000
Springer
14 years 9 months ago
Error propagation in geometric constructions
In this paper we consider error propagation in geometric constructions from a geometric viewpoint. First we study affine combinations of convex bodies: This has numerous examples ...
Johannes Wallner, Rimvydas Krasauskas, Helmut Pott...