Normal view MARC view ISBD view

B-spline curves : (Record no. 10434)

MARC details
000 -LEADER
fixed length control field	03346nam a2200433 4500
005 - DATE AND TIME OF LATEST TRANSACTION
control field	20260817170956.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field	280898 th eng
035 ## - SYSTEM CONTROL NUMBER
System control number	.b10104537
099 #9 - LOCAL FREE-TEXT CALL NUMBER (OCLC)
Classification number	AIT Thesis no.CS-89-20
100 0# - MAIN ENTRY--PERSONAL NAME
Personal name	Suwannee Suttapanya
245 10 - TITLE STATEMENT
Title	B-spline curves :
Remainder of title	properties and computations
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Place of publication, distribution, etc.	Bangkok :
Name of publisher, distributor, etc.	Asian Institute of Technology,
Date of publication, distribution, etc.	1989
300 ## - PHYSICAL DESCRIPTION
Extent	70 p. +
Accompanying material	1 online resource
490 1# - SERIES STATEMENT
Series statement	Thesis ;
Volume/sequential designation	no. CS-89-20
500 ## - GENERAL NOTE
General note	A thesis submitted in partial fulfillment of the requirements for the degree of Master of Science
502 ## - DISSERTATION NOTE
Dissertation note	Thesis (M.Sc.) - Asian Institute of Technology, 1989
520 ## - SUMMARY, ETC.
Summary, etc.	This thesis presents, in a unified approach, the important properties of B-splines and the important computational problems involved in working with them. In this framework, B-spline basis is used to define a curve and the knot insertion strategy is used to add the flexibility of a curve so as to provide an intuitive feel for how to change or control its shape. Important algorithms for curve generation that use divided difference definition, recursive definition and repeated linear interpolation of point such as deBoor algorithm have been implemented, thoroughly tested and compared in terms of speed, memory usage, time complexity in the worst case and program complexity. This process was also applied to the knot insertion strategy that uses Oslo algorithm 1, Oslo algorithm 2 and Insertion algorithm. For curve generation, the experimental results shown that recursive definition has the speed and resource utilization at the acceptable level. deBoor algorithm is the best choice for those applications where the speed is crucial for attaining the throughput on schedule but there is sufficient memory space, while divided difference method is suggested when there is limited memory space but the speed is not so critical. For knot insertion, in terms of efficiency, the Insertion algorithm ranks first, Oslo algorithm 1, the second and Oslo algorithm 2, the third. However, the more efficiency the algorithm is, the more difficult programming task it requires.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element	Spline theory
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element	Computer-aided design
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name	Huynh, Ngoc Phien,
Relator term	Chairperson
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name	Phan, Minh Dung,
Relator term	Examination Committee
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name	Bohez, Erik L.J.,
Relator term	Examination Committee
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element	Australian Government,
Relator term	Scholarship donor
810 2# - SERIES ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element	Asian Institute of Technology.
Title of a work	Thesis ;
Volume/sequential designation	no. CS-89-20
856 ## - ELECTRONIC LOCATION AND ACCESS
Materials specified	Full-Text
Uniform Resource Identifier	<a href="http://203.159.5.9/ait-thesis/detail.php?q=B17659">http://203.159.5.9/ait-thesis/detail.php?q=B17659</a>
907 ## - LOCAL DATA ELEMENT G, LDG (RLIN)
a	.b10104537
b	mnait
c	x
902 ## - LOCAL DATA ELEMENT B, LDB (RLIN)
a	240411
998 ## - LOCAL CONTROL INFORMATION (RLIN)
Operator's initials, OID (RLIN)	2
Cataloger's initials, CIN (RLIN)	951012
First date, FD (RLIN)	m
--	a
--	x
--	0
945 ## - LOCAL PROCESSING INFORMATION (OCLC)
l	mnait
945 ## - LOCAL PROCESSING INFORMATION (OCLC)
l	mnait
945 ## - LOCAL PROCESSING INFORMATION (OCLC)
l	mnarc
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type	22-AIT Thesis (Replacement)
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type	40-Archives
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type	20-AIT Publication
909 ## - LOCAL ITEMS USED
Barcode	Barcode : 30050120677629
CREATED	CREATED : 2014-02-18
RECORD Id	RECORD # : i12766094
LPATRON	LPATRON : 0
LCHKIN	LCHKIN : -
RENEWALS	# RENEWALS : 0
--	# OVERDUE : 0
--	IUSE3 : 0
--	TOT CHKOUT : 0
--	TOT RENEW : 0
909 ## - LOCAL ITEMS USED
Barcode	Barcode : 30050120373278
CREATED	CREATED : 2016-08-06
RECORD Id	RECORD # : i13023895
LPATRON	LPATRON : 0
LCHKIN	LCHKIN : -
RENEWALS	# RENEWALS : 0
--	# OVERDUE : 0
--	IUSE3 : 0
--	TOT CHKOUT : 0
--	TOT RENEW : 0
909 ## - LOCAL ITEMS USED
Barcode	Barcode : 30050121000474
CREATED	CREATED : 2021-02-03
RECORD Id	RECORD # : i13329959
LPATRON	LPATRON : 0
LCHKIN	LCHKIN : -
RENEWALS	# RENEWALS : 0
--	# OVERDUE : 0
--	IUSE3 : 0
--	TOT CHKOUT : 0
--	TOT RENEW : 0

Holdings
Not for loan	Home library	Current library	Shelving location	Date acquired	Cost, normal purchase price	Full call number	Barcode	Date last seen	Copy number	Price effective from	Koha item type
Available for Loans	Asian Institute of Technology Library	Asian Institute of Technology Library	AIT Publications	17/08/2026	50.00	AIT Thesis no.CS-89-20	30050120677629	17/08/2026	3	17/08/2026	22-AIT Thesis (Replacement)
Available for Loans	Asian Institute of Technology Library	Asian Institute of Technology Library	Archives	17/08/2026		AIT Thesis no.CS-89-20	30050120373278	17/08/2026		17/08/2026	40-Archives
Available for Loans	Asian Institute of Technology Library	Asian Institute of Technology Library	AIT Publications	17/08/2026		AIT Thesis no.CS-89-20	30050121000474	17/08/2026	1	17/08/2026	20-AIT Publication

B-spline curves : (Record no. 10434)

AIT

Asian Institute of Technology Library