1879 search results - page 272 / 376 » Computational geometry algorithms library |
137
click to vote
COMPGEOM
2004
ACM
15 years 10 months ago
2004
ACM
We present a new algorithm for unfolding planar polygonal linkages without self-intersection based on following the gradient flow of a “repulsive” energy function. This algor...
149
click to vote
IS4TH
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. In this paper, we present a 3D reconstruction approach of a liver tumour model from a sequence of 2D MR parallel cross-sections, and the integration of this reconstructed...
156
click to vote
COMPGEOM
2009
ACM
15 years 9 months ago
2009
ACM
We present a new (1 + ε)-spanner for sets of n points in Rd . Our spanner has size O(n/εd−1 ) and maximum degree O(logd n). The main advantage of our spanner is that it can be...
132
click to vote
SODA
2004
ACM
15 years 5 months ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
160
click to vote
DAGSTUHL
1997
15 years 5 months ago
1997
A realistic simulation system, which couples geometry and physics, can provide a useful toolkit for virtual environments. Interactions among moving objects in the virtual worlds a...