Results 281 to 290 of about 758,928 (319)
Some of the next articles are maybe not open access.
Computer Graphics Forum, 1996
AbstractMesh simplification is an important stage after surface reconstruction since the models produced can contain a large number of polygons making them difficult to manipulate. In this paper we present a mesh simplification algorithm to reduce the number of vertices in a dense mesh of triangles.
María-Elena Algorri, Francis Schmitt
openaire +1 more source
AbstractMesh simplification is an important stage after surface reconstruction since the models produced can contain a large number of polygons making them difficult to manipulate. In this paper we present a mesh simplification algorithm to reduce the number of vertices in a dense mesh of triangles.
María-Elena Algorri, Francis Schmitt
openaire +1 more source
Proceedings of the 27th annual conference on Computer graphics and interactive techniques - SIGGRAPH '00, 2000
Normal meshes are new fundamental surface descriptions inspired by differential geometry. A normal mesh is a multiresolution mesh where each level can be written as a normal offset from a coarser version. Hence the mesh can be stored with a single float per vertex.
Guskov, Igor +3 more
openaire +2 more sources
Normal meshes are new fundamental surface descriptions inspired by differential geometry. A normal mesh is a multiresolution mesh where each level can be written as a normal offset from a coarser version. Hence the mesh can be stored with a single float per vertex.
Guskov, Igor +3 more
openaire +2 more sources
1994 International Conference on Parallel Processing Vol. 3, 1994
This article presents new multicasting algorithms for the mesh under the wormhole routing mode and using the read-and-route facility. These new algorithms perform generally faster than the algorithms previously described in the literature under the same model.
Eric Fleury, Pierre Fraigniaud
openaire +1 more source
This article presents new multicasting algorithms for the mesh under the wormhole routing mode and using the read-and-route facility. These new algorithms perform generally faster than the algorithms previously described in the literature under the same model.
Eric Fleury, Pierre Fraigniaud
openaire +1 more source
Computer Graphics Forum, 2012
AbstractThis paper proposes a novel algorithm for colorization of meshes. This is important for applications in which the model needs to be colored by just a handful of colors or when no relevant image exists for texturing the model. For instance, archaeologists argue that the great Roman or Greek statues were full of color in the days of their ...
George Leifman, Ayellet Tal
openaire +1 more source
AbstractThis paper proposes a novel algorithm for colorization of meshes. This is important for applications in which the model needs to be colored by just a handful of colors or when no relevant image exists for texturing the model. For instance, archaeologists argue that the great Roman or Greek statues were full of color in the days of their ...
George Leifman, Ayellet Tal
openaire +1 more source
Digital Mesh: On the Rise of Mesh Computing.
2022The proliferation of connected devices into every corner of the planet gives rise to a world of mesh computing. In this conceptual paper, we analyze the implications of this emerging computing environment for information systems (IS) research. We first discuss how mesh computing can be related to but differs from other views of computing that emerged ...
openaire +2 more sources
Information and Computation, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sabine Broda +4 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sabine Broda +4 more
openaire +1 more source
Mesh Classification With Dilated Mesh Convolutions
2021 IEEE International Conference on Image Processing (ICIP), 2021Vinit Veerendraveer Singh +2 more
openaire +1 more source
Proceedings of the seventeenth annual ACM conference on Computer science : Computing trends in the 1990's Computing trends in the 1990's - CSC '89, 1989
Two dimensional interconnection schemes have some inherent advantages because of their linear area and constant wire-lengths. The nearest-neighbor mesh is such a topology that has enjoyed a widespread acceptance. We investigate a family of bus-based topologies called the doble-lattice-meshes, and propose a variation to improve their properties. We show
openaire +1 more source
Two dimensional interconnection schemes have some inherent advantages because of their linear area and constant wire-lengths. The nearest-neighbor mesh is such a topology that has enjoyed a widespread acceptance. We investigate a family of bus-based topologies called the doble-lattice-meshes, and propose a variation to improve their properties. We show
openaire +1 more source
NekMesh Improvements Towards Mesh AdaptationOver the last year I have focused on slimming down the SpatialDomains Geometry classes to provide a suitable replacement for NekMesh's existing set of separate MeshElement classes. Benchmarking shows significant performance gains from this replacement, particularly in the input/output operations needed for ...
openaire +1 more source
openaire +1 more source