Results 271 to 280 of about 2,438,793 (304)

An Efficient Method to Mesh Point Cloud

2006 10th International Conference on Computer Supported Cooperative Work in Design, 2006
This paper presents a new Reverse Engineering method for creating 3D mesh models, which approximate an unorganized noisy point set without orientation information. The new method computes sample points by the extended moving least squares method in adaptive octree cell. The octree subdivision is decided by weighted covariance matrix.
Guiping Qian, Ruofeng Tong 0001, Wen Peng, Jinxiang Dong   +3 more
openaire   +1 more source

Efficient list ranking on the reconfigurable mesh, with applications

Theory of Computing Systems, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tatsuya Hayashi, Koji Nakano, Stephan Olariu   +2 more
openaire   +1 more source

Binary Mesh Partitioning for Cache-Efficient Visualization

IEEE Transactions on Visualization and Computer Graphics, 2010
One important bottleneck when visualizing large data sets is the data transfer between processor and memory. Cache-aware (CA) and cache-oblivious (CO) algorithms take into consideration the memory hierarchy to design cache efficient algorithms. CO approaches have the advantage to adapt to unknown and varying memory hierarchies.
Tchiboukdjian, Marc, Danjean, Vincent, Raffin, Bruno   +2 more
openaire   +3 more sources

Exact and Efficient Mesh‐Kernel Generation

Computer Graphics Forum
AbstractThe mesh kernel for a star‐shaped mesh is a convex polyhedron given by the intersection of all half‐spaces defined by the faces of the input mesh. For all non‐star‐shaped meshes, the kernel is empty. We present a method to robustly and efficiently compute the kernel of an input triangle mesh by using exact plane‐based integer arithmetic to ...
Julius Nehring-Wirxel, P. Kern, Philip Trettner, Leif Kobbelt   +3 more
openaire   +1 more source

An Efficient Mesh Simplification Algorithm

2009 Fourth International Conference on Internet Computing for Science and Engineering, 2009
This paper presents a new mesh simplification algorithm based on edge collapse, it combines surface curvature and quadric error metric, the position of a new vertex for edge collapse depends on multiple-weighted approach. The new algorithm can improve simplification rationality in procedure and preserve important features after simplification.
Hailing Wang, Guisheng Yin, Jing Zhang, Decai Wang, Jian Wang   +4 more
openaire   +1 more source

Shape approximation for efficient progressive mesh compression

2010 IEEE International Conference on Image Processing, 2010
This paper introduces an original multi-resolution 3D mesh compression technique, called Shape Approximation-based Progressive Mesh (SAPM). The proposed approach losslessly compresses the mesh connectivity and exploits it in order to build a smooth approximation of the original mesh.
Khaled Mamou, Christophe Dehais, Faten Chaieb, Faouzi Ghorbel   +3 more
openaire   +1 more source

Efficient algorithms for parallel sorting on mesh multicomputers

International Journal of Parallel Programming, 1991
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vineet Singh, Vipin Kumar 0001, Gul Agha, Chris Tomlinson   +3 more
openaire   +2 more sources

An efficient scaling-simulation algorithm of reconfigurable meshes by meshes with partitioned buses

Proceedings International Parallel and Distributed Processing Symposium, 2004
This paper presents an efficient scaling-simulation algorithm that simulates operations of the reconfigurable mesh (RM) of size n /spl times/ n using the mesh with partitioned buses (MPB) of size m /spl times/ m (m < n). The RM and the MPB are the two-dimensional mesh-connected computers equipped with broadcasting buses.
openaire   +1 more source

Efficient List Ranking Algorithms on Reconfigurable Mesh

2000
List ranking is one of the fundamental techniques in parallel algorithm design. Hayashi, Nakano, and Olariu proposed a deterministic list ranking algorithm that runs in O(log* n) time and a randomized one that runs in O(1) expected time, both on a reconfigurable mesh of size n×n.
Sung-Ryul Kim, Kunsoo Park
openaire   +1 more source

Mesh Spacing Estimates and Efficiency Considerations for Moving Mesh Systems

Numerical Mathematics: Theory, Methods and Applications, 2016
Adaptive numerical methods for solving partial differential equations (PDEs) that control the movement of grid points are called moving mesh methods. In this paper, these methods are examined in the case where a separate PDE, that depends on a monitor function, controls the behavior of the mesh.
openaire   +1 more source