James George Dunham. Optimum uniform piecewise linear approximation of planar curves. IEEE Transactions on Pattern Analysis and Machine Intelligence, 8(1):67--75, January 1986. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Octree-based Simplifications of Polyhedral Solids - Gran (1999) (1 citation) (Correct)
....detection. 2.2.4 Curve Simplification Curve simplification deals with simplification of polygonal curves embedded in 2D or 3D space. Curve simplification is a well known problem. There exists many different approaches and plenty of methods (see [HI86] II88] Vel92] ET92] Bal81] Dun86] Polygonal curves are represented by an ordered sequence p 1 , pn of points called vertices. The vertices of the simplified curve are usually a subset of the original vertices, so the simplified curve can be represented by p i 1 , p i m , where 1 = i 1 i 2 : i m = n. ....
James George Dunham. Optimum uniform piecewise linear approximation of planar curves. IEEE Transactions on Pattern Analysis and Machine Intelligence, 8(1):67--75, January 1986.
Space-Efficient Outlines from Image Data via Vertex Minimization.. - Hobby (1997) (1 citation) (Correct)
.... of successive data points [30] Kurozumi and Davis simplify the problem by allowing gaps between segments so that a simple greedy algorithm based on convex hulls minimizes the number of output segments [11] Dunham uses dynamic programming to select a minimal subset of the input vertices [2], and Imai and Iri use a graph based algorithm to accomplish essentially the same thing [8] Guibas, Hershberger, et al. use computational geometry techniques and dynamic programming to minimize the vertex count under a variety of conditions [6] The method of Sharaiha and Christofides recognizes ....
James George Dunham. Optimum uniform piecewise linear approximation of planar curves. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-8(1):67--75, January 1986.
Multiresolution Modeling for Fast Rendering - Heckbert (1994) (75 citations) (Correct)
....The most general class of polygonal models are polyhedral models, where arbitrary topology is allowed. The latter class is the most relevant to multiresolution modeling. 3.6. 1 Curve Simplification Numerous algorithms for approximating one piecewise linear curve with another have been developed [6]. It is possible to find the least squares optimal m segment approximation to an n segment curve in time O(n 3 logm) using dynamic programming [14] Unfortunately, this is too slow for use on complex curves, and it does not appear to generalize to surfaces. Curve simplification algorithms may ....
James George Dunham. Optimum uniform piecewise linear approximation of planar curves. IEEE Transactions on Pattern Analysis and Machine Intelligence, 8(1):67--75, January 1986.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC