User Tools

Site Tools


viennamesh_-_cgal

This is an old revision of the document!


General

ViennaMesh provides interfaces to a collection of different external libraries and wraps their algorithms for meshing applications. But currently there is no algorithm to generate a mesh based on (3d) image information. CGAL provides such an algorithm which should be integrated in ViennaMesh.

Multiple segments within a mesh are important for scientifc computing, especially for simulation.ViennaMesh wraps CGALs mesh generation algorithm using polyhedral domains but without support for segmentations. An orcale for multi-segment polyhedron domains should be implemented to add support for multi-segment mesh generation using CGALs meshing framework.

Prospective Student

Jovan Stefanovic

Requirements

The student should be familiar with C++ and template programming.

Milestone Tasklist

We envision two milestones, each containing its own list of tasks to be completed to be able to claim the assigned salary.

Milestone 1

  1. Research: Getting familiar with the ViennaMesh meshing library
  2. Research: Getting familiar with CGALs 3D mesh generation
  3. Implementation: Wrap CGALs mesh generation algorithm for 3D images

Milestone 2

  1. Research: Getting familiar with CGALs 3D mesh generation
  2. Implementation: Implement a CGAL orcale for polyhedron domains with support for multiple segments.

Salary

We will pay EUR 1.200 for each successfully finished milestone. This is the equivalent of four 30 hour weeks at a rate of EUR 10/hour.

Additional Information

CGALs algorithm for 3D mesh generation based on images: http://doc.cgal.org/latest/Mesh_3/index.html#title15 CGALs algorithm for 3D mesh generation based polyhedron domains: http://doc.cgal.org/latest/Mesh_3/index.html#title14

Primary Mentor

viennamesh_-_cgal.1401979116.txt.gz · Last modified: 2014/06/05 14:38 by viennastar