Sciweavers

1274 search results - page 68 / 255
» The Geometry of Coin-Weighing Problems
Sort
View
ICIP
2006
IEEE
16 years 2 months ago
Robust Bundle Adjustment for Structure from Motion
Structure from motion (SFM) is the problem of reconstructing the geometry of a scene from a stream of images. In this problem, the geometry of the scene must be inferred from imag...
Ji Zhang, Mireille Boutin, Daniel G. Aliaga
COMPGEOM
2009
ACM
15 years 7 months ago
Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension
We describe a new implementation of the well-known incremental algorithm for constructing Delaunay triangulations in any dimension. Our implementation follows the exact computing ...
Jean-Daniel Boissonnat, Olivier Devillers, Samuel ...
COMPGEOM
2009
ACM
15 years 7 months ago
Computing hereditary convex structures
Color red and blue the n vertices of a convex polytope P in R3 . Can we compute the convex hull of each color class in o(n log n)? What if we have χ > 2 colors? What if the co...
Bernard Chazelle, Wolfgang Mulzer
89
Voted
ISVD
2007
IEEE
15 years 7 months ago
From the Kneser-Poulsen conjecture to ball-polyhedra via Voronoi diagrams
A very fundamental geometric problem on finite systems of spheres was independently phrased by Kneser (1955) and Poulsen (1954). According to their well-known conjecture if a fi...
Károly Bezdek
GECCO
2005
Springer
129views Optimization» more  GECCO 2005»
15 years 6 months ago
Optimization of passenger car design for the mitigation of pedestrian head injury using a genetic algorithm
The problem of pedestrian injury is a significant one throughout the world. In 2001, there were 4724 pedestrian fatalities in Europe and 4882 in the US. Significant advances have ...
Emma Carter, Steve Ebdon, Clive Neal-Sturgess