Results 71 to 80 of about 4,194 (193)

Computing Skinning Weights via Convex Duality

open access: yesComputer 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

Control problems driven by approximately pseudo-convex multiple integral functionals

open access: yesMathematical Control and Related Fields
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marghescu, Cristina-Florentina   +1 more
openaire   +2 more sources

FluidMap: Proportional and Spatially Consistent Layout Enrichments in Multidimensional Projections

open access: yesComputer Graphics Forum, EarlyView.
FluidMap faithfully represents the frequency of an attribute and preserves spatial consistency. Current space‐filling methods over‐ or under‐represent attribute categories (i.e., all Voronoi‐based methods), sacrifice spatial consistency (i.e., Nmap) or both (i.e., Voronoi‐MWα).
Daniela Blumberg   +5 more
wiley   +1 more source

Complete Monotone Quasiconcave Duality [PDF]

open access: yes
We introduce a notion of complete monotone quasiconcave duality and we show that it holds for important classes of quasiconcave functions.Quasiconcavity, Quasiconvexity, Duality, Indirect ...
Fabio Maccheroni   +3 more
core  

Basis Networks: Learning basis functions for free‐form triangulations

open access: yesComputer Graphics Forum, EarlyView.
Abstract We present a framework for learning compactly supported basis functions that define tangent continuous surfaces based on coarse irregular triangle meshes. The basis functions are represented as MLPs. Smoothness of the basis functions is achieved by using the values of Loop basis functions as the parameterization of the surface.
T. Djuren, M. Alexa
wiley   +1 more source

Milne and Hermite-Hadamard's type inequalities for strongly multiplicative convex function via multiplicative calculus

open access: yesAIMS Mathematics
<p>In this paper, we take into account the notion of strongly multiplicative convex function and derive integral inequalities of Hermite-Hadamard ($ H.H $) type for such a function in the frame of multiplicative calculus. We also develop integral inequalities of $ H.H $ type for product and quotient of strongly multiplicative convex and strongly ...
Muhammad Umar   +2 more
openaire   +2 more sources

A Semi‐Analytical Energy Model for Particle‐Based Fluid Simulation Involving Complex Moving Boundaries

open access: yesComputer Graphics Forum, EarlyView.
Abstract While semi‐analytical boundary handling techniques have proven effective for modeling particle‐based fluid‐solid interactions, they can become unstable when applied to mesh boundaries undergoing dynamic motion or featuring complex, sharp geometries.
Junyuan Liu   +5 more
wiley   +1 more source

Survey on differential estimators for 3d point clouds

open access: yesComputer 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   +4 more
wiley   +1 more source

Register‐Efficient Linear‐Time Evaluation in the Bernstein Basis

open access: yesComputer 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

Home - About - Disclaimer - Privacy