DocumentCode
2096935
Title
An Improved Euler Spiral Algorithm for Shape Completion
Author
Walton, D.J. ; Meek, D.S.
Author_Institution
Dept. of Comput. Sci. & St. Paul´´s Coll., Manitoba Univ., Winnipeg, MB
fYear
2008
fDate
28-30 May 2008
Firstpage
237
Lastpage
244
Abstract
The shape completion problem refers to the interruption, e.g. by occlusion, of the geometric continuation of boundaries of objects. It is important to use a single visually pleasing curve segment to smoothly fill a gap, even though the gap may not be filled in a curvature continuous manner. Recently an algorithm for doing so using an Euler spiral segment was presented; the algorithm depends on initially fitting a biarc. An improved algorithm, which does not depend on first fitting a biarc, is now presented.
Keywords
computational geometry; curve fitting; biarc fitting; improved Euler spiral algorithm; object boundary geometric continuation; shape completion problem; visual pleasing curve segment; Application software; Computer science; Computer vision; Educational institutions; Nonlinear equations; Rail transportation; Road transportation; Robot vision systems; Shape; Spirals; Euler spiral; shape completion;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer and Robot Vision, 2008. CRV '08. Canadian Conference on
Conference_Location
Windsor, Ont.
Print_ISBN
978-0-7695-3153-3
Type
conf
DOI
10.1109/CRV.2008.11
Filename
4562116
Link To Document