Sciweavers

1086 search results - page 60 / 218
» Points surrounding the origin
Sort
View
SIGGRAPH
1998
ACM
15 years 5 months ago
A New Voronoi-based Surface Reconstruction Algorithm
We describe our experience with a new algorithm for the reconstruction of surfaces from unorganized sample points in IR 3. The algorithm is the first for this problem with provab...
Nina Amenta, Marshall W. Bern, Manolis Kamvysselis
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
15 years 2 months ago
The rectilinear Steiner arborescence problem is NP-complete
Given a set P of points in the first quadrant, a Rectilinear Steiner Arborescence (RSA) is a directed tree rooted at the origin, containing all points in P, and composed solely of...
Weiping Shi, Chen Su
RAS
2010
127views more  RAS 2010»
14 years 11 months ago
Maximum-likelihood sample-based maps for mobile robots
— The problem of representing environments of a mobile robot has been studied intensively in the past. The predominant approaches for geometric representations are gridbased or l...
Daniel Meyer-Delius, Wolfram Burgard
JOTA
2011
149views more  JOTA 2011»
14 years 8 months ago
Globally Convergent Cutting Plane Method for Nonconvex Nonsmooth Minimization
: Nowadays, solving nonsmooth (not necessarily differentiable) optimization problems plays a very important role in many areas of industrial applications. Most of the algorithms d...
Napsu Karmitsa, Mario Tanaka Filho, José He...
ICIP
2006
IEEE
16 years 3 months ago
Improved Unsymmetric-Cross Multi-Hexagon-Grid Search Algorithm for Fast Block Motion Estimation
We develop a set of new motion estimation (ME) algorithms based mainly on Unsymmetric-Cross Multi-Hexagon-Grid Search (UMH). The original algorithms are improved by applying the S...
Janne Heikkilä, Tuukka Toivonen