Ríos, ÀlexNavazo, IsabelXavier PueyoManuel Próspero dos SantosLuiz Velho2023-01-242023-01-242022978-3-03868-194-6https://doi.org/10.2312/pt.20021417https://diglib.eg.org:443/handle/10.2312/pt20021417Visibility determination is a requirement to navigate through complex scenes. Occluder fusion algorithms generate convex occluders that are contained in the umbra cast by a group of objects given an area light. Hoops are non-convex, but view-dependent convex, non-planar closed polylines that can be used to compute occlusion for objects that not necessarily have large interior convex sets. ln this paper we present an efficient, robust, and incremental octree-based algorithm to synthesize hoops for a set of objects and to compute the hoopís umbra. Experimental results demonstrate the techniqueís effectiveness to compute occluder fusion of non-convex objects.Attribution 4.0 International LicenseVisibility Culling, occluder synthesis, occluder fusion, octree representationVisibility Cullingoccluder synthesisoccluder fusionoctree representation10.2312/pt.20021417225-2339 pages