Results 301 to 310 of about 110,431 (318)

Compressing Multiresolution Triangle Meshes

2001
In this paper, we consider triangle-based two-dimensional multiresolution complexes, called Multi-Triangulations (MTs), constructed based on a vertex-removal simplification strategy, which is the most common strategy used to build simplified representations of surfaces, e.g., terrains.
DANOVARO, EMANUELE, DE FLORIANI, LEILA, MAGILLO, PAOLA, PUPPO, ENRICO   +3 more
openaire   +3 more sources

Gradient Field Estimation on Triangle Meshes

2018
96
MANCINELLI, CLAUDIO, Marco Livesu, Enrico Puppo   +2 more
openaire   +5 more sources

Texture growing on triangle mesh

ISSCS 2011 - International Symposium on Signals, Circuits and Systems, 2011
Computer 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   +2 more sources

Incremental subdivision for triangle meshes

International Journal of Computational Science and Engineering, 2007
We 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.
Faramarz Samavati, Hamid-Reza Pakdel
openaire   +2 more sources

Refinement operators for triangle meshes

Computer Aided Geometric Design, 2002
Refinement operators for triangular meshes as used in subdivision schemes or remeshing are discussed. A numbering scheme is presented, covering all refinement operators that (topologically) map vertices onto vertices. Using this characterization, some special properties of n-adic and √3-subdivision are easy to see.
openaire   +2 more sources

Fast processing of triangle meshes using triangle fans

International Conference on Shape Modeling and Applications 2005 (SMI' 05), 2006
This paper presents a technique for decomposing a triangulated model into a set of triangle fans. We show that the triangle fan representation improves the performance of several fundamental geometric algorithms operating over triangle meshes. We present two accelerated algorithms, one for computing the nearest intersection between a ray and a fan of ...
Eric Galin, Samir Akkouche
openaire   +1 more source

Simplifying and Optimizing Triangle Meshes

2012
Smoothing 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.
François Anton, Jens Gravesen, Jakob Andreas Bærentzen, Henrik Aanæs   +3 more
openaire   +2 more sources

Adaptive Quadrangular Segmentation of Triangle Meshes

Applied Mechanics and Materials, 2007
A heuristic approach was presented to automatically partition a triangle meshes into a coarse quadrangular segmentation. The triangle mesh was firstly partitioned into a polygonal segmentation which will further be split into triangular and quadrangular patches.
Shu Dong Xiu, Yang Wang, Han Ming Lv
openaire   +2 more sources

Distributed Triangle Mesh Processing

2014
We propose a web-based system to remotely and distributedly process triangle meshes. Users can im- plement complex geometric procedures by composing simpler processing tools that, in their turn, can be provided by researchers who publish them as appropriate Web services.
D Cabiddu, M Attene
openaire   +5 more sources

Triangle Mesh Compression

1998
A novel algorithm for the encoding of orientable manifold triangle mesh geometry is presented. Mesh connectivity is encoded in a lossless manner. Vertex coordinate data is uniformly quantized and then losslessly encoded. The compression ratios achieved by the algorithm are shown to be significantly better than those of currently available algorithms ...
Touma, Costa, Gotsman, Craig
openaire   +1 more source