Results 171 to 180 of about 4,217 (188)
Some of the next articles are maybe not open access.
Robust watermarking of polygonal meshes
Proceedings Geometric Modeling and Processing 2000. Theory and Applications, 2000This paper presents two variations of a robust watermarking method for general polygonal meshes of arbitrary topology which can be used for copyright protection, tamper proofing or content annotation purposes. The proposed watermark is immune to translation, rotation, scaling or affine transformation of the mesh and is hard to detect unless the exact ...
openaire +2 more sources
2005
Publisher Summary This chapter describes the process to query, create, and edit meshes, to access the various mesh components and data using both Maya Embedded Language (MEL) and the C++ Application Programming Interface (API). A mesh contains components—namely, vertices, edges, and faces.
openaire +2 more sources
Publisher Summary This chapter describes the process to query, create, and edit meshes, to access the various mesh components and data using both Maya Embedded Language (MEL) and the C++ Application Programming Interface (API). A mesh contains components—namely, vertices, edges, and faces.
openaire +2 more sources
A lightweight approach to repairing digitized polygon meshes [PDF]
The Visual Computer, 2010 When designing novel algorithms for geometric processing and analysis, researchers often assume that the input conforms to several requirements. On the other hand, polygon meshes obtained from acquisition of real-world objects typically exhibit several defects, and thus are not appropriate for a widespread exploitation.
openaire +3 more sources
Topological analysis of polygon meshes
Computer-Aided Design, 1983Abstract A mesh of quasidisjoint polygons is a useful representation of a surface for many applications of computer graphics and CAD. We present an algorithm that calculates the following information for an arbitrary orientable mesh: • • the number of connected components of the mesh • • for each component whether it is closed or not ...
openaire +2 more sources
Out-of-Core Remeshing of Large Polygonal Meshes
IEEE Transactions on Visualization and Computer Graphics, 2006We propose an out-of-core method for creating semi-regular surface representations from large input surface meshes. Our approach is based on a streaming implementation of the MAPS remesher of Lee et al. [18]. Our remeshing procedure consists of two stages. First, a simplification process is used to obtain the base domain.
Ahn, M, Guskov, I, Lee, S
openaire +4 more sources
Untangling polygonal and polyhedral meshes via mesh optimization
Engineering with Computers, 2014We propose simple and efficient optimization-based untangling strategies for 2D polygonal and 3D polyhedral meshes. The first approach uses a size-based mesh metric, which eliminates inverted elements by averaging element size over the entire mesh.
Jaeyong Chung, Jibum Kim
openaire +1 more source
A novel mesh saliency approximation for polygonal mesh segmentation
Multimedia Tools and Applications, 2017To assist a great variety of applications including object recognition or shape matching, 3D scene analysis, view point selection, mesh simplification, segmentation, and 3D printing etc., the approximation of mesh or part saliency has been intensively studied in recent years.
Hung-Kuang Chen, Mu-Wei Li
openaire +2 more sources
Fracture generation on polygonal meshes using Voronoi polygons
ACM SIGGRAPH 2002 conference abstracts and applications, 2002This sketch describes a way of generating realistic cracks and fragments to visually simulate brittle fracture on polygonal surfaces.
openaire +1 more source
Decomposing polygon meshes for interactive applications
Proceedings of the 2001 symposium on Interactive 3D graphics, 2001This paper discusses an efficient and effective framework to decompose polygon meshes into components. This is useful in various interactive graphics applications, such as, mesh editing, establishing correspondence between objects for morphing, computation of bounding volume hierarchy for collision detection and ray tracing. In this paper, we formalize
Tong Wing Woon +3 more
openaire +2 more sources
Accurate collision response on polygonal meshes
Proceedings Computer Animation 2000, 2002We present a very general geometrical correction method for enforcing collisions and other geometrical constraints between polygonal mesh surfaces. It is based on a global resolution scheme that takes advantage of an efficient use of the conjugate gradient algorithm to find the appropriate displacement of the mesh vertices that would satisfy all the ...
N.M. Thalmann, P. Volino
openaire +2 more sources