نتایج جستجو برای: moving least squares

تعداد نتایج: 494265  

2017
Jieting Wu Jianping Zeng Feiyu Zhu Hongfeng Yu

Edge bundling methods can effectively alleviate visual clutter and reveal high-level graph structures in large graph visualization. Researchers have devoted significant efforts to improve edge bundling according to different metrics. As the edge bundling family evolve rapidly, the quality of edge bundles receives increasing attention in the literature accordingly. In this paper, we present MLSE...

Journal: :IEICE Transactions 2017
Junda Zhang Libing Jiang Longxing Kong Li Wang Xiao'an Tang

In this letter, we present a novel method for reconstructing continuous data field from scattered point data, which leads to a more characteristic visualization result by volume rendering. The gradient distribution of scattered point data is analyzed for local feature investigation via singular-value decomposition. A data-adaptive ellipsoidal shaped function is constructed as the penalty functi...

2007
Pinghai Yang Xiaoping Qian

Accurate computing of the curvatures of a surface from its discrete form is of fundamental importance for many graphics and engineering applications. The moving least-squares (MLS) surface from Levin [Lev2003] and its variants have been successfully used to define point-set surfaces in a variety of point cloud data based modeling and rendering applications. This paper presents a set of analytic...

Journal: :J. Comput. Physics 2009
Samuel K. M. Chenoweth Julio Soria Andrew Ooi

Moving least squares interpolation schemes are in widespread use as a tool for numerical analysis on scattered data. In particular, they are often employed when solving partial differential equations on unstructured meshes, which are typically needed when the geometry defining the domain is complex. It is known that such schemes can be singular if the data points in the stencil happen to be in ...

Journal: :CoRR 2018
Danping Liao Siyu Chen Yuntao Qian

Displaying the large number of bands in a hyperspectral image (HSI) on a trichromatic monitor has been an active research topic. The visualized image shall convey as much information as possible from the original data and facilitate image interpretation. Most existing methods display HSIs in false colors, which contradict with human’s experience and expectation. In this paper, we propose a nonl...

Journal: :Journal of Visualization and Computer Animation 2016
Takuya Imai Yoshihiro Kanamori Jun Mitani

Particle-based liquid is often rendered only with single refraction in real-time applications, which deteriorates the reality of liquid. We present a screen-space method for rendering particle-based liquids with up to four refractions in real time. Our method separates liquid particles into splashes and aggregations (i.e., liquid bodies), and generates a pair of depth maps of frontand back-faci...

Journal: :Comput. Graph. Forum 2014
Christopher Schroers Simon Setzer Joachim Weickert

The problem of reconstructing a watertight surface from a finite set of oriented points has received much attention over the last decades. In this paper, we propose a general higher order framework for surface reconstruction. It is based on the idea that position and normal defined by each oriented point can be used to construct an implicit local description of the unknown surface. On the one h...

Journal: :Applied Mathematics and Computation 2015
Grand Roman Joldes Habibullah Amin Chowdhury Adam Wittek Barry Doyle Karol Miller

One common problem encountered in many fields is the generation of surfaces based on values at irregularly distributed nodes. To tackle such problems, we present a modified, robust moving least squares (MLS) method for scattered data smoothing and approximation. The error functional used in the derivation of the classical MLS approximation is augmented with additional terms based on the coeffic...

Numerical solutions obtained by the Meshless Local Petrov-Galerkin (MLPG) method are presented for two dimensional steady-state heat conduction problems. The MLPG method is a truly meshless approach, and neither the nodal connectivity nor the background mesh is required for solving the initial-boundary-value problem. The penalty method is adopted to efficiently enforce the essential boundary co...

Journal: :Computers & Graphics 2004
Jan Klein Gabriel Zachmann

We present a new definition of an implicit surface over a noisy point cloud, based on the weighted least squares approach. It can be evaluated very fast, but artifacts are significantly reduced. We propose to use a different kernel function that approximates geodesic distances on the surface by utilizing a geometric proximity graph. From a variety of possibilities, we have examined the Delaunay...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید