This article discusses the problem of existence of jointly continuous self-intersection local time for an additive levy process. Here, 'local time' is understood in the sense of occupation density, and by an a...This article discusses the problem of existence of jointly continuous self-intersection local time for an additive levy process. Here, 'local time' is understood in the sense of occupation density, and by an additive Levy process the authors mean a process X = {X(t),t∈ R+N} which has the decomposition X = Xi X2 … XN, each Xl has the lower index αl, α= min{α1,…, αN}. Let Z = (Xt2 - Xt1, …, Xtr - Xtr-1). They prove that if Nrα > d(r-1), then a jointly continuous local time of Z, i.e. the self-intersection local time of X, can be obtained.展开更多
Swept volume solid modeling has been applied to many areas such as NC machining simulation and verification, robot workspace analysis, collision detection, and CAD. But self-intersections continue to be a challenging ...Swept volume solid modeling has been applied to many areas such as NC machining simulation and verification, robot workspace analysis, collision detection, and CAD. But self-intersections continue to be a challenging problem in the boundary representation of swept volume solids. A novel algorithm is presented in this paper to trim self-intersection regions in swept volume solids modeling. This trimming algorithm consists of two major steps: (1) roughly detecting self-intersection regions by checking intersections or overlapping of the envelop profiles; (2) splitting the whole envelop surfaces of the swept volume solid into separate non-self-intersecting patches to trim global self-intersections, and to trim local self-intersections, dividing local self-intersecting regions into patches and replacing self-intersecting patches with non-self-intersecting ones. Examples show that our algorithm is efficient and robust.展开更多
The contour of the slices of SLA parts is composed of a great deal of small lines. When offsetting the contour to compensate for the radius of laser spot, many self-intersection contours come into being, which decreas...The contour of the slices of SLA parts is composed of a great deal of small lines. When offsetting the contour to compensate for the radius of laser spot, many self-intersection contours come into being, which decrease the precision of formed parts. A new lemma to judge the local self-intersection contour and the global self-intersection contour separately is put forward, according to which self-intersection contour can be removed reliably. Meanwhile, a new beam offsetting algorithm for SLA parts is described, which brings about good resuits in the practical manufacturing process.展开更多
基金Supported by the National Natural Science Foundation and the Doctoral Programme Foundation of China.
文摘This article discusses the problem of existence of jointly continuous self-intersection local time for an additive levy process. Here, 'local time' is understood in the sense of occupation density, and by an additive Levy process the authors mean a process X = {X(t),t∈ R+N} which has the decomposition X = Xi X2 … XN, each Xl has the lower index αl, α= min{α1,…, αN}. Let Z = (Xt2 - Xt1, …, Xtr - Xtr-1). They prove that if Nrα > d(r-1), then a jointly continuous local time of Z, i.e. the self-intersection local time of X, can be obtained.
基金Project supported by the National Natural Science Foundation of China (No. 60473106)the Hi-Tech Research and Development Program (863) of China (Nos. 2007AA01Z311 and 2007AA04Z1A5)the National Research Foundation for the Doctoral Program of Higher Education of China (No. 20060335114)
文摘Swept volume solid modeling has been applied to many areas such as NC machining simulation and verification, robot workspace analysis, collision detection, and CAD. But self-intersections continue to be a challenging problem in the boundary representation of swept volume solids. A novel algorithm is presented in this paper to trim self-intersection regions in swept volume solids modeling. This trimming algorithm consists of two major steps: (1) roughly detecting self-intersection regions by checking intersections or overlapping of the envelop profiles; (2) splitting the whole envelop surfaces of the swept volume solid into separate non-self-intersecting patches to trim global self-intersections, and to trim local self-intersections, dividing local self-intersecting regions into patches and replacing self-intersecting patches with non-self-intersecting ones. Examples show that our algorithm is efficient and robust.
文摘The contour of the slices of SLA parts is composed of a great deal of small lines. When offsetting the contour to compensate for the radius of laser spot, many self-intersection contours come into being, which decrease the precision of formed parts. A new lemma to judge the local self-intersection contour and the global self-intersection contour separately is put forward, according to which self-intersection contour can be removed reliably. Meanwhile, a new beam offsetting algorithm for SLA parts is described, which brings about good resuits in the practical manufacturing process.
