Conforming Constrained Delaunay Triangulation 3D

Demonstrate the weak and strong scalability of the conforming constrained delaunay triangulation algorithm for tetrahedral meshes and tetrahedral remeshing.

Quick Facts

Type

Mini App

Status

Planned

Work Packages

WP1

Frameworks

CGAL

1. Overview

Demonstrate the weak and strong scalability of the conforming constrained delaunay triangulation algorithm for tetrahedral meshes and tetrahedral remeshing.

2. Technical Stack

2.1. Frameworks Used

  • CGAL

2.2. Parallel Frameworks

  • Multithread - TBB

3. Methods & Algorithms

3.1. WP1: Discretization

  • unstructured mesh

4. Benchmarking

4.1. Metrics

  • Weak Scalability

  • Strong Scalability

4.2. Benchmark Scope

  • Single Node

5. Timeline

Milestone Date

Specification Due

N/A

Prototype Due

N/A

6. Team

Partners: Unistra, Inria CA

Responsible: V. Chabannes; C. Prud’homme, P. Alliez

WP7 Engineer: Javier Cladellas (UNISTRA)