 |
|
|
|
| HAL: inria-00202457, version 1 |
| DOI: 10.1109/IMSCCS.2007.17 |
| See detailed view |  BibTeX,EndNote,... |
|
|
| Second International Multi-Symposiums on Computer and Computational Sciences (IMSCCS 2007), Iowa City : États-Unis d'Amérique (2007) |
|
|
|
|
| Improved Algebraic Algorithm On Point Projection For Bézier Curves |
|
|
| Xiao-Diao Chen 1Yin Zhou 2 |
|
|
| (2007) |
|
|
|
| This paper presents an improved algebraic pruning method for point projection for Bézier curves. It first turns the point projection into a root finding problem, and provides a simple but easily overlooked method to avoid finding invalid roots which is obviously irrelative to the closest point. The continued fraction method and its expansion are utilized to strengthen its robustness. Since NURBS curves can be easily turned into B´ezier form, the new method also works with NURBS curves. Examples are presented to illustrate the efficiency and robustness of the new method. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | CAD (CAD LIAMA INRIA Paris - Rocquencourt) |
|
|
|
CIRAD – CNRS – INRA – Chinese Academy of Science (CAS) – Institute of Automation, Chinese Academy of Sciences – INRIA Paris - Rocquencourt |
|
|
| 2: | Ningbo Institute of Technology (NIT) |
|
|
|
Zhejiang University |
|
|
| 3: | Tsinghua University |
|
|
|
Tsinghua University |
|
|
|
|
|
|
|
|
|
| Domain | : | Computer Science/Computer Aided Engineering |
|
|
| Point projection – NURBS curve – Continued fraction method – Algebraic pruning method |
|
|
|
| Attached file list to this document: | |||||
|
|||||
|
|
|
| inria-00202457, version 1 | |
| http://hal.inria.fr/inria-00202457 | |
| oai:hal.inria.fr:inria-00202457 | |
| From: Chine Publications Liama | |
| Submitted on: Monday, 7 January 2008 09:28:42 | |
| Updated on: Monday, 7 January 2008 09:31:31 | |
