Improving non-uniform rational B-Splines knot removal with particle swarm optimization

Data reduction and shape accuracy are two things that come in mind when it comes to computer graphics research. One such algorithm used is Non-Uniform Rational B-splines (NURBS). The method used to reduce data in NURBS is via knot removal, which relies on an error tolerance value. This paper propose...

Full description

Saved in:
Bibliographic Details
Main Authors: Ali, Aida, Shamsuddin, S. M., Ibrahim, Abdul Rahman
Format: Conference or Workshop Item
Published: 2009
Subjects:
Online Access:http://eprints.utm.my/id/eprint/15294/
http://dx.doi.org/10.1109/CGIV.2009.95
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.utm.15294
record_format eprints
spelling my.utm.152942020-08-30T08:46:22Z http://eprints.utm.my/id/eprint/15294/ Improving non-uniform rational B-Splines knot removal with particle swarm optimization Ali, Aida Shamsuddin, S. M. Ibrahim, Abdul Rahman QA75 Electronic computers. Computer science Data reduction and shape accuracy are two things that come in mind when it comes to computer graphics research. One such algorithm used is Non-Uniform Rational B-splines (NURBS). The method used to reduce data in NURBS is via knot removal, which relies on an error tolerance value. This paper proposes integrating Particle Swarm Optimization (PSO) to determine the error tolerance value. The approach has made determining the error tolerance value an automatic process. There is a small amount of success in implementing this method thus far. It is not a perfect solution as of yet, but it has potential to unite artificial intelligence algorithms and computer graphics in efforts to promote more avenues of research in this field. 2009 Conference or Workshop Item PeerReviewed Ali, Aida and Shamsuddin, S. M. and Ibrahim, Abdul Rahman (2009) Improving non-uniform rational B-Splines knot removal with particle swarm optimization. In: 6th International Conference on Computer Graphics, Imaging and Visualization, 2009, Tianjin University, China. http://dx.doi.org/10.1109/CGIV.2009.95
institution Universiti Teknologi Malaysia
building UTM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Malaysia
content_source UTM Institutional Repository
url_provider http://eprints.utm.my/
topic QA75 Electronic computers. Computer science
spellingShingle QA75 Electronic computers. Computer science
Ali, Aida
Shamsuddin, S. M.
Ibrahim, Abdul Rahman
Improving non-uniform rational B-Splines knot removal with particle swarm optimization
description Data reduction and shape accuracy are two things that come in mind when it comes to computer graphics research. One such algorithm used is Non-Uniform Rational B-splines (NURBS). The method used to reduce data in NURBS is via knot removal, which relies on an error tolerance value. This paper proposes integrating Particle Swarm Optimization (PSO) to determine the error tolerance value. The approach has made determining the error tolerance value an automatic process. There is a small amount of success in implementing this method thus far. It is not a perfect solution as of yet, but it has potential to unite artificial intelligence algorithms and computer graphics in efforts to promote more avenues of research in this field.
format Conference or Workshop Item
author Ali, Aida
Shamsuddin, S. M.
Ibrahim, Abdul Rahman
author_facet Ali, Aida
Shamsuddin, S. M.
Ibrahim, Abdul Rahman
author_sort Ali, Aida
title Improving non-uniform rational B-Splines knot removal with particle swarm optimization
title_short Improving non-uniform rational B-Splines knot removal with particle swarm optimization
title_full Improving non-uniform rational B-Splines knot removal with particle swarm optimization
title_fullStr Improving non-uniform rational B-Splines knot removal with particle swarm optimization
title_full_unstemmed Improving non-uniform rational B-Splines knot removal with particle swarm optimization
title_sort improving non-uniform rational b-splines knot removal with particle swarm optimization
publishDate 2009
url http://eprints.utm.my/id/eprint/15294/
http://dx.doi.org/10.1109/CGIV.2009.95
_version_ 1677781064109522944
score 13.211869