1879 search results - page 188 / 376 » Computational geometry algorithms library |
161
click to vote
CCO
2001
Springer
15 years 9 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
140
click to vote
ICCV
2007
IEEE
15 years 11 months ago
2007
IEEE
We present a new method for reconstructing the exterior surface of a complex transparent scene with inhomogeneous interior (e.g., multiple interfaces, reflective or painted inter...
165
click to vote
IMR
2004
Springer
15 years 10 months ago
2004
Springer
In this paper, we propose a robust isotropic tetrahedral mesh generation method. An advancing front method is employed to control local mesh density and to easily preserve the ori...
120
click to vote
IMR
2004
Springer
15 years 10 months ago
2004
Springer
We present a method that computes a global potentially visible set for the complete region outside the convex hull of an object. The technique is used to remove invisible parts (t...
166
click to vote
COMPGEOM
1998
ACM
15 years 9 months ago
1998
ACM
We present a new technique for constructing a data-structure that approximates shortest path maps in IRd . By applying this technique, we get the following two results on approxim...