V.K. Suriyababu
Please Note
6 records found
1
One contribution focuses on topological queries and cleanup. A curvature-aware, low-parameter approach detects hole boundaries and supports through-hole removal when needed. The same chapter also presents extraction of negative- volume regions as a separate topology-processing task. Independently, the thesis introduces Series of Local Triangulations (SOLT), an intermediate representation for stable resampling of non-uniform point clouds into uniform, high-fidelity sets while preserving geometric detail, and explores a preliminary application to CADfree higher-order surface reconstruction.
For simulation-ready models, the thesis proposes a shrink-wrap mesh generation workflow on octrees that combines distance fields and adaptive morphology. This framework enables reliable topology simplification, controlled genus reduction, and robust wrap mesh generation for complex real-world geometries. In a separate application-focused workflow, the thesis also presents a heat-method-based algorithm for mean camber line extraction and structured multiblock decomposition, offering a practical and implementation-friendly alternative to traditional geometric constructions.
These algorithmic contributions culminate in tgLang, a strongly typed domain-specific programming language for scientific computing and geometry processing. By elevating geometric entities to first-class language constructs and coupling them with deterministic execution, runtime support, and native deployment, tgLang transforms complex mesh workflows into concise and reproducible programs. Together, the methods and language presented in this thesis provide a flexible toolbox that guides imperfect input geometry toward reliable, application-ready computational models. ...
One contribution focuses on topological queries and cleanup. A curvature-aware, low-parameter approach detects hole boundaries and supports through-hole removal when needed. The same chapter also presents extraction of negative- volume regions as a separate topology-processing task. Independently, the thesis introduces Series of Local Triangulations (SOLT), an intermediate representation for stable resampling of non-uniform point clouds into uniform, high-fidelity sets while preserving geometric detail, and explores a preliminary application to CADfree higher-order surface reconstruction.
For simulation-ready models, the thesis proposes a shrink-wrap mesh generation workflow on octrees that combines distance fields and adaptive morphology. This framework enables reliable topology simplification, controlled genus reduction, and robust wrap mesh generation for complex real-world geometries. In a separate application-focused workflow, the thesis also presents a heat-method-based algorithm for mean camber line extraction and structured multiblock decomposition, offering a practical and implementation-friendly alternative to traditional geometric constructions.
These algorithmic contributions culminate in tgLang, a strongly typed domain-specific programming language for scientific computing and geometry processing. By elevating geometric entities to first-class language constructs and coupling them with deterministic execution, runtime support, and native deployment, tgLang transforms complex mesh workflows into concise and reproducible programs. Together, the methods and language presented in this thesis provide a flexible toolbox that guides imperfect input geometry toward reliable, application-ready computational models.
Various computational fluid dynamic simulations in engineering, such as external aerodynamics, only need the silhouette of an input geometry. Often, it is a laborious process that can take up many human hours. In addition, the CAD geometries are too complex and contain intricate features and topological holes. We showcase an effortless way to shrink-wrap triangulated surfaces with the sole intent of topology and surface simplification. Building upon the concepts of mathematical morphology and newer advancements in geometry processing, we present a straightforward and robust algorithm that can guarantee genus-zero surfaces. Our techniques are equally applicable to general polyhedral meshes and well-suited for handling both oriented and unoriented point clouds. We provide examples using unoriented point clouds to demonstrate the versatility of our algorithms. We have designed our algorithms with a wide variety of applications in mind. However, we specifically highlight their capability for aerodynamic simulations, fluid volume extraction, and surface simplification. Additionally, we emphasize the practicality and ease of implementing the proposed algorithms, and we chain additional algorithms to develop variants of our wrap algorithm.
Triangulated meshes discretized from commercial CAD applications often possess a considerable level of complexity. However, when conducting external aerodynamics simulations at an earlier design stage, these meshes are way too complex and contain complex features and topological holes. We propose a practical and fast algorithm to shrink wrap triangulated surfaces with the sole intent of topology and surface simplification. Building upon the concepts of mathematical morphology and newer advancements in geometry processing, such as generalized winding numbers, we show that it is possible to build a straightforward and robust algorithm that can guarantee genus-zero surfaces. Our approach uses a Cartesian background mesh (fixed and adaptive) to approximate an input triangulated surface's interior and exterior volume. We use an octree data structure for adaptive mesh refinement. Although we demonstrate our algorithm exclusively on triangulated meshes, they are equally applicable to general polyhedral meshes. They are also well suited for handling point clouds (oriented and unoriented), and we show some examples of the same with some unoriented point clouds. We built our algorithms with a wide variety of applications in mind. However, we showcase the applicability of our algorithms for aerodynamic simulations, fluid volume extraction, and surface simplification. We also emphasize the practicality and ease of implementation of the proposed algorithms. We also compare our algorithms with existing literature.
We present a simple and fast algorithm for computing the exact holes in discrete two-dimensional manifolds embedded in a threedimensional Euclidean space. We deal with the intentionally created "through holes" or "tunnel holes" in the geometry as opposed to missing triangles. The algorithm detects the holes in the geometry directly without any simplified geometry approximation. Discrete Gaussian curvature is used for approximating the local curvature flow in the geometry and for removing outliers from the collection of feature edges. We present an algorithm with varying degrees of flexibility. The algorithm is demonstrated separately for sheets and solid geometries. This article demonstrates the algorithm on triangulated surfaces. However, the algorithm and the underlying data structure are also applicable for surfaces with mixed polygons.