Efficiently parallelised algorithm to find isoptic surface of polyhedral meshes

DOI10.33039/AMI.2020.05.002MaRDI QIDQ5855822zbMATH OpenOpenAlexFDO

Authors Ferenc Nagy

Publication date 20 March 2021

Published in Annales Mathematicae et Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.33039/ami.2020.05.002

zbMATH Keywords

CUDAisoptic surfacenested parallelismparallel algorithm

Mathematics Subject Classification ID

Computer-aided design (modeling of curves and surfaces) (65D17) Parallel numerical computation (65Y05) Numerical algorithms for specific classes of architectures (65Y10) Computer science aspects of computer-aided design (68U07)

Recommendations

• New algorithm to find isoptic surfaces of polyhedral meshes
• An efficient and scalable parallel algorithm for out-of-core isosurface extraction and rendering
• On the isotopic meshing of an algebraic implicit surface
• Massively parallel approximation of irregular triangular meshes of arbitrary topology with smooth parametric surfaces
• A parallel multistage method for surface/surface intersection
• Parallel geometric algorithms on a mesh-connected computer

Cited in

(4)

• Isoptic surfaces of polyhedra
• New algorithm to find isoptic surfaces of polyhedral meshes
• On the isoptic hypersurfaces in the n-dimensional Euclidean space
• Output-sensitive generation of the perspective view of isothetic parallelepipeds

This page was built for publication: Efficiently parallelised algorithm to find isoptic surface of polyhedral meshes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5855822)