A Trajectory Refinement Scheme for Arbitrary Triangularly Tessellated Boundaries

GlennICE relies on a Delaunay triangulation step to generate a two dimensional mesh of the point cloud of trajectory release locations in its adaptive refinement process. Previously GlennICE performed a 2.5D Delaunay triangulation to generate a two dimensional mesh from a point cloud in three-dimensional space. This process is not a general scheme and contains restrictions that prohibit GlennICE from being extended to tackle new challenges. This paper introduces a new method that does not rely on a 2.5D Delaunay triangulation, and instead performs a triangulation directly on the tessellated inlet surface. It accomplishes this by performing a triangulation on the local point cloud associated with each triangular face of the tessellated inlet surface. Each of these local triangulations are stitched together to forma single contiguous mesh. While the resulting mesh is not guaranteed to be a valid Delaunay triangulation, this formulation is significantly more general than its predecessor and enables the GlennICE code to be extended for a variety of different applications. This includes the ability to extend the software to handle reentraining splashed, bounced, or broken droplets and crystals.

Authors

Publication Details

Published
2025-07-16
DOI
https://doi.org/10.2514/6.2025-3776
Primary Topic
Computational Geometry and Mesh Generation
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Trajectory Refinement Scheme for Arbitrary Triangularly Tessellated Boundaries

David L. Rigby, William Wright, Eric Galloway, Christopher E. Porter
Computational Geometry and Mesh Generation
article

A Trajectory Refinement Scheme for Arbitrary Triangularly Tessellated Boundaries

David L. Rigby, William Wright, Eric Galloway, Christopher E. Porter
article en

Abstract

GlennICE relies on a Delaunay triangulation step to generate a two dimensional mesh of the point cloud of trajectory release locations in its adaptive refinement process. Previously GlennICE performed a 2.5D Delaunay triangulation to generate a two dimensional mesh from a point cloud in three-dimensional space. This process is not a general scheme and contains restrictions that prohibit GlennICE from being extended to tackle new challenges. This paper introduces a new method that does not rely on a 2.5D Delaunay triangulation, and instead performs a triangulation directly on the tessellated inlet surface. It accomplishes this by performing a triangulation on the local point cloud associated with each triangular face of the tessellated inlet surface. Each of these local triangulations are stitched together to forma single contiguous mesh. While the resulting mesh is not guaranteed to be a valid Delaunay triangulation, this formulation is significantly more general than its predecessor and enables the GlennICE code to be extended for a variety of different applications. This includes the ability to extend the software to handle reentraining splashed, bounced, or broken droplets and crystals.

Openalex Percentile: Top 70%
Computational Geometry and Mesh Generation
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.