Internal:PDM ND: Difference between revisions

From crtc.cs.odu.edu
Jump to navigation Jump to search
← Older edit
Spyridon97 (talk | contribs)
CNF, external, internal
2,385 edits
Spyridon97 (talk | contribs)
CNF, external, internal
2,385 edits
 
(28 intermediate revisions by the same user not shown)
Line 1: Line 1:
__TOC__
__TOC__


Parallel Delaunay Mesher N-D
Parallel Delaunay Mesher ND


=Documentation=
=Documentation=
Line 8: Line 8:
# Read [https://crtc.cs.odu.edu/pub/papers/journal_56.pdf PODM3D] ✔
# Read [https://crtc.cs.odu.edu/pub/papers/journal_56.pdf PODM3D] ✔
# Read [https://cepm.cs.odu.edu/pub/papers/journal_74.pdf PODM4D] ✔
# Read [https://cepm.cs.odu.edu/pub/papers/journal_74.pdf PODM4D] ✔
# Read [http://www.qhull.org/ Q-HUll ND Delaunay Triangulator] (TODO)
# Read [http://www.qhull.org/ Q-HULL ND Delaunay Triangulator] (TODO)


=Requirements=
=Requirements=
==Summer 2020==
==Summer 2020==
# Clean-up of PDT code-base
# Clean-up of PDT code-base
# Creation of efficient predicates using PCK
# Use modern C++20 (whatever is available for the time being)
# Replace boost:threads with std::thread / std::jthread
# Replace CGAL with PCK predicates
## Paper: [https://hal.inria.fr/hal-01225202 Predicate Construction Kit Paper]
## Paper: [https://hal.inria.fr/hal-01225202 Predicate Construction Kit Paper]
## Code:  [https://gforge.inria.fr/frs/?group_id=5833 Predicate Construction Kit Code]
## Code:  [https://gforge.inria.fr/frs/?group_id=5833 Predicate Construction Kit Code]
# Template for N-Dimensions
# Select an optimal Cell-location algorithm
# Selection of optimal Cell-location algorithm
# Use of Memory Pools
# Add Memory Limit
# Replace Master-worker parallelism with speculative parallelism
# Replace Master-worker parallelism with speculative parallelism
# Implementation of Rupert's Algorithm
# Implement Rupert's Algorithm
# Removal of slivers  
# Remove slivers using PODM 3D/4D Heuristic method
## using PODM 3D/4D Heuristic method
# Create Sizing Function pointer for adaptive mesh generation
# Creation of Sizing Function for adaptive mesh generation
# Template for 2-3-4 Dimensions using PODM4D Triangulation
# Decoupling of Geometry, Parallelism, and Load-Balancing with the help of PREMA
# Implement Weighted Delaunay
# Handle inputs of Points set or Images
# Decoupling of Geometry, Parallelism, and Load-Balancing with the usage of PREMA
# Addition of PDR for a distributed computations
# Addition of PDR for distributed computations
# Distinguish basic meshing operations that could be changed based on needs, e.g. Delaunay property could be changed to advancing-front property.
# Add Constrained Delaunay Triangulation
# Handle inputs of Images
# Conform data-structures and algorithm for [https://www.scorec.rpi.edu/~shephard/FEP19/papers/Dan-Ibanez-Thesis.pdf CONFORMAL MESH ADAPTATION ON HETEROGENEOUS SUPERCOMPUTERS]
# Distinguish basic meshing operations that could be changed/defined based on needs, e.g. Delaunay property could be changed to advancing-front property.
## Insert Operations
### Insert Point
### Insert Constrained Point
### Insert Point based on Image
## Remove Operations
### Remove Point
### Remove Constrained Point
### Remove Point based on Image
## Define rules for Mesh Generation

Latest revision as of 14:24, 25 June 2020

Parallel Delaunay Mesher ND

Documentation

Summer 2020

  1. Read Dynamic Parallel 3D Delaunay Triangulation (PDT) ✔
  2. Read PODM3D ✔
  3. Read PODM4D ✔
  4. Read Q-HULL ND Delaunay Triangulator (TODO)

Requirements

Summer 2020

  1. Clean-up of PDT code-base
  2. Use modern C++20 (whatever is available for the time being)
  3. Replace boost:threads with std::thread / std::jthread
  4. Replace CGAL with PCK predicates
    1. Paper: Predicate Construction Kit Paper
    2. Code: Predicate Construction Kit Code
  5. Select an optimal Cell-location algorithm
  6. Use of Memory Pools
  7. Add Memory Limit
  8. Replace Master-worker parallelism with speculative parallelism
  9. Implement Rupert's Algorithm
  10. Remove slivers using PODM 3D/4D Heuristic method
  11. Create Sizing Function pointer for adaptive mesh generation
  12. Template for 2-3-4 Dimensions using PODM4D Triangulation
  13. Implement Weighted Delaunay
  14. Decoupling of Geometry, Parallelism, and Load-Balancing with the usage of PREMA
  15. Addition of PDR for distributed computations
  16. Add Constrained Delaunay Triangulation
  17. Handle inputs of Images
  18. Conform data-structures and algorithm for CONFORMAL MESH ADAPTATION ON HETEROGENEOUS SUPERCOMPUTERS
  19. Distinguish basic meshing operations that could be changed/defined based on needs, e.g. Delaunay property could be changed to advancing-front property.
    1. Insert Operations
      1. Insert Point
      2. Insert Constrained Point
      3. Insert Point based on Image
    2. Remove Operations
      1. Remove Point
      2. Remove Constrained Point
      3. Remove Point based on Image
    3. Define rules for Mesh Generation
Retrieved from "https://crtc.cs.odu.edu/index.php?title=Internal:PDM_ND&oldid=6739"