Javamesh

MESHING
RESEARCH
CORNER

MESH/GRID
GENERATION
SOFTWARE
SURVEY

Contact: Steven Lin

Email: steven@leetide.net

Web Site:

Availability: Research Code, Source Code Available

Customer Support: No

Approximate Number of Users: unknown

Pricing: Free

Platform:

Java interpreter required

Input: Native

boundary facets by drawing directly

Engineering Discipline:

Anyone who owns a browser, since it's an applet within a web page.

Elements: Triangle

Surface Meshing: No

Tri/Tet Method: Delaunay

Element Sizing Method: Manual

Users need to Input the area and angle critiral for mesh generation

Other Features:

Comments:

The codes are compiled as stand alone programs as well as an JAVA applet that can be run through a Web browser on the Internet. The goals are to develop a cross-platform visual instructional tool, which can be used for teaching, research and practical applications. The Java code was written from scratch for this study. The algorithm adopted followed closely that presented by Shewchuk (1996) which incorporated Ruppert's Delaunay Refinement algorithm. The core of the algorithm consists of Delaunay triangulation and constrained Delaunay triangulation. This study once again demonstrates that the algorithm is rigorous, memory-efficient, and robust. It also generates guaranteed-quality meshes, which have no small angles.