Please use this identifier to cite or link to this item:
|Title:||T-spline local refinement as a belief revision system: a rule-based implementation||Authors:||Abbas, Abdulwahed
Nasri, Ahmad H
|Affiliations:||Department of Computer Science||Keywords:||T-spline surfaces
|Issue Date:||2017||Part of:||Journal of computer-aided design and applications||Volume:||14||Issue:||5||Start page:||622||End page:||631||Abstract:||
As originally conceived, T-splines generalize both NURBS and Subdivision surfaces. Central to T-splines is the knot refinement algorithm, which seems to successfully import the local characteristic of B-spline and NURBS curve knot insertion. However, the mathematical decisiveness manifested in curve knot insertion is nowhere to be seen in previously published versions of T-spline local refinement. In this respect, this paper gives a tutorial exposition of T-spline local refinement, interpreted in the spirit of a belief-revision metaphor. It also provides a detailed implementation of that, designed following the architecture of rule-based systems. Both of these are classical topics in traditional Artificial Intelligence Research.
|URI:||https://scholarhub.balamand.edu.lb/handle/uob/2626||DOI:||10.1080/16864360.2016.1273579||Ezproxy URL:||Link to full text||Type:||Journal Article|
|Appears in Collections:||Department of Computer Science|
Show full item record
checked on Aug 9, 2022
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.