Results 321 to 330 of about 661,831 (374)
Some of the next articles are maybe not open access.
Texture growing on triangle mesh
ISSCS 2011 - International Symposium on Signals, Circuits and Systems, 2011Computer graphics applications often use textures to decorate virtual objects without modeling geometric details. These textures can be seamlessly generated from sample textures using texture synthesis algorithms. However, most existing texture synthesis algorithms are designed for rectangular domains and cannot be easily extended to general surfaces ...
Paul Bao, Xiaoho Ma
openaire +1 more source
Distributed Triangle Mesh Processing
2014We propose a web-based system to remotely and distributedly process triangle meshes. Users can implement complex geometric procedures by composing simpler processing tools that, in their turn, can be provided by researchers who publish them as appropriateWeb services.
D Cabiddu, M Attene
openaire +5 more sources
Incremental subdivision for triangle meshes
International Journal of Computational Science and Engineering, 2007We introduce incremental subdivision as a new adaptive subdivision method for triangle meshes. While regular (global) subdivisions produce a smooth surface from a given polygon mesh by refining all of its faces, adaptive subdivision produces a surface by refining only some selected areas of the mesh.
Hamid Reza Pakdel, Faramarz F. Samavati
openaire +1 more source
Conformal equivalence of triangle meshes
ACM Transactions on Graphics, 2008We present a new algorithm for conformal mesh parameterization. It is based on a precise notion of discrete conformal equivalence for triangle meshes which mimics the notion of conformal equivalence for smooth surfaces.
Springborn, Boris +2 more
openaire +3 more sources
NON-RIGID SPECTRAL CORRESPONDENCE OF TRIANGLE MESHES
International Journal of Shape Modeling, 2007Summary: We present an algorithm for finding a meaningful vertex-to-vertex correspondence between two triangle meshes, which is designed to handle general non-rigid transformations. Our algorithm operates on embeddings of the two shapes in the spectral domain so as to normalize them with respect to uniform scaling and rigid-body transformation.
Jain, Varun +2 more
openaire +1 more source
Triangle Mesh Generation: Delaunay Triangulation
2012In this chapter, the generation of triangle meshes from points is illustrated via the Delaunay triangulation. Apart from Delaunay triangulation being the most common triangulation method, the aim is also to give an overview of the typical issues of point triangulation in general.
Jakob Andreas Bærentzen +3 more
openaire +1 more source
Refinement operators for triangle meshes
Computer Aided Geometric Design, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Simplifying and Optimizing Triangle Meshes
2012Smoothing is only one of the processes we generally have to apply to acquired geometry. This chapter discusses several other important algorithms connected by virtue of being simple greedy processes where we improve the mesh by local changes to the mesh connectivity.
Jakob Andreas Bærentzen +3 more
openaire +1 more source
An optimal algorithm for 3D triangle mesh slicing
Comput. Aided Des., 2017R. Minetto +4 more
semanticscholar +1 more source
Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator
Workshop on Applied Computational Geometry, 1996J. Shewchuk
semanticscholar +1 more source