File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
 Publisher Website: 10.1007/9783642134111_7
 Scopus: eid_2s2.077954653967
 Find via
Supplementary

Citations:
 Scopus: 0
 Appears in Collections:
Conference Paper: Computing the distance between canal surfaces
Title  Computing the distance between canal surfaces 

Authors  
Keywords  Bounding volume Canal surface Conespheres Distance computation Distance interval 
Issue Date  2010 
Publisher  Springer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/ 
Citation  The 6th International Conference of Geometric Modeling & Processing (GMP 2010), Casto Urdiales, Spain, 1618 June 2010. In Lecture Notes in Computer Science, 2010, v. 6130, p. 88103 How to Cite? 
Abstract  A canal surface is the envelope of a oneparameter set of moving spheres. We present an accurate and efficient method for computing the distance between two canal surfaces. First, we use a set of conespheres to enclose a canal surface. A conesphere is a surface generated by sweeping a sphere along a straight line segment with the radius of the sphere changing linearly; thus it is a truncated circular cone capped by spheres at the two ends. Then, for two canal surfaces we use the distances between their bounding conespheres to approximate their distance; the accuracy of this approximation is improved by subdividing the canal surfaces into more segments and use more conespheres to bound the segments, until a prespecified threshold is reached. We present a method for computing tight bounding conespheres of a canal surface, which is an interesting problem in its own right. Based on it, we present a complete method for efficiently computing the distances between two canal surfaces using the distances among all pairs of their bounding conespheres. The key to its efficiency is a novel pruning technique that can eliminate most of the pairs of conespheres that do not contribute to the distance between the original canal surfaces. Experimental comparisons show that our method is more efficient than Lee et al's method [13] for computing the distance between two complex objects composed of many canal surfaces. © 2010 SpringerVerlag. 
Description  LNCS v. 6130 is proceedings of the 6th International Conference, GMP 2010 
Persistent Identifier  http://hdl.handle.net/10722/132188 
ISSN  2005 Impact Factor: 0.302 2015 SCImago Journal Rankings: 0.252 
References 
DC Field  Value  Language 

dc.contributor.author  Ma, Y  en_HK 
dc.contributor.author  Tu, C  en_HK 
dc.contributor.author  Wang, W  en_HK 
dc.date.accessioned  20110321T09:00:05Z   
dc.date.available  20110321T09:00:05Z   
dc.date.issued  2010  en_HK 
dc.identifier.citation  The 6th International Conference of Geometric Modeling & Processing (GMP 2010), Casto Urdiales, Spain, 1618 June 2010. In Lecture Notes in Computer Science, 2010, v. 6130, p. 88103  en_HK 
dc.identifier.issn  03029743  en_HK 
dc.identifier.uri  http://hdl.handle.net/10722/132188   
dc.description  LNCS v. 6130 is proceedings of the 6th International Conference, GMP 2010   
dc.description.abstract  A canal surface is the envelope of a oneparameter set of moving spheres. We present an accurate and efficient method for computing the distance between two canal surfaces. First, we use a set of conespheres to enclose a canal surface. A conesphere is a surface generated by sweeping a sphere along a straight line segment with the radius of the sphere changing linearly; thus it is a truncated circular cone capped by spheres at the two ends. Then, for two canal surfaces we use the distances between their bounding conespheres to approximate their distance; the accuracy of this approximation is improved by subdividing the canal surfaces into more segments and use more conespheres to bound the segments, until a prespecified threshold is reached. We present a method for computing tight bounding conespheres of a canal surface, which is an interesting problem in its own right. Based on it, we present a complete method for efficiently computing the distances between two canal surfaces using the distances among all pairs of their bounding conespheres. The key to its efficiency is a novel pruning technique that can eliminate most of the pairs of conespheres that do not contribute to the distance between the original canal surfaces. Experimental comparisons show that our method is more efficient than Lee et al's method [13] for computing the distance between two complex objects composed of many canal surfaces. © 2010 SpringerVerlag.  en_HK 
dc.language  eng  en_US 
dc.publisher  Springer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/  en_HK 
dc.relation.ispartof  Lecture Notes in Computer Science  en_HK 
dc.rights  The original publication is available at www.springerlink.com  en_US 
dc.subject  Bounding volume  en_HK 
dc.subject  Canal surface  en_HK 
dc.subject  Conespheres  en_HK 
dc.subject  Distance computation  en_HK 
dc.subject  Distance interval  en_HK 
dc.title  Computing the distance between canal surfaces  en_HK 
dc.type  Conference_Paper  en_HK 
dc.identifier.email  Wang, W:wenping@cs.hku.hk  en_HK 
dc.identifier.authority  Wang, W=rp00186  en_HK 
dc.description.nature  link_to_subscribed_fulltext   
dc.identifier.doi  10.1007/9783642134111_7  en_HK 
dc.identifier.scopus  eid_2s2.077954653967  en_HK 
dc.identifier.hkuros  177911  en_US 
dc.relation.references  http://www.scopus.com/mlt/select.url?eid=2s2.077954653967&selection=ref&src=s&origin=recordpage  en_HK 
dc.identifier.volume  6130  en_HK 
dc.identifier.spage  88  en_HK 
dc.identifier.epage  103  en_HK 
dc.publisher.place  Germany  en_HK 
dc.description.other  The 6th International Conference of Geometric Modeling & Processing (GMP 2010), Casto Urdiales, Spain, 1618 June 2010. In Lecture Notes in Computer Science, 2010, v. 6130, p. 88103   
dc.identifier.scopusauthorid  Ma, Y=35763294200  en_HK 
dc.identifier.scopusauthorid  Tu, C=7402578832  en_HK 
dc.identifier.scopusauthorid  Wang, W=35147101600  en_HK 