There are no files associated with this item.

##### Supplementary
• Appears in Collections:

#### Conference Paper: Computing the distance between canal surfaces

Title Computing the distance between canal surfaces Ma, YTu, CWang, W Bounding volumeCanal surfaceCone-spheresDistance computationDistance interval 2010 Springer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/ The 6th International Conference of Geometric Modeling & Processing (GMP 2010), Casto Urdiales, Spain, 16-18 June 2010. In Lecture Notes in Computer Science, 2010, v. 6130, p. 88-103 How to Cite? A canal surface is the envelope of a one-parameter 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 cone-spheres to enclose a canal surface. A cone-sphere 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 cone-spheres to approximate their distance; the accuracy of this approximation is improved by subdividing the canal surfaces into more segments and use more cone-spheres to bound the segments, until a pre-specified threshold is reached. We present a method for computing tight bounding cone-spheres 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 cone-spheres. The key to its efficiency is a novel pruning technique that can eliminate most of the pairs of cone-spheres 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 Springer-Verlag. LNCS v. 6130 is proceedings of the 6th International Conference, GMP 2010 http://hdl.handle.net/10722/132188 0302-97432005 Impact Factor: 0.4022015 SCImago Journal Rankings: 0.252 References in Scopus

DC FieldValueLanguage
dc.contributor.authorMa, Yen_HK
dc.contributor.authorTu, Cen_HK
dc.contributor.authorWang, Wen_HK
dc.date.accessioned2011-03-21T09:00:05Z-
dc.date.available2011-03-21T09:00:05Z-
dc.date.issued2010en_HK
dc.identifier.citationThe 6th International Conference of Geometric Modeling & Processing (GMP 2010), Casto Urdiales, Spain, 16-18 June 2010. In Lecture Notes in Computer Science, 2010, v. 6130, p. 88-103en_HK
dc.identifier.issn0302-9743en_HK
dc.identifier.urihttp://hdl.handle.net/10722/132188-
dc.descriptionLNCS v. 6130 is proceedings of the 6th International Conference, GMP 2010-
dc.description.abstractA canal surface is the envelope of a one-parameter 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 cone-spheres to enclose a canal surface. A cone-sphere 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 cone-spheres to approximate their distance; the accuracy of this approximation is improved by subdividing the canal surfaces into more segments and use more cone-spheres to bound the segments, until a pre-specified threshold is reached. We present a method for computing tight bounding cone-spheres 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 cone-spheres. The key to its efficiency is a novel pruning technique that can eliminate most of the pairs of cone-spheres 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 Springer-Verlag.en_HK
dc.languageengen_US
dc.publisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/en_HK
dc.relation.ispartofLecture Notes in Computer Scienceen_HK
dc.rightsThe original publication is available at www.springerlink.comen_US
dc.subjectBounding volumeen_HK
dc.subjectCanal surfaceen_HK
dc.subjectCone-spheresen_HK
dc.subjectDistance computationen_HK
dc.subjectDistance intervalen_HK
dc.titleComputing the distance between canal surfacesen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailWang, W:wenping@cs.hku.hken_HK
dc.identifier.authorityWang, W=rp00186en_HK
dc.identifier.doi10.1007/978-3-642-13411-1_7en_HK
dc.identifier.scopuseid_2-s2.0-77954653967en_HK
dc.identifier.hkuros177911en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-77954653967&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume6130en_HK
dc.identifier.spage88en_HK
dc.identifier.epage103en_HK
dc.publisher.placeGermanyen_HK
dc.description.otherThe 6th International Conference of Geometric Modeling & Processing (GMP 2010), Casto Urdiales, Spain, 16-18 June 2010. In Lecture Notes in Computer Science, 2010, v. 6130, p. 88-103-
dc.identifier.scopusauthoridMa, Y=35763294200en_HK
dc.identifier.scopusauthoridTu, C=7402578832en_HK
dc.identifier.scopusauthoridWang, W=35147101600en_HK