Results 231 to 240 of about 79,010 (265)
Some of the next articles are maybe not open access.

Mesh Optimization for Polygonized Isosurfaces

Computer Graphics Forum, 2001
In this paper, we propose a method for improvement of isosurface polygonizations. Given an initial polygonization of an isosurface, we introduce a mesh evolution process initialized by the polygonization. The evolving mesh converges quickly to its limit mesh which provides with a high quality approximation of the isosurface even if the isosurface has ...
Yutaka Ohtake, Alexander G. Belyaev
openaire   +1 more source

Streaming tetrahedral mesh optimization

Proceedings of the 2008 ACM symposium on Solid and physical modeling, 2008
Improving the quality of tetrahedral meshes is an important operation in many scientific computing applications. Meshes with badly shaped elements impact both the accuracy and convergence of scientific applications. State-of-the-art mesh improvement techniques rely on sophisticated numerical optimization methods such as feasible Newton or conjugate ...
Tian Xia, Eric Shaffer
openaire   +1 more source

Constrained mesh optimization on boundary

Engineering With Computers, 2008
This paper presents a new mesh optimization approach aiming to improve the mesh quality on the boundary. The existing mesh untangling and smoothing algorithms (Vachal et al. in J Comput Phys 196: 627–644, 2004; Knupp in J Numer Methods Eng 48: 1165–1185, 2002), which have been proved to work well to interior mesh optimization, are enhanced by adding ...
Jun Yin, Cristian Teodosiu
exaly   +2 more sources

Untangling polygonal and polyhedral meshes via mesh optimization

Engineering with Computers, 2014
We propose simple and efficient optimization-based untangling strategies for 2D polygonal and 3D polyhedral meshes. The first approach uses a size-based mesh metric, which eliminates inverted elements by averaging element size over the entire mesh.
Jibum Kim, Jaeyong Chung
openaire   +1 more source

An optimal multiplication algorithm for reconfigurable mesh

[1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing, 1997
An O(1) time algorithm to multiply two K-bit binary numbers using an N/spl times/N bit-model of reconfigurable mesh is shown. It uses optimal mesh size and it improves previously known results for multiplication on the reconfigurable mesh. The result is obtained by using novel techniques for data representation and data movement and using ...
Ju-wook Jang   +2 more
openaire   +1 more source

Optimal pattern matching on meshes

1994
Parallel pattern matching on a mesh-connected array of processors is considered. The problem is to find all occurrences of a pattern in a text. The input text is a string of n symbols placed in a √n×√n mesh, each processor storing one symbol. The pattern is stored similarly in a contiguous portion of the mesh. An algorithm solving the problem in time O(
Bogdan S. Chlebus, Leszek Gasieniec
openaire   +1 more source

An optimal sorting algorithm on reconfigurable mesh

Proceedings Sixth International Parallel Processing Symposium, 1995
Abstract This paper shows nontrivial ways to use the Reconfigurable Mesh to solve several basic arithmetic problems in constant time. These solutions are obtained by novel ways to represent numbers and by exploiting the reconfigurability of the architecture.
Ju-wook Jang, Viktor K. Prasanna
openaire   +1 more source

Discrete Mesh Optimization on GPU

2019
We present an algorithm called discrete mesh optimization (DMO), a greedy approach to topology-consistent mesh quality improvement. The method requires a quality metric for all element types that appear in a given mesh. It is easily adaptable to any mesh and metric as it does not rely on differentiable functions.
Daniel Zint, Roberto Grosso
openaire   +1 more source

Variable mesh optimization for continuous optimization problems

Soft Computing, 2011
Population-based meta-heuristics are algorithms that can obtain very good results for complex continuous optimization problems in a reduced amount of time. These search algorithms use a population of solutions to maintain an acceptable diversity level during the process, thus their correct distribution is crucial for the search. This paper introduces a
Amilkar Puris   +3 more
openaire   +1 more source

Streaming Mesh Optimization for CAD

2008
Computational simulation of physical phenomena plays a central role in many important applications, including scientific visualization and the generation visual effects for entertainment. Typically, these simulations rely on high-quality meshes to model physical objects.
Tian Xia, Eric Shaffer
openaire   +1 more source

Home - About - Disclaimer - Privacy