The Experts below are selected from a list of 300 Experts worldwide ranked by ideXlab platform
Alexander Pasko - One of the best experts on this subject based on the ideXlab platform.
-
Dynamic Meshes for Accurate Polygonization of Isosurfaces with Sharp Features
2014Co-Authors: Yutaka Ohtake, Alexander Belyaev, Alexander PaskoAbstract:The paper presents a novel approach for accurate Polygonization of isosurfaces with sharp features. The approach is based on mesh evolution towards a given isosurface with simultaneous control of the mesh vertex positions and mesh normals.
-
Trimming implicit surfaces
The Visual Computer, 2004Co-Authors: Galina Pasko, Alexander PaskoAbstract: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 implicit surface Polygonization algorithm. The presented applications include modeling several spiral shaped surface sheets and stripes (based on M. Escher’s artworks) and extraction of ridges on implicit surfaces. Another promising application of the presented algorithms is modeling heterogeneous objects as implicit complexes.
-
dynamic meshes for accurate Polygonization of implicit surfaces with sharp features
International Conference on Shape Modeling and Applications, 2001Co-Authors: Yutaka Ohtake, Alexander Belyaev, Alexander PaskoAbstract:The paper presents a novel approach for accurate Polygonization of implicit surfaces with sharp features. The approach is based on mesh evolution towards a given implicit surface with simultaneous control of the mesh vertex positions and mesh normals.
-
on escher s spirals Polygonization of 2 manifolds with boundaries
1998Co-Authors: Alexander PaskoAbstract:An algorithm of Polygonization of trimmed implicit surfaces yielding surface sheets is presented. These twodimensional manifolds with boundaries result from the set-theoretic difference of an implicit surface and a solid. The algorithm generates the polygonal approximation of the trimmed surface with the mesh adaptation to the manifold boundary.
Judy M. Vance - One of the best experts on this subject based on the ideXlab platform.
-
A MESH REDUCTION APPROACH TO PARAMETRIC SURFACE Polygonization
2016Co-Authors: Asif M. Khan, Judy M. Vance, I I &aposAbstract:Surface Polygonization is the process by which a representative· polygonal mesh of a surface is constructed for rendering or analysis purposes. This work presents a new surface Polygonization algo-rithm specifically tailored to be applied to a large class of models which are created with parametric surfaces. This method has partic-ular application in the area of building virtual environments from computer-aided-design (CAD) models. The algorithm is based on an edge reduction scheme that collapses two vertices of a given polygon edge onto one new vertex. A two step approach is imple-mented consisting of boundary edge reduction followed by interior edge reduction. A maximin optimization is used to determine the location of the new vertex. The concept of a visible region as the lo-cation space of the new vertex is introduced. The method presented here differs from existing methods in tha
-
a mesh reduction approach to parametric surface Polygonization
Design Automation Conference, 1995Co-Authors: Asif M. Khan, Judy M. VanceAbstract:Surface Polygonization is the process by which a representative· polygonal mesh of a surface is constructed for rendering or analysis purposes. This work presents a new surface Polygonization algo rithm specifically tailored to be applied to a large class of models which are created with parametric surfaces. This method has partic ular application in the area of building virtual environments from computer-aided-design (CAD) models. The algorithm is based on an edge reduction scheme that collapses two vertices of a given polygon edge onto one new vertex. A two step approach is imple mented consisting of boundary edge reduction followed by interior edge reduction. A maximin optimization is used to determine the location of the new vertex. The concept of a visible region as the lo cation space of the new vertex is introduced. The method presented here differs from existing methods in that it takes advantage of the fact that for many models, the exact sur face representation of the model is known -before the polygoniza tion is attempted. Because the precise surface definition is known, a maximin optimization procedure, that uses the surface informa tion, can be used to locate the new vertex. The algorithm attempts to overcome the deficiencies in existing techniques while minimiz ing the number of polygons required to represent a surface and still maintaining surface integrity in the rendered model. This paper pre sents the algorithm and testing results.
Asif M. Khan - One of the best experts on this subject based on the ideXlab platform.
-
A MESH REDUCTION APPROACH TO PARAMETRIC SURFACE Polygonization
2016Co-Authors: Asif M. Khan, Judy M. Vance, I I &aposAbstract:Surface Polygonization is the process by which a representative· polygonal mesh of a surface is constructed for rendering or analysis purposes. This work presents a new surface Polygonization algo-rithm specifically tailored to be applied to a large class of models which are created with parametric surfaces. This method has partic-ular application in the area of building virtual environments from computer-aided-design (CAD) models. The algorithm is based on an edge reduction scheme that collapses two vertices of a given polygon edge onto one new vertex. A two step approach is imple-mented consisting of boundary edge reduction followed by interior edge reduction. A maximin optimization is used to determine the location of the new vertex. The concept of a visible region as the lo-cation space of the new vertex is introduced. The method presented here differs from existing methods in tha
-
a mesh reduction approach to parametric surface Polygonization
Design Automation Conference, 1995Co-Authors: Asif M. Khan, Judy M. VanceAbstract:Surface Polygonization is the process by which a representative· polygonal mesh of a surface is constructed for rendering or analysis purposes. This work presents a new surface Polygonization algo rithm specifically tailored to be applied to a large class of models which are created with parametric surfaces. This method has partic ular application in the area of building virtual environments from computer-aided-design (CAD) models. The algorithm is based on an edge reduction scheme that collapses two vertices of a given polygon edge onto one new vertex. A two step approach is imple mented consisting of boundary edge reduction followed by interior edge reduction. A maximin optimization is used to determine the location of the new vertex. The concept of a visible region as the lo cation space of the new vertex is introduced. The method presented here differs from existing methods in that it takes advantage of the fact that for many models, the exact sur face representation of the model is known -before the polygoniza tion is attempted. Because the precise surface definition is known, a maximin optimization procedure, that uses the surface informa tion, can be used to locate the new vertex. The algorithm attempts to overcome the deficiencies in existing techniques while minimiz ing the number of polygons required to represent a surface and still maintaining surface integrity in the rendered model. This paper pre sents the algorithm and testing results.
Yutaka Ohtake - One of the best experts on this subject based on the ideXlab platform.
-
Dynamic Meshes for Accurate Polygonization of Isosurfaces with Sharp Features
2014Co-Authors: Yutaka Ohtake, Alexander Belyaev, Alexander PaskoAbstract:The paper presents a novel approach for accurate Polygonization of isosurfaces with sharp features. The approach is based on mesh evolution towards a given isosurface with simultaneous control of the mesh vertex positions and mesh normals.
-
dynamic meshes for accurate Polygonization of implicit surfaces with sharp features
International Conference on Shape Modeling and Applications, 2001Co-Authors: Yutaka Ohtake, Alexander Belyaev, Alexander PaskoAbstract:The paper presents a novel approach for accurate Polygonization of implicit surfaces with sharp features. The approach is based on mesh evolution towards a given implicit surface with simultaneous control of the mesh vertex positions and mesh normals.
Václav Skala - One of the best experts on this subject based on the ideXlab platform.
-
Space Subdivision for the Adaptive Edge Spinning Polygonization
2015Co-Authors: Martin Cermak, Václav SkalaAbstract:Abstract:- This paper presents a speed-up of the adaptive approach for Polygonization of implicit surfaces. The original algorithm generates well-shaped triangular mesh with respect to a given approximation error. Our modification accelerates the method significantly and therefore, use for more complex object is much easier now. The algorithm is based on the surface tracking scheme and its most time consuming part is accelerated by the space subdivision technique. Our approach is compared with the original regarding to speed and to quality of polygonal mesh generated as well. Key-Words:- Polygonization, edge spinning, acceleration, space subdivision, implicit surface
-
Polygonization of implicit surfaces with sharp features by edge-spinning
The Visual Computer, 2005Co-Authors: Martin Čermák, Václav SkalaAbstract:This paper presents an adaptive approach for Polygonization of implicit surfaces. The algorithm generates a well-shaped triangular mesh with respect to a given approximation error. The error is proportional to a local surface curvature estimation. Polygonization of surfaces of high curvature, as well as surfaces with sharp features, is possible using a simple technique combined with a particle system approach. The algorithm is based on a surface tracking scheme, and it is compared with other algorithms based on a similar principle, such as the marching cube and the marching triangle algorithms.
-
curvature dependent Polygonization by the edge spinning
International Conference on Computational Science and Its Applications, 2004Co-Authors: Martin Cermak, Václav SkalaAbstract:An adaptive method for Polygonization of implicit surfaces is presented. The method insists on the shape of triangles and the accuracy of resulting approximation as well. The presented algorithm is based on the surface tracking scheme and it is compared with the other algorithms based on the similar principle, such as the Marching cubes and the Marching triangles methods. The main advantages of the triangulation presented are simplicity and the stable features that can be used for next expanding.