Sciweavers

427 search results - page 19 / 86
» Optimal Algorithms in Multiview Geometry
Sort
View
IPCO
1996
89views Optimization» more  IPCO 1996»
13 years 9 months ago
On Dependent Randomized Rounding Algorithms
In recent years, approximation algorithms based on randomized rounding of fractional optimal solutions have been applied to several classes of discrete optimization problems. In t...
Dimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra
SAC
2009
ACM
14 years 2 months ago
On a discretizable subclass of instances of the molecular distance geometry problem
The molecular distance geometry problem can be formulated as the problem of finding an immersion in R3 of a given undirected, nonnegatively weighted graph G. In this paper, we di...
Carlile Lavor, Leo Liberti, Antonio Mucherino, Nel...
ICRA
1999
IEEE
96views Robotics» more  ICRA 1999»
13 years 12 months ago
Interactive Manipulation of Articulated Objects with Geometry Awareness
Techniques for interactive 3D manipulation of articulated objects in cluttered environments should be geometricallyaware, going beyond basic inverse or forward kinematics to allow...
Min-Hyung Choi, James F. Cremer
IMR
2004
Springer
14 years 1 months ago
A Comparison of Inexact Newton and Coordinate Descent Mesh Optimization Techniques
We compare inexact Newton and coordinate descent methods for optimizing the quality of a mesh by repositioning the vertices, where quality is measured by the harmonic mean of the ...
Lori Freitag Diachin, Patrick M. Knupp, Todd S. Mu...
DGCI
2006
Springer
13 years 11 months ago
Optimization Schemes for the Reversible Discrete Volume Polyhedrization Using Marching Cubes Simplification
The aim of this article is to present a reversible and topologically correct construction of a polyhedron from a binary object. The proposed algorithm is based on a Marching Cubes...
David Coeurjolly, Florent Dupont, Laurent Jospin, ...