Results 211 to 220 of about 49,371 (261)
Distinct beta burst motifs exhibit opposing error relationships during motor adaptation
Moreau Q +4 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
A Survey on Implicit Surface Polygonization
ACM Computing Surveys, 2015Implicit surfaces (IS) are commonly used in image creation, modeling environments, modeling objects, and scientific data visualization. In this article, we present a survey of different techniques for fast visualization of IS. The main classes of visualization algorithms are identified along with the advantages of each in the context of the different ...
Joaquim A Jorge +2 more
exaly +2 more sources
Visualisation of implicit surfaces
Computers & Graphics, 2001Abstract We discuss the polygonisation and rendering of implicit surfaces through the adaptive subdivision of octree nodes. Three new algorithms which form part of this process, are discussed. The first algorithm removes the cracks that form on the surfaces between adjacent nodes that are subdivided to different depths in the octree.
Balsys, Ronald J. +1 more
openaire +1 more source
The Visual Computer, 2004
Algorithms for trimming implicit surfaces yielding surface sheets and stripes are presented. These two-dimensional manifolds with boundaries result from set-theoretic operations on an implicit surface and a solid or another implicit surface. The algorithms generate adaptive polygonal approximation of the trimmed surfaces by extending our original ...
Galina Pasko, Alexander A. Pasko
openaire +1 more source
Algorithms for trimming implicit surfaces yielding surface sheets and stripes are presented. These two-dimensional manifolds with boundaries result from set-theoretic operations on an implicit surface and a solid or another implicit surface. The algorithms generate adaptive polygonal approximation of the trimmed surfaces by extending our original ...
Galina Pasko, Alexander A. Pasko
openaire +1 more source
The implicit equation of a canal surface
Journal of Symbolic Computation, 2009 A canal surface is an envelope of a one parameter family of spheres. In this paper we present an efficient algorithm for computing the implicit equation of a canal surface generated by a rational family of spheres. By using Laguerre and Lie geometries, we relate the equation of the canal surface to the equation of a dual variety of a certain curve in 5-
Dohm, Marc, Zube, Severinas
exaly +4 more sources
On the velocity of an implicit surface
ACM Transactions on Graphics, 2011In this article we derive an equation for the velocity of an arbitrary time-evolving implicit surface. Strictly speaking, only the normal component of the velocity is unambiguously defined. This is because an implicit surface does not have a unique parametrization.
Jos Stam, Ryan M. Schmidt
openaire +1 more source
Field functions for implicit surfaces
The Visual Computer, 1988A technique of building 3D models from an iso-surface in a scalar field is discussed. One of the characteristics of this method - referred as the soft object of implicit surface method - is that a few primitives blend to form a complex surface. The shape of these primitives is given by a field function.
Brian Wyvill, Geoff Wyvill
openaire +2 more sources
Adaptive polygonization of implicit surfaces
Computers & Graphics, 2005We present an algorithm for polygonizing closed implicit surfaces, which produces meshes adapted to the local curvature of the surface. Our method is similar to, but not based on, Marching Triangles, in that we start from a point on the surface and develop a mesh from that point using a surface-tracking approach. However, our approach works by managing
Bruno Rodrigues De Araújo +1 more
openaire +1 more source
Polygonization of implicit surfaces
Computer Aided Geometric Design, 1988The paper presents a computational technique for approximation of an implicit surface \(f(P)=0\), \(P\in {\mathbb{R}}^ 3\), with a polygonal representation. The function f is adaptively sampled surrounding it by a spatial partitioning. The technique proposed allows to deal with functions f characterized by great complexity. A number of test examples is
openaire +1 more source