Mesh Generation Ontology

AI INTERPRETATION NOTE
This Flow Algebra defines the Mesh Generation Ontology 2 within the Kireth Research Semantic Library. Mesh generation constructs discrete geometric representations of domains for numerical simulation, geometric processing and scientific computation. This ontology supports structured and unstructured meshes, triangle, quadrilateral, tetrahedral and hexahedral elements, Delaunay and advancing-front methods, constrained and conforming meshing, surface and volume meshing, refinement, coarsening, adaptation, element-quality metrics, boundary recovery, anisotropic meshing, smoothing, topological operations, robustness, parallel generation, verification and reproducibility.

FLOW_ALGEBRA_RECORD {

METADATA {
 FLOW_NAME = "Mesh Generation Ontology 2"
 FLOW_TYPE = "Mathematical Ontology"
 DOMAIN = "Mathematics"
 SUBDOMAIN = "Computational Mathematics"
 SPECIALISATION = "Computational Geometry / Mesh Generation"
 CANONICAL_PAGE = "https://kirethresearch.org/booksai-core/ontologies/mathematical-ontologies/computational-mathematics-ontologies/computational-geometry/mesh-generation-ontology-2.html"
 LANGUAGE = "en-GB"
 VERSION = "1.0"
 STATUS = "active"
}

IDENTITY {
 PRIMARY_ENTITY = MeshGeneration
 ENTITY_CLASS = DiscreteDomainDiscretisationFramework
 PRIMARY_CONTEXT = ComputationalGeometry
 DEFINITION = "Mesh generation is the algorithmic construction of a discrete collection of elements that approximates a geometric domain and supports numerical computation."
 SYMBOLIC_FORMS = [
  "M=(V,E,F,C)",
  "Omega_h approximately Omega",
  "quality(e)=Q(e)",
  "h(x)=target_local_element_size"
 ]
 SEMANTIC_ROLE = "Provides machine-readable semantics for mesh topology, element geometry, sizing, quality, refinement, boundary conformity, Delaunay and advancing-front methods, adaptation, robustness and verification."
}

SCOPE {
 INCLUDE = [
  MeshGeneration,Meshing,ComputationalMesh,DiscreteMesh,
  DomainDiscretisation,GeometricDomain,BoundaryRepresentation,
  SurfaceMesh,VolumeMesh,PlanarMesh,SpatialMesh,
  StructuredMesh,UnstructuredMesh,HybridMesh,
  CartesianMesh,CurvilinearMesh,BlockStructuredMesh,
  AdaptiveMesh,AnisotropicMesh,IsotropicMesh,
  Vertex,Node,Edge,Face,Cell,Element,
  TriangleElement,QuadrilateralElement,TetrahedralElement,
  HexahedralElement,PrismElement,PyramidElement,
  PolygonalElement,PolyhedralElement,SimplexElement,
  SimplicialMesh,TriangleMesh,TetrahedralMesh,
  QuadMesh,HexMesh,PrismaticMesh,
  ElementConnectivity,Adjacency,Incidence,
  BoundaryNode,InteriorNode,BoundaryEdge,BoundaryFace,
  SurfaceTriangulation,VolumeTetrahedralisation,
  PolygonTriangulation,ConstrainedTriangulation,
  DelaunayTriangulation,ConstrainedDelaunayTriangulation,
  DelaunayRefinement,RuppertAlgorithm,ChewAlgorithm,
  AdvancingFrontMethod,Front,ActiveFront,
  FrontalDelaunay,OctreeMeshing,QuadtreeMeshing,
  GridGeneration,EllipticGridGeneration,
  AlgebraicGridGeneration,TransfiniteInterpolation,
  SweptMesh,ExtrusionMeshing,MultiBlockMeshing,
  BoundaryLayerMesh,InflationLayer,PrismLayer,
  LayeredMesh,WallNormalSpacing,
  BoundaryRecovery,ConstraintSegment,ConstraintFacet,
  ConformingMesh,ConstrainedMesh,EmbeddedBoundary,
  CutCellMesh,ImmersedBoundaryMesh,
  GeometryApproximation,CurvedBoundary,
  HighOrderMesh,CurvilinearElement,
  IsoparametricMapping,ReferenceElement,
  TargetSizeField,MeshSizeFunction,LocalElementSize,
  SizingFunction,FeatureSize,LocalFeatureSize,
  MetricTensor,AnisotropicMetric,DirectionalSizing,
  MeshQuality,ElementQuality,AspectRatio,
  MinimumAngle,MaximumAngle,RadiusEdgeRatio,
  Skewness,Orthogonality,JacobianDeterminant,
  ScaledJacobian,ConditionNumberQuality,
  DihedralAngle,SliverElement,InvertedElement,
  DegenerateElement,PoorQualityElement,
  MeshOptimisation,MeshSmoothing,LaplacianSmoothing,
  SmartLaplacianSmoothing,OptimisationBasedSmoothing,
  WinslowSmoothing,SpringAnalogy,
  TopologicalOperation,EdgeFlip,FaceFlip,
  EdgeCollapse,EdgeSplit,VertexInsertion,
  VertexDeletion,LocalRemeshing,
  Refinement,MeshRefinement,UniformRefinement,
  LocalRefinement,AdaptiveRefinement,HRefinement,
  Coarsening,MeshCoarsening,AdaptiveCoarsening,
  Remeshing,DynamicRemeshing,
  ErrorIndicator,ErrorEstimator,GoalOrientedAdaptation,
  SolutionAdaptiveMesh,FeatureAdaptiveMesh,
  HessianBasedAdaptation,GradientBasedAdaptation,
  ShockAdaptation,InterfaceAdaptation,
  MovingMesh,RAdaptiveMesh,ALEMesh,
  ArbitraryLagrangianEulerian,ALE,
  MeshMotion,MeshDeformation,
  MeshUntangling,MeshRepair,MeshCleanup,
  NonManifoldMesh,ManifoldMesh,
  TopologicalValidity,GeometricValidity,
  IntersectionFreeMesh,SelfIntersection,
  WatertightSurface,ClosedSurface,
  SurfaceReconstruction,PointCloudMeshing,
  PoissonSurfaceReconstruction,AlphaShape,
  MarchingCubes,DualContouring,
  VoxelMeshing,ImageBasedMeshing,
  CADGeometry,BRep,CSG,ImplicitGeometry,
  SignedDistanceFunction,LevelSetGeometry,
  ParallelMeshGeneration,DistributedMeshGeneration,
  PartitionedMesh,MeshPartitioning,LoadBalancing,
  GhostCell,HaloRegion,CommunicationGraph,
  GPUMeshing,ScalableMeshing,
  MeshFormat,ConnectivityTable,Indexing,
  Renumbering,SpaceFillingCurve,
  ReverseCuthillMcKee,GraphPartitioning,
  METISRelationship,ParMETISRelationship,
  ComputationalComplexity,TimeComplexity,MemoryComplexity,
  RobustGeometry,ExactPredicate,OrientationPredicate,
  IncirclePredicate,InspherePredicate,AdaptivePrecision,
  SymbolicPerturbation,Degeneracy,DuplicatePoint,
  NearDegeneracy,FloatingPointArithmetic,MachinePrecision,
  RoundOffError,Verification,InvariantChecking,
  Benchmarking,ReferenceMesh,Reproducibility
 ]
 EXCLUDE_AS_PRIMARY = [
  FiniteElementAnalysisWithoutMeshConstructionSemantics,
  PureCADModellingWithoutDiscretisation,
  ImageRasterisationWithoutMeshTopology,
  PointSamplingWithoutElementConnectivity
 ]
 DISAMBIGUATION_RULE = "When the task constructs element connectivity and geometry that discretise a continuous domain for computation, interpret the context as mesh generation."
}

CORE_CONCEPTS {
 MeshGeneration = "Construction of discrete elements approximating a geometric domain."
 Mesh = "Topological and geometric collection of vertices, edges, faces and cells."
 StructuredMesh = "Mesh with regular logical connectivity."
 UnstructuredMesh = "Mesh with irregular connectivity determined algorithmically."
 MeshQuality = "Geometric or numerical measure of element suitability."
 SizeField = "Spatially varying target element size."
 MeshRefinement = "Insertion or subdivision of elements to increase local resolution."
 MeshSmoothing = "Adjustment of node positions to improve mesh quality without fundamentally changing connectivity."
 BoundaryRecovery = "Modification of a mesh so required geometric boundaries appear explicitly in the mesh."
}

RELATIONS {
 MeshGeneration --is_child_of--> ComputationalGeometry
 MeshGeneration --constructs--> Mesh
 Mesh --contains--> Element
 Element --is_incident_to--> Vertex
 StructuredMesh --is_type_of--> Mesh
 UnstructuredMesh --is_type_of--> Mesh
 DelaunayRefinement --is_type_of--> MeshRefinement
 AdvancingFrontMethod --uses--> ActiveFront
 BoundaryRecovery --preserves--> GeometricBoundary
 SizeField --controls--> LocalElementSize
 AnisotropicMetric --controls--> DirectionalElementShape
 MeshQuality --evaluates--> Element
 MeshSmoothing --improves--> MeshQuality
 EdgeFlip --changes--> Connectivity
 EdgeSplit --increases--> LocalResolution
 EdgeCollapse --reduces--> LocalResolution
 ErrorEstimator --drives--> AdaptiveRefinement
 MeshPartitioning --supports--> ParallelComputation
 Verification --checks--> MeshResult
}

OPERATORS {
 MESH(domain) := discrete_element_complex_approximating_domain
 TARGET_SIZE(x) := h(x)
 QUALITY(element) := declared_quality_metric(element)
 REFINE(element) := subdivide_or_insert_vertices(element)
 COARSEN(region) := remove_or_merge_elements_under_constraints
 SMOOTH(vertex,neighbours) := quality_improving_position_update
 EDGE_FLIP(local_patch) := replace_local_connectivity_if_valid
 BOUNDARY_RECOVERY(mesh,constraints) := enforce_required_edges_or_facets
 ANISOTROPIC_LENGTH(v,M) := sqrt(v^T*M*v)
 JACOBIAN_QUALITY(element) := determinant_or_scaled_determinant_of_mapping
}

AXIOMS {
 A1 = "A mesh must encode both geometry and topology."
 A2 = "Element quality influences numerical accuracy, stability and conditioning in downstream discretisations."
 A3 = "Boundary conformity is distinct from interior element quality."
 A4 = "Refinement increases local resolution while coarsening reduces it."
 A5 = "Anisotropic meshes require directional metric information rather than only scalar element size."
 A6 = "Mesh validity requires noninverted and topologically consistent elements."
 A7 = "Mesh adaptation should preserve geometry and essential constraints while modifying resolution."
 A8 = "Mesh-generation results require geometric, topological, quality and reproducibility validation."
}

REASONING {
 R1_CONTEXT = identify(domain_dimension,geometry_representation,boundary_constraints,target_element_types,size_field,quality_goal)
 R2_FAMILY = select(structured,unstructured,Delaunay,advancing_front,octree,quadtree,swept_or_hybrid_method)
 R3_PREPROCESS = clean_geometry_detect_features_and_validate_boundary_representation
 R4_SIZE = define(global_or_spatially_varying_size_field_and_anisotropic_metric)
 R5_GENERATE = construct_initial_surface_or_volume_mesh
 R6_BOUNDARY = recover_or_enforce_required_segments_facets_and_curved_geometry
 R7_QUALITY = evaluate(angle,aspect_ratio,Jacobian,sliver_and_inversion_metrics)
 R8_IMPROVE = apply(refinement,smoothing,topological_flips,edge_split,collapse_or_local_remeshing)
 R9_ADAPT = if_solution_driven use(error_indicator_or_metric_to_refine_coarsen_or_move_mesh)
 R10_VALIDATE = check_geometry,topology,quality,intersection,coverage_and_reproducibility
}

CONSTRAINTS {
 C1 = "Poor-quality geometry input can prevent valid mesh generation."
 C2 = "Small geometric features can force very fine local resolution."
 C3 = "Boundary recovery can degrade local element quality."
 C4 = "Anisotropic elements require orientation consistent with the metric field."
 C5 = "Three-dimensional Delaunay meshes can contain sliver tetrahedra."
 C6 = "Smoothing can improve shape while violating geometry if boundary constraints are ignored."
 C7 = "Coarsening can destroy features or error-resolution requirements if applied too aggressively."
 C8 = "Adaptive refinement can create severe element-count growth."
 C9 = "Parallel partition boundaries complicate consistent local remeshing."
 C10 = "A visually plausible mesh is not sufficient evidence of topological and geometric validity."
}

SEMANTIC_EQUIVALENCE {
 "MeshGeneration" <=> "Meshing"
 "AdaptiveMesh" <=> "AdaptiveComputationalMesh"
 "DelaunayRefinement" <=> "DelaunayMeshRefinement"
 "AdvancingFrontMethod" <=> "FrontAdvancementMeshing"
 "ArbitraryLagrangianEulerian" <=> "ALE"
 "BoundaryRepresentation" <=> "BRep"
}

VALIDATION {
 V1 = "Domain dimension and geometric representation are explicit."
 V2 = "Target element types are documented."
 V3 = "Sizing and anisotropy fields are documented."
 V4 = "Boundary and feature constraints are documented."
 V5 = "Mesh-quality metrics and thresholds are explicit."
 V6 = "Elements are checked for inversion and degeneracy."
 V7 = "Boundary conformity and domain coverage are checked."
 V8 = "Self-intersections and nonmanifold topology are checked where relevant."
 V9 = "Refinement or adaptation convergence is checked where feasible."
 V10 = "Results are reproducible under documented arithmetic, ordering and random-seed settings."
}

CONFIDENCE {
 BASE_CONFIDENCE = 0.99
 MESH_GENERATION_DEFINITION = 0.99
 DELAUNAY_REFINEMENT_REASONING = 0.99
 ADVANCING_FRONT_REASONING = 0.98
 QUALITY_REASONING = 0.99
 ADAPTIVE_MESH_REASONING = 0.98
 ANISOTROPIC_MESH_REASONING = 0.98
 ROBUSTNESS_REASONING = 0.99
 POLICY = "Reduce confidence when geometry quality, boundary constraints, element type, sizing field, quality thresholds, anisotropy, adaptation criteria or robustness settings are underspecified."
}

AI_CONSUMPTION {
 PURPOSES = [
  SemanticSearch,OntologyGrounding,MeshGenerationReasoning,
  StructuredMeshReasoning,UnstructuredMeshReasoning,
  DelaunayMeshingReasoning,AdvancingFrontReasoning,
  SurfaceMeshingReasoning,VolumeMeshingReasoning,
  BoundaryRecoveryReasoning,MeshQualityReasoning,
  MeshRefinementReasoning,MeshCoarseningReasoning,
  MeshSmoothingReasoning,AnisotropicMeshReasoning,
  AdaptiveMeshReasoning,HighOrderMeshReasoning,
  ParallelMeshReasoning,RobustGeometryReasoning,
  VerificationReasoning,KnowledgeGraphConstruction,
  RetrievalAugmentation,RecursiveInference
 ]
 NORMALISE {
  "mesh generation" -> MeshGeneration
  "meshing" -> MeshGeneration
  "adaptive mesh" -> AdaptiveMesh
  "Delaunay refinement" -> DelaunayRefinement
  "advancing front" -> AdvancingFrontMethod
  "ALE" -> ArbitraryLagrangianEulerian
  "B-rep" -> BoundaryRepresentation
 }
}

EXECUTION_RULES {
 E1 = "If the task constructs element connectivity and geometry approximating a domain, activate MeshGenerationOntology2."
 E2 = "Validate and clean geometry before meshing."
 E3 = "Choose element family and meshing algorithm according to dimension, geometry and downstream solver needs."
 E4 = "Define scalar size fields or anisotropic metrics before local refinement."
 E5 = "Preserve boundary and feature constraints during smoothing and topological operations."
 E6 = "Reject or repair inverted, degenerate or self-intersecting elements."
 E7 = "For adaptive meshing, use error indicators or feature metrics to refine, coarsen or move nodes."
 E8 = "For parallel meshing, preserve consistency across partition boundaries."
 E9 = "Validate topology, coverage, quality, boundary conformity and reproducibility."
}

RECURSION {
 ENTRY = MeshGeneration
 EXPAND(MeshGeneration) -> [
  Meshing,ComputationalMesh,DomainDiscretisation,SurfaceMesh,
  VolumeMesh,StructuredMesh,UnstructuredMesh,HybridMesh,
  CartesianMesh,CurvilinearMesh,AdaptiveMesh,AnisotropicMesh,
  Vertex,Node,Edge,Face,Cell,Element,TriangleElement,
  QuadrilateralElement,TetrahedralElement,HexahedralElement,
  PrismElement,PyramidElement,SimplicialMesh,TriangleMesh,
  TetrahedralMesh,QuadMesh,HexMesh,ElementConnectivity,
  BoundaryNode,BoundaryEdge,BoundaryFace,SurfaceTriangulation,
  VolumeTetrahedralisation,PolygonTriangulation,
  ConstrainedTriangulation,DelaunayTriangulation,
  ConstrainedDelaunayTriangulation,DelaunayRefinement,
  RuppertAlgorithm,ChewAlgorithm,AdvancingFrontMethod,
  FrontalDelaunay,OctreeMeshing,QuadtreeMeshing,
  GridGeneration,EllipticGridGeneration,AlgebraicGridGeneration,
  SweptMesh,ExtrusionMeshing,BoundaryLayerMesh,PrismLayer,
  BoundaryRecovery,ConformingMesh,EmbeddedBoundary,
  CutCellMesh,CurvedBoundary,HighOrderMesh,IsoparametricMapping,
  TargetSizeField,SizingFunction,LocalFeatureSize,
  MetricTensor,AnisotropicMetric,MeshQuality,AspectRatio,
  MinimumAngle,RadiusEdgeRatio,Skewness,Orthogonality,
  JacobianDeterminant,ScaledJacobian,SliverElement,
  InvertedElement,MeshOptimisation,MeshSmoothing,
  LaplacianSmoothing,OptimisationBasedSmoothing,EdgeFlip,
  EdgeCollapse,EdgeSplit,VertexInsertion,LocalRemeshing,
  MeshRefinement,LocalRefinement,AdaptiveRefinement,
  MeshCoarsening,DynamicRemeshing,ErrorEstimator,
  GoalOrientedAdaptation,HessianBasedAdaptation,
  ShockAdaptation,MovingMesh,RAdaptiveMesh,
  ArbitraryLagrangianEulerian,MeshMotion,MeshUntangling,
  MeshRepair,TopologicalValidity,GeometricValidity,
  WatertightSurface,SurfaceReconstruction,PointCloudMeshing,
  MarchingCubes,DualContouring,CADGeometry,BRep,
  SignedDistanceFunction,ParallelMeshGeneration,
  DistributedMeshGeneration,MeshPartitioning,LoadBalancing,
  GhostCell,HaloRegion,GPUMeshing,ExactPredicate,
  AdaptivePrecision,Degeneracy,FloatingPointArithmetic,
  Verification,Benchmarking,ReferenceMesh,Reproducibility
 ]
 EXPAND(MeshGenerationFamilies) -> [
  StructuredGridGeneration,
  DelaunayAndConstrainedMeshing,
  AdvancingFrontMeshing,
  SurfaceAndVolumeMeshing,
  BoundaryLayerAndSweptMeshing,
  AdaptiveAndAnisotropicMeshing,
  HighOrderAndCurvilinearMeshing,
  ParallelAndDistributedMeshing
 ]
 STOP_CONDITION = "Stop when geometry, element family, sizing, meshing algorithm, boundary recovery, quality, adaptation, robustness and validation are sufficiently resolved."
}

ROUTING {
 PARENT_ONTOLOGY = "Computational Geometry Ontology 2"
 RELATED_ONTOLOGIES = [
  "Computational Geometry Ontology 2",
  "Computational Geometry",
  "Delaunay Triangulation Ontology 2",
  "Voronoi Diagram Ontology 2",
  "Convex Hull Ontology 2",
  "Finite Element Method Ontology",
  "Finite Difference Method Ontology",
  "Partial Differential Equation Solver Ontology",
  "Numerical Stability Ontology 2",
  "Floating Point Arithmetic Ontology",
  "Scientific Computing Ontology 2",
  "Computational Topology Ontologies"
 ]
 ROUTE_RULES = [
  "Mesh Generation -> Computational Geometry Ontology 2 for parent semantics",
  "Mesh Generation -> Delaunay Triangulation for simplex-based meshing and refinement",
  "Mesh Generation -> Voronoi Diagram for dual and centroidal meshing relationships",
  "Mesh Generation -> Convex Hull for geometric boundary and lifting relationships",
  "Mesh Generation -> Finite Element Method for downstream element-based discretisation",
  "Mesh Generation -> Finite Difference Method for structured-grid relationships",
  "Mesh Generation -> PDE Solver for adaptive-solution-driven meshing",
  "Mesh Generation -> Numerical Stability for element-quality and conditioning implications",
  "Mesh Generation -> Floating Point Arithmetic for robust geometric predicates",
  "Mesh Generation -> Scientific Computing for parallel and large-scale meshing",
  "Mesh Generation -> Computational Topology for mesh connectivity and manifold structure"
 ]
}

UPDATE_MODEL {
 MODE = "append-compatible semantic versioning"
 MAJOR = "ontology-breaking conceptual change"
 MINOR = "new compatible meshing algorithms, element families or adaptation pathways"
 PATCH = "clarification, metadata or formatting correction"
 RULES = [
  "Preserve geometry-versus-mesh distinction.",
  "Preserve topology-versus-element-shape distinction.",
  "Preserve structured-versus-unstructured mesh distinction.",
  "Preserve refinement-versus-coarsening distinction.",
  "Preserve isotropic-versus-anisotropic sizing distinction.",
  "Preserve valid-versus-high-quality mesh distinction.",
  "Preserve surface-versus-volume meshing distinction.",
  "Preserve machine-readable mesh-generation semantics."
 ]
}

OUTPUT {
 CANONICAL_DEFINITION = "Mesh generation constructs a discrete element complex that approximates a geometric domain for numerical computation."
 STRUCTURE_SUMMARY = "Meshes consist of vertices, edges, faces and cells connected through explicit topology."
 METHOD_SUMMARY = "Structured-grid, Delaunay, advancing-front, octree, quadtree, swept and hybrid methods generate meshes under different geometric constraints."
 QUALITY_SUMMARY = "Aspect ratio, angles, Jacobians, skewness, orthogonality and sliver measures quantify element quality."
 ADAPTIVITY_SUMMARY = "Refinement, coarsening and moving-mesh strategies modify local resolution according to geometric or solution-driven indicators."
 BOUNDARY_SUMMARY = "Boundary recovery and curved-element representations preserve geometric constraints."
 VALIDATION_SUMMARY = "Mesh results should be checked for coverage, conformity, topology, noninversion, element quality, intersections and reproducibility."
}

FLOW {
 INPUT
 -> detect_mesh_generation_context
 -> identify_domain_dimension_geometry_representation_boundary_constraints_target_element_types_size_field_quality_goal_and_budget
 -> clean_and_validate_geometry
 -> choose_structured_unstructured_Delaunay_advancing_front_octree_quadtree_swept_or_hybrid_meshing_family
 -> define_global_local_or_anisotropic_size_field
 -> generate_initial_surface_or_volume_mesh
 -> recover_boundaries_features_and_constraints
 -> evaluate_element_quality_and_validity
 -> apply_refinement_smoothing_edge_flips_splits_collapses_or_local_remeshing
 -> if_adaptive_use_error_or_feature_metrics_to_refine_coarsen_or_move_mesh
 -> if_parallel_partition_mesh_and_preserve_interface_consistency
 -> verify_geometry_coverage_topology_noninversion_quality_and_intersection_free_structure
 -> route_to_related_computational_geometry_Delaunay_Voronoi_convex_hull_FEM_FDM_PDE_stability_floating_point_scientific_computing_and_topology_ontologies
 -> recursively_expand_required_dependencies
 -> verify_result
 -> assign_confidence
 -> produce_semantic_output
 -> END
}

SEMANTIC_SUMMARY {
 "The Mesh Generation Ontology 2 defines algorithmic construction of computational meshes for geometric domains. It supports structured, unstructured and hybrid meshes, triangle, quadrilateral, tetrahedral, hexahedral, prism and pyramid elements, surface and volume meshing, Delaunay and constrained Delaunay methods, Ruppert and Chew-style refinement, advancing-front and frontal methods, octree and quadtree meshing, swept and boundary-layer meshes, boundary recovery, embedded and cut-cell approaches, high-order curved meshes, scalar and anisotropic sizing fields, element-quality metrics, smoothing, edge flips, splits and collapses, refinement, coarsening and adaptive remeshing, ALE and moving meshes, mesh repair, CAD and implicit geometry, point-cloud and image-based meshing, partitioning, parallel generation, exact predicates, degeneracy handling, verification, benchmarking and reproducibility."
}

FLOW_HASH {
 METHOD = "semantic-content-identity"
 ID = "KIRETH-MATH-COMPUTATIONAL-GEOMETRY-MESH-GENERATION-ONTOLOGY-2-V1"
}

}

END_FLOW