Results 231 to 240 of about 48,852 (268)
Some of the next articles are maybe not open access.
ACM Transactions on Graphics, 2018
We propose a novel approach, calledProgressive Parameterizations, to compute foldover-free parameterizations with low isometric distortion on disk topology meshes. Instead of using the input mesh as a reference to define the objective function, we introduce a progressive reference that contains bounded distortion to the parameterized mesh and is as ...
Ligang Liu 0001 +3 more
openaire +1 more source
We propose a novel approach, calledProgressive Parameterizations, to compute foldover-free parameterizations with low isometric distortion on disk topology meshes. Instead of using the input mesh as a reference to define the objective function, we introduce a progressive reference that contains bounded distortion to the parameterized mesh and is as ...
Ligang Liu 0001 +3 more
openaire +1 more source
IEEE Transactions on Software Engineering, 1984
Summary: Parameterized programming is a powerful technique for the reliable reuse software. In this technique, modules are parameterized over very general interfaces that describe what properties of an environment are required for the module to work correctly.
openaire +2 more sources
Summary: Parameterized programming is a powerful technique for the reliable reuse software. In this technique, modules are parameterized over very general interfaces that describe what properties of an environment are required for the module to work correctly.
openaire +2 more sources
A Comparison of the $\delta$ Parameterization and the $\tau$ Parameterization
2019 American Control Conference (ACC), 2019This paper continues the analysis of biquad structures - discretized at high sample rates relative to the dynamic frequencies of the biquad - by introducing the $T$ parameterization as an alternative to the venerable 6 parameterization [1], [2]. The $T$ parameterization has slightly improved coefficient accuracy as the scale factor between sample ...
openaire +1 more source
Computer Graphics Forum, 2013
AbstractWe present a novel algorithm for generating a planar parameterization of the region surrounding a curve embedded in a 3D surface, which we call a stroke parameterization. The technique, which extends the well‐known Discrete Exponential Map [SGW06], uses the same basic geometric transformations and hence is both efficient and easy‐to‐implement ...
openaire +1 more source
AbstractWe present a novel algorithm for generating a planar parameterization of the region surrounding a curve embedded in a 3D surface, which we call a stroke parameterization. The technique, which extends the well‐known Discrete Exponential Map [SGW06], uses the same basic geometric transformations and hence is both efficient and easy‐to‐implement ...
openaire +1 more source
2006
Manifold parameterization considers the problem of parameterizing a given triangular mesh onto another mesh surface, which could be particularly plane or sphere surfaces. In this paper we propose a unified framework for manifold parameterization between arbitrary meshes with identical genus.
Lei Zhang 0021 +3 more
openaire +1 more source
Manifold parameterization considers the problem of parameterizing a given triangular mesh onto another mesh surface, which could be particularly plane or sphere surfaces. In this paper we propose a unified framework for manifold parameterization between arbitrary meshes with identical genus.
Lei Zhang 0021 +3 more
openaire +1 more source
A parameterized shared-memory scheme for parameterized metaheuristics
The Journal of Supercomputing, 2011This paper presents a parameterized shared-memory scheme for parameterized metaheuristics. The use of a parameterized metaheuristic facilitates experimentation with different metaheuristics and hybridation/combinations to adapt them to the particular problem we are working with.
Francisco Almeida +2 more
openaire +1 more source
Computer Aided Geometric Design, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
On Parameterized Approximability
2006Combining classical approximability questions with parameterized complexity, we introduce a theory of parameterized approximability. The main intention of this theory is to deal with the efficient approximation of small cost solutions for optimisation problems.
Yijia Chen 0001 +2 more
openaire +2 more sources
Approximate Parameterized Matching
ACM Transactions on Algorithms, 2004Two equal length strings s and s ′, over alphabets Σ s and Σ s ′, parameterize match if there exists a bijection π : Σ s
Carmit Hazay +2 more
openaire +1 more source
Canadian Journal of Mathematics, 1957
A matrix P with elements from an arbitrary field is called a cogredient automorph (c.a.) of a symmetric matrix A if P'AP = A, where P' is the transpose of P.
openaire +2 more sources
A matrix P with elements from an arbitrary field is called a cogredient automorph (c.a.) of a symmetric matrix A if P'AP = A, where P' is the transpose of P.
openaire +2 more sources