contributor author | Takashi Maekawa | |
contributor author | Wonjoon Cho | |
contributor author | Nicholas M. Patrikalakis | |
date accessioned | 2017-05-08T23:54:15Z | |
date available | 2017-05-08T23:54:15Z | |
date copyright | June, 1997 | |
date issued | 1997 | |
identifier issn | 1050-0472 | |
identifier other | JMDEDB-27645#275_1.pdf | |
identifier uri | http://yetl.yabesh.ir/yetl/handle/yetl/119135 | |
description abstract | Self-intersection of offsets of regular Bézier surface patches due to local differential geometry and global distance function properties is investigated. The problem of computing starting points for tracing self-intersection curves of offsets is formulated in terms of a system of nonlinear polynomial equations and solved robustly by the interval projected polyhedron algorithm. Trivial solutions are excluded by evaluating the normal bounding pyramids of the surface subpatches mapped from the parameter boxes computed by the polynomial solver with a coarse tolerance. A technique to detect and trace self-intersection curve loops in the parameter domain is also discussed. The method has been successfully tested in tracing complex self-intersection curves of offsets of Bézier surface patches. Examples illustrate the principal features and robustness characteristics of the method. | |
publisher | The American Society of Mechanical Engineers (ASME) | |
title | Computation of Self-Intersections of Offsets of Bézier Surface Patches | |
type | Journal Paper | |
journal volume | 119 | |
journal issue | 2 | |
journal title | Journal of Mechanical Design | |
identifier doi | 10.1115/1.2826247 | |
journal fristpage | 275 | |
journal lastpage | 283 | |
identifier eissn | 1528-9001 | |
keywords | Intersections | |
keywords | Computation | |
keywords | Polynomials | |
keywords | Robustness | |
keywords | Equations | |
keywords | Geometry AND Algorithms | |
tree | Journal of Mechanical Design:;1997:;volume( 119 ):;issue: 002 | |
contenttype | Fulltext | |