An Efficiently Computable Metric for Comparing Polygonal Shapes
IEEE Transactions on Pattern Analysis and Machine Intelligence
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
On approximating polygonal curves in two and three dimensions
CVGIP: Graphical Models and Image Processing
Surface simplification using quadric error metrics
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
The DEDALE system for complex spatial queries
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
The image processing handbook (3rd ed.)
The image processing handbook (3rd ed.)
Polygonal approximations that minimize the number of inflections
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
A Rule-Based Approach to Represent Spatio-Temporal Relations in Video Data
ADVIS '00 Proceedings of the First International Conference on Advances in Information Systems
A rule-based video database system architecture
Information Sciences—Informatics and Computer Science: An International Journal
Silhouette-Based method for object classification and human action recognition in video
ECCV'06 Proceedings of the 2006 international conference on Computer Vision in Human-Computer Interaction
Hi-index | 0.00 |
In different types of information systems, such as multimedia information systems and geographic information systems, object-based information is represented via polygons corresponding to the boundaries of object regions. In many applications, the polygons have large number of vertices and edges, thus a way of representing the polygons with less number of vertices and edges is developed. This approach, called polygon approximation, or polygon simplification, is basically motivated with the difficulties faced in processing polygons with large number of vertices. Besides, large memory usage and disk requirements, and the possibility of having relatively more noise can also be considered as the reasons for polygon simplification. In this paper, a kinematics-based method for polygon approximation is proposed. The vertices of polygons are simplified according to the velocities and accelerations of the vertices with respect to the centroid of the polygon. Another property of the proposed method is that the user may set the number of vertices to be in the approximated polygon, and may hierarchically simplify the output. The approximation method is demonstrated through the experiments based on a set of polygonal objects.