Results 131 to 140 of about 3,056 (285)

Computing Skinning Weights via Convex Duality

Computer Graphics Forum, EarlyView.
We present an alternate optimization method to compute bounded biharmonic skinning weights. Our method relies on a dual formulation, which can be optimized with a nonnegative linear least squares setup. Abstract We study the problem of optimising for skinning weights through the lens of convex duality.
J. Solomon, O. Stein
wiley   +1 more source

Cyclic amenability of Lau product and module extension Banach algebras

پژوهش‌های ریاضی, 2022
Introduction The notion of weak amenability for commutative Banach algebras was introduced and studied for the first time by Bade, Curtis and Dales. Johnson extended this concept to the non commutative case and showed that group algebras of all locally ...
Mohammad Ramezanpour, Mahdieh Alikahi
doaj  

Gradings on the algebra of triangular matrices as a Lie algebra: Revisited

Journal of Algebra
We investigate the group gradings on the algebra of upper triangular matrices over an arbitrary field, viewed as a Lie algebra. These results were obtained a few years early by the same authors. We provide streamlined proofs, and present a complete classification of isomorphism classes of the gradings.
Plamen Koshlukov, Felipe Yukihide Yasumura   +1 more
openaire   +3 more sources

Survey on differential estimators for 3d point clouds

Computer Graphics Forum, EarlyView.
Abstract Recent advancements in 3D scanning technologies, including LiDAR and photogrammetry, have enabled the precise digital replication of real‐world objects. These methods are widely used in fields such as GIS, robotics, and cultural heritage. However, the point clouds generated by such scans are often noisy and unstructured, posing challenges for ...
Léo Arnal–Anger, Thibault Lejemble, David Coeurjolly, Loïc Barthe, Nicolas Mellado   +4 more
wiley   +1 more source

Triangular matrix algebras over quasi-hereditary algebras

Tsukuba Journal of Mathematics, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Register‐Efficient Linear‐Time Evaluation in the Bernstein Basis

Computer Graphics Forum, EarlyView.
Abstract We investigate the evaluation of points and derivatives of Bézier curves and surfaces on modern architectures, focusing on performance and guided by numerical error bounds. While the de Casteljau algorithm remains the reference for numerical robustness, its linear working‐set size imposes substantial register pressure on GPUs.
Gábor Valasek, Anna Lili Horváth
wiley   +1 more source

Hierarchical Optimization of the As‐Rigid‐As‐Possible Energy

Computer Graphics Forum, EarlyView.
Abstract The As‐Rigid‐As‐Possible (ARAP) energy [SA07] has become a versatile ingredient in various geometry processing and machine learning methods. The classic method for its minimization is a block coordinate descent, alternating between local rotation estimation and a global linear solve, which converges slowly for large problem instances.
Hendrik Meyer, Bernd Bickel, Marc Alexa
wiley   +1 more source

Quantitative Metrics for Edge Bundling of Network Visualizations

Computer Graphics Forum, EarlyView.
Abstract Edge bundling is widely used for reducing visual clutter in large 2D network and trajectory visualizations. Various edge bundling methods have been proposed, each producing qualitatively distinct outputs for the same data; however, few quantitative metrics exist for systematic evaluation. In this paper, we propose a set of quantitative metrics
M. Wallinger, J. Miller, A. Maftei, S. G. Kobourov   +3 more
wiley   +1 more source

Jordan Isomorphisms of Upper Triangular Matrix Rings [PDF]

, 2013
[[abstract]]Let R be a 2-torsionfree ring with identity 1 and let Tn(R), n ⩾ 2, be the ring of all upper triangular n × n matrices over R. We describe additive Jordan isomorphisms of Tn(R) onto an arbitrary ring and generalize several results on this ...
Liu, Cheng-Kai; Tsai, Wan-Yu
core  

Scalable Computation of Topological Abstractions for Scalar Data

Computer Graphics Forum, EarlyView.
Abstract Topological data analysis has become an important tool for large scale scalar data analysis and visualization, efficiently extracting the inherent structure and features of interest of the data. However, with growing dataset sizes and complexity, it is increasingly becoming infeasible to compute topological abstractions of interest in serial ...
M. Will, J. Lukasczyk, J. Tierny, A. Gyulassy, G. H. Weber, H. Carr, C. Garth   +6 more
wiley   +1 more source