69 search results - page 5 / 14 » Near-Linear Time Approximation Algorithms for Curve Simplifi... |
DC
2010
13 years 7 months ago
2010
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
: We propose a new algorithm to the problem of polygonal curve approximation based on a multiresolution approach. This algorithm is suboptimal but still maintains some optimality b...
CAD
2007
Springer
13 years 7 months ago
2007
Springer
The swept volume of a moving solid is a powerful computational and visualization concept. It provides an excellent aid for path and accessibility planning in robotics and for simu...
ICPR
2008
IEEE
14 years 2 months ago
2008
IEEE
We have considered a problem of continuous piecewise linear approximation of the digital curves with a minimum number of the line segments. Fast suboptimal algorithm for constrain...
SI3D
1999
ACM
13 years 12 months ago
1999
ACM
We present a new approach for simplifying polygonal objects. Our method is general in that it works on models that contain both non-manifold geometry and surface attributes. It is...