期刊
COMPUTERS & GRAPHICS-UK
卷 35, 期 3, 页码 677-684出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cag.2011.03.025
关键词
Minimum distance computation; Bezier curve and surface; Bounding volume hierarchy
资金
- Research Grant Council of Hong Kong [718209, 718010]
- NSFC [60933008]
- NRF [2010-0014351]
- National Research Foundation of Korea [2010-0014351] Funding Source: Korea Institute of Science & Technology Information (KISTI), National Science & Technology Information Service (NTIS)
We present an efficient and robust method based on the culling approach for computing the minimum distance between two Bezier curves or Bezier surfaces. Our contribution is a novel dynamic subdivision scheme that enables our method to converge faster than previous methods based on binary subdivision. (C) 2011 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据
分享论文
