Results 181 to 188 of about 4,217 (188)
Some of the next articles are maybe not open access.

Feature-sensitive parameterization of polygonal meshes

Applied Mathematics and Computation, 2009
This paper investigates a parameterization method for polygonal meshes which is able to improve map distortion exploiting local curvature of the surface mesh. Parametrization is an important tool in geometric modelling and computer graphics applications such as, for example, texture mapping, shape morphing, and remeshing.
openaire   +3 more sources

Polygon Inflation for Animated Models: a Method for the Extrusion of Arbitrary Polygon Meshes

The Journal of Visualization and Computer Animation, 1997
A method for the extrusion of arbitrary polygon meshes is introduced. This method can be applied to model a large class of complex 3-D closed surfaces. It consists of defining a (typically small) set of connected polygons in 3-D that form a skeleton of the final object, and assigning extrusion distances to all polygons.
Brian Wyvill, C. W. A. M. van Overveld
openaire   +3 more sources

A Perceptual Data Repository for Polygonal Meshes

2009 Second International Conference in Visualisation, 2009
A repository containing perceived quality data for polygonal meshes, obtained through observer studies, is presented. It includes information regarding the experimental methodology, protocol and models used, with the purpose of allowing researchers to use it, e.g., for a faster preliminary assessment of their perceived quality metrics without the ...
Beatriz Sousa Santos   +3 more
openaire   +2 more sources

MDS: Quadrilateral Meshes and Polygonal Boundary

2017
The following mesh limitations are always supposed to be satisfied: the mesh consists of strictly convex quadrilaterals. Every mesh element is a convex quadrilateral and the angle between any two sequential edges is strictly less than π, any inner edge has at most one boundary vertex, boundary vertices have valence 2 (a corner vertex ...
Tanya Matskewich, Michel Bercovier
openaire   +2 more sources

fast neighborhood search on polygonal meshes

2011
We introduce a spatial index to support the fast retrieval of large neighborhoods of points on a polygonal mesh. Our spatial index can be computed efficiently off-line, introducing a negligible overhead over a standard indexed data structure. In retrieving neighborhoods of points on-line, we achieve a speed-up of about one order of magnitude with ...
ROCCA, LUIGI   +3 more
openaire   +2 more sources

Shape extraction for a polygon mesh

ACM SIGGRAPH 99 Conference abstracts and applications, 1999
Tong-Wing Woon, Xuetao Li, Tiow-Seng Tan
openaire   +2 more sources

Home - About - Disclaimer - Privacy