This paper presents a fast and progressive polygonal approximation algorithm for online strokes. A stroke is defined as a sequence of points between a pen-down and a pen-up. The proposed method generates polygonal approximations progressively as the user inputs the stroke. The proposed algorithm is suitable for real time shape modeling and retrieval. The number of operations used in the proposed algorithm is bounded by O(n), where n is the number of points in a stroke. Detailed experimental results show that the proposed method is not only fast, but also accurate enough compared to other reported algorithms
The authors present a graduate iterative merging algorithm for polygon approximation. The algorithm ...
International audienceThis paper presents an algorithm dealing with the data reduction and the appro...
Abstract A previous paper described an algorithm for accurate B-spline free-form deformation of poly...
[[abstract]]Two algorithms for polygonal approximation of a two-dimensional (2D) shape boundary are ...
[[abstract]]Two algorithms for polygonal approximation of a two-dimensional (2D) shape boundary are ...
The present paper proposes a new algorithm for automatic generation of polygonal approximations of 2...
A fast greedy algorithm for automatic decimation of polygonal meshes is proposed. Two important comp...
Fast algorithm for joint near-optimal approximation of multiple polygonal curves is proposed. It is ...
Polygonal approximation is an effective yet challenging digital curve representation for image analy...
. We present a new method for adaptive polygonization of parametric surfaces. The method combines re...
Polygonal approximation is an effective yet challenging digital curve representation for image analy...
Fast algorithm for joint near-optimal approximation of multiple polygonal curves is proposed. It is ...
This book covers the most important topics in the area of pattern recognition, object recognition, c...
International audienceWe propose a new algorithm for automatically computing approximations of a giv...
Simplifying polygonal curves at different levels of detail is an important problem with many applica...
The authors present a graduate iterative merging algorithm for polygon approximation. The algorithm ...
International audienceThis paper presents an algorithm dealing with the data reduction and the appro...
Abstract A previous paper described an algorithm for accurate B-spline free-form deformation of poly...
[[abstract]]Two algorithms for polygonal approximation of a two-dimensional (2D) shape boundary are ...
[[abstract]]Two algorithms for polygonal approximation of a two-dimensional (2D) shape boundary are ...
The present paper proposes a new algorithm for automatic generation of polygonal approximations of 2...
A fast greedy algorithm for automatic decimation of polygonal meshes is proposed. Two important comp...
Fast algorithm for joint near-optimal approximation of multiple polygonal curves is proposed. It is ...
Polygonal approximation is an effective yet challenging digital curve representation for image analy...
. We present a new method for adaptive polygonization of parametric surfaces. The method combines re...
Polygonal approximation is an effective yet challenging digital curve representation for image analy...
Fast algorithm for joint near-optimal approximation of multiple polygonal curves is proposed. It is ...
This book covers the most important topics in the area of pattern recognition, object recognition, c...
International audienceWe propose a new algorithm for automatically computing approximations of a giv...
Simplifying polygonal curves at different levels of detail is an important problem with many applica...
The authors present a graduate iterative merging algorithm for polygon approximation. The algorithm ...
International audienceThis paper presents an algorithm dealing with the data reduction and the appro...
Abstract A previous paper described an algorithm for accurate B-spline free-form deformation of poly...