Journal
COMPUTERS & GRAPHICS-UK
Volume 35, Issue 3, Pages 677-684Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cag.2011.03.025
Keywords
Minimum distance computation; Bezier curve and surface; Bounding volume hierarchy
Categories
Funding
- 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)
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
