Results 31 to 40 of about 158 (143)
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
Volume Quantization with Flexible Singularities for Hexahedral Meshing
Computer Graphics Forum, EarlyView.Abstract We present a novel algorithm for quantization and subsequent hexahedral mesh generation from seamless volumetric maps. Quantization is the process of choosing integers that represent the numbers of hexahedral elements to be placed in each region of the volume, and transforming the seamless map into an integer‐grid map matching that choice ...
H. Brückler, M. Campen
wiley +1 more source
Sir Syed University Research Journal of Engineering and Technology, 2018 A new structure to develop 64-bit RSA encryption engine on FPGA is being presented in this paper that can be used as a standard device in the secured communication system. The RSA algorithm has three parts i.e. key generation, encryption and decryption.
Rehan Shams +3 more
doaj
Contouring Signed Distance Fields by Approximating Gradients
Computer Graphics Forum, EarlyView.Abstract Signed distance fields are often represented by discrete samples (e.g., on a grid). Recovering the contour implicitly represented by the distance samples requires an approximation algorithm. Several recent approaches have shown that exploiting the information carried in each distance sample by explicitly constructing a surface point gives ...
M. Kohlbrenner, M. Alexa
wiley +1 more source
DiskScissors: Cutting Arbitrary‐Topology Solids for Bijective Mapping
Computer Graphics Forum, EarlyView.Abstract An algorithm for cutting solid objects in a topology‐controlled manner is presented. Concretely, given a loop on the object boundary, a disk‐topology cut surface bounded by the loop is constructed in the interior. In contrast to various previous approaches, both disk topology and conformance to the prescribed loop are ensured by construction ...
S. Hinderink, M. Campen
wiley +1 more source
Cyclemaster Matrices and Primality Testing
, 2023 We define the $N \times N$ single variable cyclemaster matrix, and use its determinant to construct a necessary and sufficient test for $N$ to be prime.
Mazur, Marcin, Zemyan, Stephen M.
openaire +3 more sources
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
Gender, Work &Organization, EarlyView.ABSTRACT Over the last decade, policy actors have produced a surge of “future of work” reports that reimagine workers through the dual logics of digitalization and human capital. Drawing on 25 policy documents (WEF, World Bank, OECD, EU, and major consultancies) and combining Bacchi and Goodwin's WPR approach with decolonial feminist theory, this paper
Muneeb Ul Lateef Banday
wiley +1 more source
Dickson Pseudoprimes and Primality Testing [PDF]
, 2007 The paper gives a general definition for the concept of strong Dickson pseudoprimes which contains as special cases the Carmichael numbers and the strong Fibonacci pseudoprimes. Furthermore, we give necessary and sufficient conditions for two important classes of strong Dickson pseudoprimes and deduce some properties for their elements. A suggestion of
Winfried B. Müller, Alan Oswald
openaire +1 more source
Integrated location–inventory planning for slow‐moving demands with waiting time limitations
International Transactions in Operational Research, EarlyView.Abstract This paper studies a stochastic facility location problem integrated with inventory and transportation decisions (SFLPIT) for supply chains with slow‐moving stock‐keeping units (SKUs). Local stores often avoid maintaining such SKUs, resulting in customer demand being fulfilled directly by a central distribution center (DC), where the ...
Jie Chu +4 more
wiley +1 more source