Results 301 to 310 of about 38,901 (314)
Some of the next articles are maybe not open access.
Refinement operators for triangle meshes
Computer Aided Geometric Design, 2002Refinement 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), 2006This 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
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.
François Anton +3 more
openaire +2 more sources
Adaptive Quadrangular Segmentation of Triangle Meshes
Applied Mechanics and Materials, 2007A 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
2014We 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
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
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
Single Chart Parameterization of Triangle Meshes
2008The importance of surface parameterization in the field of Computer Graphics is well understood. Many important applications rely on the construction of a high quality mapping from the 3D surface to a flat domain: texture mapping [1], detail recovering of simplified models [3] and surface re-meshing are the most important and common examples. The first
FABIO ROSSI, BERGAMASCO, Massimo
openaire +3 more sources
A survey of methods for recovering quadrics in triangle meshes
ACM Computing Surveys, 2002In a variety of practical situations such as reverse engineering of boundary representation from depth maps of scanned objects, range data analysis, model-based recognition and algebraic surface design, there is a need to recover the shape of visible surfaces of a dense 3D point set. In particular, it is desirable to identify and fit simple surfaces of
openaire +3 more sources
2012
This bachalor work is focused on a compression of triangle mesh problematics. It is started with analysis and trying to find a suitable solution for the Morphome3cs project. This paper is connected to the program I created as an Individual Project and Software Praxis.
openaire +2 more sources
This bachalor work is focused on a compression of triangle mesh problematics. It is started with analysis and trying to find a suitable solution for the Morphome3cs project. This paper is connected to the program I created as an Individual Project and Software Praxis.
openaire +2 more sources
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.
Henrik Aanæs +3 more
openaire +2 more sources