José Ramón Ojeda - Academia.edu (original) (raw)
Uploads
Papers by José Ramón Ojeda
ArXiv, 2022
This paper ∗ presents a GPU parallel algorithm to generate a new kind of polygonal meshes obtaine... more This paper ∗ presents a GPU parallel algorithm to generate a new kind of polygonal meshes obtained from Delaunay triangulations. To generate the polygonal mesh, the algorithm first uses a classification system to label each edge of an input triangulation; second it builds polygons (simple or not) from terminal-edge regions using the label system, and third it transforms each non-simple polygon from the previous phase into simple ones, convex or not convex polygons. We show some preliminary experiments to test the scalability of the algorithm and compare it with the sequential version. We also run a very simple test to show that these meshes can be useful for the virtual element method.
A known geometrical problem is to find low density zones (voids) in planar point sets and to repr... more A known geometrical problem is to find low density zones (voids) in planar point sets and to represent them as polygons. In this paper we recall the concept of terminal-edge region to identify subvoid candidates over a triangulation, present a linear algorithm to find subvoids taking as input a Delaunay triangulation, and show that this new strategy can be naturally parallelized using GPU computing. We also show preliminary experimental results.
ArXiv, 2022
This paper ∗ presents a GPU parallel algorithm to generate a new kind of polygonal meshes obtaine... more This paper ∗ presents a GPU parallel algorithm to generate a new kind of polygonal meshes obtained from Delaunay triangulations. To generate the polygonal mesh, the algorithm first uses a classification system to label each edge of an input triangulation; second it builds polygons (simple or not) from terminal-edge regions using the label system, and third it transforms each non-simple polygon from the previous phase into simple ones, convex or not convex polygons. We show some preliminary experiments to test the scalability of the algorithm and compare it with the sequential version. We also run a very simple test to show that these meshes can be useful for the virtual element method.
A known geometrical problem is to find low density zones (voids) in planar point sets and to repr... more A known geometrical problem is to find low density zones (voids) in planar point sets and to represent them as polygons. In this paper we recall the concept of terminal-edge region to identify subvoid candidates over a triangulation, present a linear algorithm to find subvoids taking as input a Delaunay triangulation, and show that this new strategy can be naturally parallelized using GPU computing. We also show preliminary experimental results.