File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Computation of the minimum distance between two Bézier curves/surfaces

TitleComputation of the minimum distance between two Bézier curves/surfaces
Authors
Chang, JWChoi, YKKim, MSWang, W
KeywordsBinary subdivision
Bounding volume hierarchies
Curve and surface
Minimum distance computation
Robust methods
Issue Date2011
PublisherPergamon. The Journal's web site is located at http://www.elsevier.com/locate/cag
Citation
Computers & Graphics, 2011, v. 35 n. 3, p. 677-684 How to Cite?
DOI: http://dx.doi.org/10.1016/j.cag.2011.03.025
AbstractWe present an efficient and robust method based on the culling approach for computing the minimum distance between two Bézier curves or Bézier surfaces. Our contribution is a novel dynamic subdivision scheme that enables our method to converge faster than previous methods based on binary subdivision. © 2011 Elsevier Ltd. All rights reserved.
DescriptionShort Communication to SMI 2011
Persistent Identifierhttp://hdl.handle.net/10722/140815
ISSN
0097-8493
2023 Impact Factor: 2.5
2023 SCImago Journal Rankings: 0.791
ISI Accession Number ID
WOS:000292226700028
Funding AgencyGrant Number
Research Grant Council of Hong Kong718209
718010
NSFC60933008
NRF2010-0014351
Funding Information:

The work of W. Wang was partially supported by the Research Grant Council of Hong Kong (718209 and 718010), and the State Key Program of NSFC project (60933008). This work was also supported in part by NRF Research Grant (2010-0014351).

References
References in Scopus

 

DC FieldValueLanguage
dc.contributor.authorChang, JWen_HK
dc.contributor.authorChoi, YKen_HK
dc.contributor.authorKim, MSen_HK
dc.contributor.authorWang, Wen_HK
dc.date.accessioned2011-09-23T06:19:39Z-
dc.date.available2011-09-23T06:19:39Z-
dc.date.issued2011en_HK
dc.identifier.citationComputers & Graphics, 2011, v. 35 n. 3, p. 677-684en_HK
dc.identifier.issn0097-8493en_HK
dc.identifier.urihttp://hdl.handle.net/10722/140815-
dc.descriptionShort Communication to SMI 2011-
dc.description.abstractWe present an efficient and robust method based on the culling approach for computing the minimum distance between two Bézier curves or Bézier surfaces. Our contribution is a novel dynamic subdivision scheme that enables our method to converge faster than previous methods based on binary subdivision. © 2011 Elsevier Ltd. All rights reserved.en_HK
dc.languageengen_US
dc.publisherPergamon. The Journal's web site is located at http://www.elsevier.com/locate/cagen_HK
dc.relation.ispartofComputers & Graphicsen_HK
dc.subjectBinary subdivisionen_HK
dc.subjectBounding volume hierarchiesen_HK
dc.subjectCurve and surfaceen_HK
dc.subjectMinimum distance computation-
dc.subjectRobust methods-
dc.titleComputation of the minimum distance between two Bézier curves/surfacesen_HK
dc.typeArticleen_HK
dc.identifier.emailChang, JW: jungwoochang@gmail.comen_HK
dc.identifier.emailChoi, YK: lykchoi@hku.hken_HK
dc.identifier.emailWang, W: wenping@cs.hku.hk-
dc.identifier.authorityChoi, YK=rp00106en_HK
dc.identifier.authorityWang, W=rp00186en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1016/j.cag.2011.03.025en_HK
dc.identifier.scopuseid_2-s2.0-79957841782en_HK
dc.identifier.hkuros194928en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-79957841782&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume35en_HK
dc.identifier.issue3en_HK
dc.identifier.spage677en_HK
dc.identifier.epage684en_HK
dc.identifier.isiWOS:000292226700028-
dc.publisher.placeUnited Kingdomen_HK
dc.identifier.scopusauthoridWang, W=35147101600en_HK
dc.identifier.scopusauthoridKim, MS=36067105100en_HK
dc.identifier.scopusauthoridChoi, YK=7404777348en_HK
dc.identifier.scopusauthoridChang, JW=35247700900en_HK
dc.identifier.citeulike9189075-
dc.identifier.issnl0097-8493-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats