Results 51 to 60 of about 1,299 (185)
Renormalization techniques for inflation systems and some of their applications
Acta Crystallographica Section A, EarlyView.In this work, renormalization methods for quantities related to the diffraction of inflation systems are surveyed.Exact renormalization techniques are important and powerful, particularly for inflation‐generated systems. We review recent results in this direction.
Michael Baake +4 more
wiley +1 more source
Fast Injective Mesh Parameterization via Beltrami Coefficient Prolongation
Computer Graphics Forum, EarlyView.Abstract We present a highly efficient and robust method for free boundary injective parameterization of disk‐like triangle meshes with low isometric distortion. Harmonic function–based approaches, grounded in a strong mathematical framework, are widely employed.
G. Fargion, O. Weber
wiley +1 more source
Interpolated Adaptive Linear Reduced Order Modeling for Deformation Dynamics
Computer Graphics Forum, EarlyView.Abstract Linear reduced‐order modeling (ROM) is widely used for efficient simulation of deformation dynamics, but its accuracy is often limited by the fixed linearization of the reduced mapping. We propose a new adaptive strategy for linear ROM that allows the reduced mapping to vary dynamically in response to the evolving deformation state ...
Y. Tao, M. Chiaramonte, P. Fernandez
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
A General Theory of Structure Spaces with Applications to Spaces of Prime Ideals
, 1991 A structure space is a quadruple X = (X, d, A, P), where for some set R, X c A = 2R, d : X × X A is defined by d(I, J) = J - I, and P is the family of cofinite subsets of R. For r ε P, I ε X, Nr(I) = {J ε X : d(I, J) c r}, To(X) = {Q c X : if x ε Q there
Kopperman, Ralph, Henriksen, Melvin
core +1 more source
Rearrangements of Measurable Functions [PDF]
, 1970 Let (X, Λ, μ) be a measure space and let M(X, μ) denote the set of all extended real valued measurable functions on X. If (X1, Λ1, μ1) is also a measure space and f ϵ M(X, μ) and g ϵ M(X1, μ1), then f and g are said to be equimeasurable (written f ~ g ...
Day, Peter William
core +1 more source
Establishing Shape Correspondences: A Survey
Computer Graphics Forum, EarlyView.Abstract Shape correspondence between surfaces in 3D is a central problem in geometry processing, concerned with establishing meaningful relations between surfaces. While all correspondence problems share this goal, specific formulations can differ significantly: Downstream applications require certain properties that correspondences must satisfy ...
A. Heuschling, H. Meinhold, L. Kobbelt
wiley +1 more source
Computer Graphics Forum, EarlyView.Abstract We introduce mixed super‐circles, a position‐curvature formulation of the original dynamic 2D super‐helix model. Compared to the latter, purely curvature‐based model – the so‐called chained formulation –, the mixed formulation that we propose here drastically reduces the algorithmic complexity of the solving scheme – from quadratic to quasi ...
Emile Hohnadel +2 more
wiley +1 more source
F-Spaces and Substonean Spaces General Topology as a Tool in Functional Analysis
, 1989 K. Grove and G. Pedersen define a substonean space to be a locally compact (Hausdorff) space in which disjoint σ-compact open subspaces have disjoint compact closures.
Henriksen, Melvin, Woods, R. G.
core +1 more source
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 +6 more
wiley +1 more source