New algorithm to find isoptic surfaces of polyhedral meshes

Efficiently parallelised algorithm to find isoptic surface of polyhedral meshes

“…Moreover, it takes around 20-40 minutes to display it, even for simple regular polyhedra. In [9], a faster, general algorithm was presented to determine the isoptic surface of a given polyhedral mesh. These results, including the precise definitions, will be briefly summarized in Section 2.…”

“…The latter algorithm is able to find and render the isoptic surface in case of concave objects as well independently of computer algebra systems, but for a mesh with a few hundred polygons, the process still takes several minutes. Our aim is to accelerate the algorithm of [9] to find the isoptic surface within a reasonable time, using general-purpose computing on graphics processing units (GPGPU).…”

“…The different levels of parallelism will be discussed separately, in Section 3 and in Section 4. The running times of the new GPU-based methods will be compared with the original version of the algorithm presented in [9] in Section 5.…”

“…The authors of the paper also presented an algorithm to determine isoptic surfaces of convex meshes. In [9] new searching algorithms are provided to find points of the isoptic surface of a triangulated model in E 3 . The new algorithms work for concave shapes as well.In this paper, we present a faster, simpler, and efficiently parallelised version of the algorithm of [9] that can be used to search for the points of the isoptic surface of a given closed polyhedral mesh, taking advantage of the computing capabilities of the high-performance graphics cards and using the benefits of nested parallelism.…”

“…The authors of the paper also presented an algorithm to determine isoptic surfaces of convex meshes. In [9] new searching algorithms are provided to find points of the isoptic surface of a triangulated model in E 3 . The new algorithms work for concave shapes as well.…”