1,720,978 research outputs found
Scalable geometry processing for computer graphics applications
This thesis explores and investigates scalable solutions, grounded on geometry processing and differential geometry concepts, to different computer graphics tasks. My Ph.D. path gave me the opportunity to probe many research topics in the field of computer graphics, as well as delve into mathematical and computational problems. As a summary of my research activity, this thesis echoes my exploration, collecting results from different areas of computer graphics and computational geometry. From novel unified frameworks in spectral geometry to procedural texturing techniques, simulations, and matrix multiplication algorithms, all the discussed topics find their communion in the idea of providing geometry processing solutions made to scale for large volumes of data
Efficiently Parallelizable Strassen-Based Multiplication of a Matrix by its Transpose
The multiplication of a matrix by its transpose, , appears as an intermediate operation in the solution of a wide set of problems. In this paper, we propose a new cache-oblivious algorithm (ATA) for computing this product, based upon the classical Strassen algorithm as a sub-routine. In particular, we decrease the computational cost to the time required by Strassen\u27s algorithm, amounting to floating point operations. ATA works for generic rectangular matrices, and exploits the peculiar symmetry of the resulting product matrix for saving memory. In addition, we provide an extensive implementation study of ATA in a shared memory system, and extend its applicability to a distributed environment. To support our findings, we compare our algorithm with state-of-the-art solutions specialized in the computation of . Our experiments highlight good scalability with respect to both the matrix size and the number of involved processes, as well as favorable performance for both the parallel paradigms and the sequential implementation, when compared with other methods in the literature
Geometric aware local optimization for robust primitive fitting
The decomposition of 3D point clouds into meaningful geometric primitives is a longstanding challenge in Computer Vision and Computer Graphics. While recent advances in data-driven methods and neural representations have achieved significant progress in 3D reconstruction and abstraction, traditional primitive-based representations remain invaluable for tasks requiring interpretability, compactness, and robustness. This work introduces a novel framework for primitive decomposition in 2D and 3D point clouds, designed to cope with noise, outliers, and overlapping structures. Building upon traditional RANSACbased approaches, the proposed method integrates geometric priors to enhance its effectiveness in identifying interpretable and meaningful geometric primitives within complex data. Central to our approach is a novel geometric-aware inlier refinement step, which incorporates geometric constraints such as surface completeness and normal consistency. This refinement step is formulated as an optimization problem solved through the GRAPH-CUT algorithm. This optimization process penalizes excessive surface extensions and promotes coherence in normal orientations, ensuring that the refined inlier sets closely match the geometric structures the point cloud represents. Experiments on synthetic and real-world datasets validate the robustness and accuracy of the proposed method, demonstrating its ability to outperform state-of-the-art techniques in terms of both result quality and computational efficiency.Smart Tools and Applications in Graphics - Eurographics Italian Chapter ConferenceGeometry Processin
Smart Tools and Applications in Graphics - Eurographics Italian Chapter Conference: Frontmatter
Smart Tools and Applications in Graphics - Eurographics Italian Chapter Conferenc
Going Beyond Counting First Authors in Author Co-citation Analysis
The present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Variations on the Author
“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
Appropriate Similarity Measures for Author Cocitation Analysis
We provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis
Dispelling the Myths Behind First-author Citation Counts
We conducted a full-scale evaluative citation analysis study of scholars in the XML research field to explore just how different from each other author rankings resulting from different citation counting methods actually are, and to demonstrate the capability of emerging data and tools on the Web in supporting more realistic citation counting methods. Our results contest some common arguments for the continued
use of first-author citation counts in the evaluation of scholars, such as high correlations between author rankings by first-author citation counts and other citation
counting methods, and high costs of using more realistic citation counting methods that are not well-supported by the ISI databases. It is argued that increasingly available digital full text research papers make it possible for citation analysis studies to go beyond what the ISI databases have directly supported and to employ more
sophisticated methods
- …
