نتایج جستجو برای: signed distance method
تعداد نتایج: 1833325 فیلتر نتایج به سال:
this study considers an eoq inventory model with advance payment policy in a fuzzy situation by employing two types of fuzzy numbers that are trapezoidal and triangular. two fuzzy models are developed here. in the first model the cost parameters are fuzzified, but the demand rate is treated as crisp constant. in the second model, the demand rate is fuzzified but the cost parameters are treated ...
Signed graphs have their edges labeled either as positive or negative. Here we introduce two types of signed distance matrix for graphs. We characterize balance in using these matrices and obtain explicit formulae the spectrum some unbalanced also notion distance-compatible partially it.
A signed graph is a whose edges are labeled either positive or negative. Corresponding to the two distance matrices defined for graphs, we define laplacian matrices. We characterize balance in graphs using these and find spectra of some classes unbalanced graphs.
We propose a parallel ray-tracing technique to visualize signed distance fields generated from triangular meshes based on NVIDIA OptiX. Our method visualizes signed distance fields with various distance offset values at interactive rates (2–12 fps). Our method utilizes a parallel kd-tree implementation to query the nearest triangle and the sphere tracing method to visualize the implicit surface.
The signed distance function can effectively support many geometry processing tasks such as decimates, smoothing and shape reconstruction since it provides efficient access to distance estimates. In this talk, we present an adaptive method to approximate the signed distance function of a smooth curve by using polynomial splines over type-2 triangulation. The trimmed offsets are also studied.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید