A parallel algorithm based on convexity for the computing of Delaunay tessellation

ISSN： 1017-1398

Source： Numerical Algorithms, Vol.59, Iss.3, 2012-03, pp. : 347-357

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Scheduling algorithm based on evolutionary computing in identical parallel machine production line

By Liu M. Wu C.

Robotics and Computer-Integrated Manufacturing, Vol. 19, Iss. 5, 2003-10 ,pp. : 401-407

Elsevier

Access to resources Recommend Favorite

The Adaptive Delaunay Tessellation: a neighborhood covering meshing technique

By Constantiniu Alexandru

Computational Mechanics, Vol. 42, Iss. 5, 2008-10 ,pp. : 655-669

Springer Publishing Company

Access to resources Recommend Favorite

General Algorithm for Improved Lattice Actions on Parallel Computing Architectures

By Bonnet F.D.R. Leinweber D.B. Williams A.G.

Journal of Computational Physics, Vol. 170, Iss. 1, 2001-06 ,pp. : 1-17

Academic Press

Access to resources Recommend Favorite

Parallel Algorithm for Unconstrained Optimization Based on Decomposition Techniques

By Conforti D. Musmanno R.

Journal of Optimization Theory and Applications, Vol. 95, Iss. 3, 1997-12 ,pp. : 531-544

Springer Publishing Company

Access to resources Recommend Favorite

An Advancing Front Delaunay Triangulation Algorithm Designed for Robustness

By Mavriplis D.J.

Journal of Computational Physics, Vol. 117, Iss. 1, 1995-03 ,pp. : 90-101

Academic Press

Access to resources Recommend Favorite