Sciweavers

1082 search results - page 34 / 217
» Approximation Algorithms for Spreading Points
Sort
View
JUCS
2007
148views more  JUCS 2007»
13 years 7 months ago
Analysis of two Sweep-line Algorithms for Constructing Spanning Trees and Steiner Trees
: We give a tight analysis of an old and popular sweep-line heuristic for constructing a spanning tree of a set of n points in the plane. The algorithm sweeps a vertical line acros...
Adrian Dumitrescu, Csaba D. Tóth
ATAL
2010
Springer
13 years 8 months ago
Point-based backup for decentralized POMDPs: complexity and new algorithms
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
Akshat Kumar, Shlomo Zilberstein
DGCI
2005
Springer
14 years 1 months ago
The Class of Simple Cube-Curves Whose MLPs Cannot Have Vertices at Grid Points
We consider simple cube-curves in the orthogonal 3D grid of cells. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded s...
Fajie Li, Reinhard Klette
CGI
2000
IEEE
14 years 1 days ago
Reconstruction of B-spline Surfaces from Scattered Data Points
We present a new approach for reconstructing a smooth surface from a set of scattered points in three-dimensional (3D) space. Our algorithm first decomposes a given point set int...
Benjamin F. Gregorski, Bernd Hamann, Kenneth I. Jo...
VISUALIZATION
1997
IEEE
13 years 11 months ago
Visualization of higher order singularities in vector fields
We present an algorithm for the visualization of vector field topology based on Clifford algebra. It is the first method allowing the detection of higher order singularities. Th...
Gerik Scheuermann, Hans Hagen, Heinz Krüger, ...