This paper presents an algorithm for drawing a sequence of graphs online. The algorithm strives to maintain the global structure of the graph and thus the user's mental map, while allowing arbitrary modifications between consecutive layouts. The algorithm works online and uses various execution culling methods in order to reduce the layout time and handle large dynamic graphs. Techniques for representing graphs on the GPU allow a speedup by a factor of up to 17 compared to the CPU implementation. The scalability of the algorithm across GPU generations is demonstrated. Applications of the algorithm to the visualization of discussion threads in Internet sites and to the visualization of social networks are provided.
Jigsaw puzzle solving is an intriguing problem which has been explored in computer vision for decades. This paper focuses on a specific variant of the problem - solving puzzles with eroded boundaries. Such erosion makes the problem extremely difficult, since most existing solvers utilize solely the information at the boundaries. Nevertheless, this variant is important since erosion and missing data often occur at the boundaries. The key idea of our proposed approach is to inpaint the eroded boundaries between puzzle pieces and later leverage the quality of the inpainted area to classify a pair of pieces as 'neighbors or not'. An interesting feature of our architecture is that the same GAN discriminator is used for both inpainting and classification; Training of the second task is simply a continuation of the training of the first, beginning from the point it left off. We show that our approach outperforms other SOTA methods
We present an approach for extracting reliefs and details from relief surfaces. We consider a relief surface as a surface composed of two components: a base surface and a height function which is defined over this base. However, since the base surface is unknown, the decoupling of these components is a challenge. We show how to estimate a robust height function over the base, without explicitly extracting the base surface. This height function is utilized to separate the relief from the base. Several applications benefiting from this extraction are demonstrated, including relief segmentation, detail exaggeration and dampening, copying of details from one object to another, and curve drawing on meshes.
We present an algorithm that for a given simple non-convex polygon P finds an approximate inner-cover by large convex polygons. The algorithm is based on an initial partitioning of P into a set C of disjoint convex polygons which are an exact tessellation of P. The algorithm then builds a set of large convex polygons contained in P by constructing the convex hulls of subsets of C. We discuss different strategies for selecting the subsets and we claim that in most cases our algorithm produces an effective approximation of P.
Abstract Background Moloney murine leukemia virus (MLV) replication is suppressed in mouse embryonic stem cells (ESCs) by the Trim28-SETDB1 complex. The chromatin remodeler Smarcad1 interacts with Trim28 and was suggested to allow the deposition of the histone variant H3.3. However, the role of Trim28, H3.3, and Smarcad1 in MLV repression in ESCs still needs to be fully understood. Results In this study, we used MLV to explore the role of Smarcad1 in retroviral silencing in ESCs. We show that Smarcad1 is immediately recruited to the MLV provirus. Based on the repression dynamics of a GFP-reporter MLV, our findings suggest that Smarcad1 plays a critical role in the establishment and maintenance of MLV repression, as well as other Trim28-targeted genomic loci. Furthermore, Smarcad1 is important for stabilizing and strengthening Trim28 binding to the provirus over time, and its presence around the provirus is needed for proper deposition of H3.3 on the provirus. Surprisingly, the combined depletion of Smarcad1 and Trim28 results in enhanced MLV derepression, suggesting that these two proteins may also function independently to maintain repressive chromatin states. Conclusions Overall, the results of this study provide evidence for the crucial role of Smarcad1 in the silencing of retroviral elements in embryonic stem cells. Further research is needed to fully understand how Smarcad1 and Trim28 cooperate and their implications for gene expression and genomic stability.
Collision detection is a fundamental problem in computer graphics. In this paper, temporal coherence is studied and an algorithm exploiting it for bounding volume hierarchies, is presented. We show that maintaining some of the intersection tests computed in the previous frame, along with certain information, is able to speedup the intersection tests considerably. The algorithm is able to accelerate the collision detection for small motions and works as fast as the regular algorithm for large motions, where temporal coherence does not exist. The algorithm framework can be implemented for any type of bounding volume hierarchy. To demonstrate this, it was implemented for the OBB and the AABB data structures and tested on several benchmark scenarios.
