153 search results - page 21 / 31 » Near-linear approximation algorithms for geometric hitting s... |
143
Voted
SI3D
2006
ACM
15 years 9 months ago
2006
ACM
We present an interactive algorithm to compute discretized 3D Euclidean distance fields. Given a set of piecewise linear geometric primitives, our algorithm computes the distance...
160
click to vote
3DIM
2007
IEEE
15 years 10 months ago
2007
IEEE
The ICP (Iterative Closest Point) algorithm is the de facto standard for geometric alignment of threedimensional models when an initial relative pose estimate is available. The ba...
175
Voted
COMGEO
2012
ACM
13 years 11 months ago
2012
ACM
We study a class of multi-commodity flow problems in geometric domains: For a given planar domain P populated with obstacles (holes) of K ≥ 2 types, compute a set of thick path...
133
Voted
CGF
2010
15 years 3 months ago
2010
Many problems in geometric modeling can be described using variational formulations that define the smoothness of the shape and its behavior w.r.t. the posed modeling constraints....
130
click to vote
COMPGEOM
2005
ACM
15 years 5 months ago
2005
ACM
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...