Sciweavers

299 search results - page 3 / 60
» Optimizing Polynomial Solvers for Minimal Geometry Problems
Sort
View
96
Voted
COMPGEOM
2005
ACM
15 years 2 months ago
1-link shortest paths in weighted regions
We illustrate the Link Solver software for computing 1-link shortest paths in weighted regions. The Link Solver implements a prune-and-search method that can be used to approximat...
Ovidiu Daescu, James D. Palmer
DGCI
2006
Springer
15 years 4 months ago
Minimal Decomposition of a Digital Surface into Digital Plane Segments Is NP-Hard
This paper deals with the complexity of the decomposition of a digital surface into digital plane segments (DPS for short). We prove that the decision problem (does there exist a ...
Isabelle Sivignon, David Coeurjolly
87
Voted
HM
2010
Springer
133views Optimization» more  HM 2010»
15 years 1 months ago
A Hybrid LS-CP Solver for the Shifts and Breaks Design Problem
The problem of designing workforce shifts and break patterns is a relevant employee scheduling problem that arises in many contexts, especially in service industries. The issue is ...
Luca Di Gaspero, Johannes Gärtner, Nysret Mus...
104
Voted
ICCV
2007
IEEE
16 years 2 months ago
Two Minimal Problems for Cameras with Radial Distortion
Epipolar geometry and relative camera pose computation for uncalibrated cameras with radial distortion has recently been formulated as a minimal problem and successfully solved in...
Tomás Pajdla, Zuzana Kukelova
97
Voted
SIAMSC
2011
112views more  SIAMSC 2011»
14 years 7 months ago
A Discontinuous Galerkin Solver for Front Propagation
We propose a new discontinuous Galerkin (DG) method based on [9] to solve a class of Hamilton-Jacobi equations that arises from optimal control problems. These equations are connec...
Olivier Bokanowski, Yingda Cheng, Chi-Wang Shu