Results 251 to 260 of about 644,615 (299)
Some of the next articles are maybe not open access.
FPGAs with multidimensional mesh topology
Proceedings of the 2006 ACM/SIGDA 14th international symposium on Field programmable gate arrays, 2006In a traditional 2-D field-programmable gate array (FPGA), the number of routing switches increases as the number of logic gates increases, and thereby causes a decrease in the logic density. DeHon et al. demonstrated that a tree-based FPGA they proposed resolves this problem and requires only a constant number ofswitches per gate without any relation ...
Yohei Matsumoto +2 more
openaire +2 more sources
Mesh metamorphosis with topology transformations
10th Pacific Conference on Computer Graphics and Applications, 2002. Proceedings., 20033D mesh morphing based on a metamesh has fundamental limitations of complicated in-between meshes and no topology (connectivity) changes in a metamorphosis. This paper presents a novel approach for 3D mesh morphing, which is not based on a metamesh. The approach simultaneously interpolates the topology and geometry of input meshes.
Minsu Ahn, Seungyong Lee 0001
openaire +2 more sources
Approximate topological matching of quad meshes
The Visual Computer, 2009In this paper, we study the problem of approximate topological matching for quadrilateral meshes, that is, the problem of finding as large a set as possible of matching portions of two quadrilateral meshes. This study is motivated by applications in graphics that involve the modeling of different shapes that have results needing to be merged in order ...
David Eppstein +3 more
openaire +2 more sources
Topological and geometrical properties of hexahedral meshes
Engineering with Computers, 2009Over the years, there have been a number of practical studies with working definitions of ‘mesh’ as related to computational simulation, however, there are only a few theoretical papers with formal definitions of mesh. Algebraic topology papers are available that define tetrahedral meshes in terms of simplices.
Franck Ledoux, Jason Shepherd
openaire +1 more source
Multipath Dissemination in Regular Mesh Topologies
IEEE Transactions on Parallel and Distributed Systems, 2009Mesh topologies are important for large-scale peer-to-peer systems that use low-power transceivers. The quality of service (QoS) in such systems is known to decrease as the scale increases. We present a scalable approach for dissemination that exploits all the shortest paths between a pair of nodes and improves the QoS. Despite the presence of multiple
Mamidisetty, Kranthi K +3 more
openaire +1 more source
A new network topology with multiple meshes
IEEE Transactions on Computers, 1999This paper introduces a new network topology, called Multi-Mesh (MM), which uses multiple meshes as the basic building blocks interconnected in a suitable manner. The proposed network consists of n/sup 4/ processors and is 4-regular with a diameter of 2n. The network also contains a Hamiltonian cycle.
Debasish Das +2 more
openaire +1 more source
Carving for topology simplification of polygonal meshes
Computer-Aided Design, 2010The topological complexity of polygonal meshes has a large impact on the performance of various geometric processing algorithms, such as rendering and collision detection algorithms. Several approaches for simplifying topology have been discussed in the literature.
Nate Hagbi, Jihad El-Sana
openaire +2 more sources
A Topology Preserved Mesh Simplification Algorithm
2009 WRI World Congress on Computer Science and Information Engineering, 2009These large-volume mesh models face challenge in rendering, storing, and transmission for the further geometrical reconstruction. This paper presents a feature extraction based mesh simplification method to get a topology preserved simple mesh model. Sequence of mesh simplification is controlled on the basis of geometrical feature sensitivity, which ...
Lirong Wang, Jinzhu Li, Ichiro Hagiwara
openaire +1 more source
Re-meshing techniques for topological analysis
Proceedings International Conference on Shape Modeling and Applications, 2002A method for the extraction of the extended Reeb graph (ERG) from a closed 3D triangular mesh is presented. The ERG encodes the relationships among critical points of the height function associated to the mesh, and it can represent isolated as well as degenerate critical points.
Attene M, Biasotti S, Spagnuolo M
openaire +3 more sources
On the Topology and Isotopic Meshing of Plane Algebraic Curves
Journal of Systems Science and Complexity, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kai Jin, Jin-San Cheng
openaire +1 more source