𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A simple quality triangulation algorithm for complex geometries

✍ Scribed by Yaoxin Zhang; Yafei Jia; H. C. Chan; Sam S. Y. Wang

Publisher
John Wiley and Sons
Year
2010
Tongue
English
Weight
642 KB
Volume
66
Category
Article
ISSN
0271-2091

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

UNSTRUCTURED GRID GENERATION AND A SIMPL
UNSTRUCTURED GRID GENERATION AND A SIMPLE TRIANGULATION ALGORITHM FOR ARBITRARY 2-D GEOMETRIES USING OBJECT ORIENTED PROGRAMMING
✍ B. K. KARAMETE; T. TOKDEMΔ°R; M. GER πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 413 KB πŸ‘ 3 views

This paper describes the logic of a dynamic algorithm for a general 2D Delaunay triangulation of arbitrarily prescribed interior and boundary nodes. The complexity of the geometry is completely arbitrary. The scheme is free of specific restrictions on the input of the geometrical data. The scheme ge

A Simple Linear Time Algorithm for Trian
A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs
✍ H. Bodlaender; T. Kloks πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 560 KB

In this paper we consider the problem of determining whether a given colored graph can be triangulated, such that no edges between vertices of the same color are added. This problem originated from the perfect phylogeny problem from molecular biology and is strongly related with the problem of recog

A Better Triangulation for Wright's 2n-R
A Better Triangulation for Wright's 2n-Ray Algorithm
✍ Chuangyin Dang; Dolf Talman πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 216 KB

We give a triangulation for Wright's 2 n -ray algorithm to compute solutions of nonlinear equations. According to measures of efficiency of triangulations, it is better than any other available triangulation for the 2 n -ray algorithm.

A Fast Poisson Solver for Complex Geomet
A Fast Poisson Solver for Complex Geometries
✍ A. McKenney; L. Greengard; A. Mayo πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 311 KB

Robust fast solvers for the Poisson equation have generally been limited to regular geometries, where direct methods, based on Fourier analysis or cyclic reduction, and multigrid methods can be used. While multigrid methods can be applied in irregular domains land to a broader class of partial diffe