Marching along a regular surface surface intersection with circular steps

dc.creatorWu, ST
dc.creatorAndrade, LN
dc.date1999
dc.dateMAY
dc.date2014-12-02T16:29:31Z
dc.date2015-11-26T16:54:55Z
dc.date2014-12-02T16:29:31Z
dc.date2015-11-26T16:54:55Z
dc.date.accessioned2018-03-28T23:42:13Z
dc.date.available2018-03-28T23:42:13Z
dc.identifierComputer Aided Geometric Design. Elsevier Science Bv, v. 16, n. 4, n. 249, n. 268, 1999.
dc.identifier0167-8396
dc.identifierWOS:000080184500002
dc.identifier10.1016/S0167-8396(98)00048-X
dc.identifierhttp://www.repositorio.unicamp.br/jspui/handle/REPOSIP/53235
dc.identifierhttp://www.repositorio.unicamp.br/handle/REPOSIP/53235
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/53235
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1276984
dc.descriptionThis paper presents a simple and elegant algorithm to estimate adaptively the stepping direction and size for tracing a branch of the intersection curve between two regular surfaces without any nonlinear equation system solver (Kriezis and Patrikalakis, 1991; Abdel-Malek and Yeh, 1996; Grandine and Klein, 1997). The step is neither along the tangent vector at the current point (Barnhill, 1987) nor along a parabola in a vicinity of the current point (Stoyanov, 1992); it is along a circle at the current point. Although no curvature analysis or power series expansions about each point of the intersection curve were used in its construction, we demonstrate that our circle tends to the exact osculating circle, when the distance between two subsequent sampling points tends to zero. Through numerical examples, we also show that the performance of our algorithm by handling singular points, bifurcations, and points on the closely spaced branches, is equivalent to the ones based on embedding schemes (Abdel-Malek and Yeh, 1996; Grandine and Klein, 1997). (C) 1999 Elsevier Science B.V. All rights reserved.
dc.description16
dc.description4
dc.description249
dc.description268
dc.languageen
dc.publisherElsevier Science Bv
dc.publisherAmsterdam
dc.publisherHolanda
dc.relationComputer Aided Geometric Design
dc.relationComput. Aided Geom. Des.
dc.rightsfechado
dc.rightshttp://www.elsevier.com/about/open-access/open-access-policies/article-posting-policy
dc.sourceWeb of Science
dc.subjectsurface intersection
dc.subjectregular surfaces
dc.subjectmarching method
dc.subjectosculating circle
dc.subjectmarching step
dc.subjectgeometric modeling
dc.titleMarching along a regular surface surface intersection with circular steps
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución