Enrico Puppo

Enrico Puppo

Auto-generated profile, based on publicly available information

Enrico Puppo

University of Genoa

Research Focus & Metrics

Academic Career Length

40Years (1987-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 March 2013 in Computer Graphics Forum
Verified
Journal Article
Closed access
PDF file
DBDavid Bommes
David Bommes
BLBruno Lévy
Bruno Lévy
NPNico Pietroni
Nico Pietroni
EPEnrico Puppo
Enrico Puppo
CSClaudio Silva
Claudio Silva
DZDenis Zorin
Denis Zorin

1 May 2010 in Computer Graphics Forum
Verified
Journal Article
Closed access
PDF file
MTMarco Tarini
Marco Tarini
NPNico Pietroni
Nico Pietroni
Paolo CignoniPaolo Cignoni
Paolo Cignoni
DPDaniele Panozzo
Daniele Panozzo
EPEnrico Puppo
Enrico Puppo

1 July 1994 in International Journal of Geographical Information Science
Verified
Journal Article
Closed access
LFLeila De Floriani
Leila De Floriani
PMPaola Marzano
Paola Marzano
EPEnrico Puppo
Enrico Puppo
Line-of-sight communication on topographic surfaces has relevance for several applications of Geographical Information Systems. In this paper, we study the problem of linking a set of transceiver stations in a visibility-connected communication network, by placing a minimum number of relays on the terrain surface. The problem is studied in the framework of a discrete visibility model, where the mutual visibility of a finite set of sites on the terrain is represented through a graph, called the visibility graph. While in the special case of only two transceivers an optimal solution can be found in polynomial time, by computing a minimum path on the visibility graph, the general problem is equivalent to a Steiner problem on the visibility graph, and, thus, it is untractable in practice. In the latter case, we propose a practical approximate solution based on a Steiner heuristic. For both the special and the general case, we propose both a static and a dynamic algorithm that allow computation of a solution, and we show experimental results.

1 January 1997 in IEEE Transactions on Visualization and Computer Graphics
Verified
Journal Article
Closed access
Paolo CignoniPaolo Cignoni
Paolo Cignoni
PMP. Marino
P. Marino
CMC. Montani
C. Montani
EPE. Puppo
E. Puppo
RSR. Scopigno
R. Scopigno
The interval tree is an optimally efficient search structure proposed by Edelsbrunner [5] to retrieve intervals on the real line that contain a given query value. We propose the application of such a data structure to the fast location of cells intersected by an isosurface in a volume dataset. The resulting search method can be applied to both structured and unstructured volume datasets, and it can be applied incrementally to exploit coherence between isosurfaces. We also address issues about storage requirements, and operations other than the location of cells, whose impact is relevant in the whole isosurface extraction task.In the case of unstructured grids, the overhead, due to the search structure, is compatible with the storage cost of the dataset, and local coherence in the computation of isosurface patches is exploited through a hash table. In the case of a structured dataset, a new conceptual organization is adopted, called the chess-board approach, which exploits the regular structure of the dataset to reduce memory usage and to exploit local coherence. In both cases, efficiency in the computation of surface normals on the isosurface is obtained by a precomputation of the gradients at the vertices of the mesh.Experiments on different kinds of input show that the practical performance of the method reflects its theoretical optimality.

27 July 2014 in ACM Transactions on Graphics
Verified
Journal Article
Open access
DPDaniele Panozzo
Daniele Panozzo
EPEnrico Puppo
Enrico Puppo
MTMarco Tarini
Marco Tarini
OSOlga Sorkine-Hornung
Olga Sorkine-Hornung
We introduce frame fields, which are a non-orthogonal and non-unit-length generalization of cross fields. Frame fields represent smoothly varying linear transformations on tangent spaces of a surface. We propose an algorithm to create discrete, dense frame fields that satisfy a sparse set of constraints. By computing a surface deformation that warps a frame field into a cross field, we generalize existing quadrangulation algorithms to generate anisotropic and non-uniform quad meshes whose elements shapes match the frame field. With this, our framework enables users to control not only the alignment but also the density and anisotropy of the elements' distribution, resulting in high-quality adaptive quad meshing.

1 October 1995 in ACM Transactions on Graphics
Verified
Journal Article
Open access
LFLeila De Floriani
Leila De Floriani
EPEnrico Puppo
Enrico Puppo
A new hierarchical triangle-based model for representing surfaces over sampled data is proposed, which is based on the subdivision of the surface domain into nested triangulations, called a hierarchical triangulation (HT) . The model allows compression of spatial data and representation of a surface at successively finer degrees of resolution. An HT is a collection of triangulations organized in a tree, where each node, except for the root, is a triangulation refining a face belonging to its parent in the hierarchy. We present a topological model for representing an HT, and algorithms for its construction and for the extraction of a triangulation at a given degree of resolution. The surface model, called a hierarchical triangulated surface (HTS) is obtained by associating data values with the vertices of triangles, and by defining suitable functions that describe the surface over each triangular patch. We consider an application of a piecewise-linear version of the HTS to interpolate topographical data, and we describe a specialized version of the construction algorithm that builds an HTS for a terrain starting from a high-resolution rectangular grid of sampled data. Finally, we present an algorithm for extracting representations of terrain at variable resolution over the domain.