From a268a1fbe8f42ec621e9960874e6a93988bce70b Mon Sep 17 00:00:00 2001
From: Jane Tournois
Date: Tue, 26 Nov 2024 16:00:53 +0100
Subject: [PATCH] Andreas's review
---
_posts/2024-12-01-mesh3-improvements.md | 16 ++++++++--------
1 file changed, 8 insertions(+), 8 deletions(-)
diff --git a/_posts/2024-12-01-mesh3-improvements.md b/_posts/2024-12-01-mesh3-improvements.md
index 55f87dd5f..f07945baf 100644
--- a/_posts/2024-12-01-mesh3-improvements.md
+++ b/_posts/2024-12-01-mesh3-improvements.md
@@ -1,7 +1,7 @@
---
layout: post
-title: "Tetrahedral Mesh Generation improvements"
-description: "Tetrahedral Mesh Generation improvements in CGAL-6.0.1"
+title: "Tetrahedral Mesh Generation Improvements"
+description: "Tetrahedral Mesh Generation Improvements in CGAL-6.0.1"
category:
tags: [""]
---
@@ -46,9 +46,9 @@ are added to the feature graph of the domain for feature protection.
Two detection functors are provided :
- - CGAL::Detect_features_in_image() detects and constructs all
+
CGAL::Detect_features_in_image()
detects and constructs all
polylines lying at the intersection of three or more subdomains, and
- - CGAL::Detect_features_on_image_bbox() detects and constructs the polylines
+
CGAL::Detect_features_on_image_bbox()
detects and constructs the polylines
that lie at the intersection of two or more subdomains and the bounding box of the input labeled image.
@@ -71,7 +71,7 @@ a smooth and accurate output surface was described by Stalling et al in
Stalling, D., Zöckler, M., Sander, O., & Hege, H. C. (1998),
Weighted labels for 3D image segmentation.
It consists in generating a second input image, made of integer coefficients called weights, and use those weights to define
-smoother domain boundaries. The 3D image of weights can be generated by CGAL::Mesh_3::generate_label_weights().
+smoother domain boundaries. The 3D image of weights can be generated by CGAL::Mesh_3::generate_label_weights()
.
@@ -96,14 +96,14 @@ until they are satisfied.
The list of CGAL meshing criteria has been enriched with a new criterion that enables the user to
define an upper bound on the distance between the input feature graph and the output feature edges.
-
The following example shows how to use this new criterion, called edge_distance:
+
The following example shows how to use this new criterion, called edge_distance
:
mesh_polyhedral_domain_with_edge_distance.cpp.
-
Mesh generation from polyhedral surface with varying edge_distance meshing criterion.
- The quality improvement is important on the lower end of stool feet.
+
Mesh generation from polyhedral surface with varying edge_distance
meshing criterion.
+ The quality improvement is noticeable at the bottom section of the stool legs.