Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Davide Sobrero

dblp:62/118 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2006
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 3

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
1 paper
Geometric modeling and processing · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Geometric modeling and processing
mesh processing
0.012004
A multi-resolution topological representation for non-manifold meshes · Comput. Aided Des. 2004
Geometric modeling and processing › shape representation
multiresolution modeling
0.012004
A multi-resolution topological representation for non-manifold meshes · Comput. Aided Des. 2004

Methods — techniques the papers use, named apart from their topics

topological representation · 0.0
YearPublicationVenuePosition
2006 Level-of-detail for data analysis and exploration: A historical overview and some new perspectives
Emanuele Danovaro, Leila De Floriani, Paola Magillo, Enrico Puppo, Davide Sobrero
Comput. Graph.5
2005 The Half-Edge Tree: A Compact Data Structure for Level-of-Detail Tetrahedral Meshes
abstract
We propose a new data structure for the compact encoding of a level-of detail (LOD) model of a three-dimensional scalar field based on unstructured tetrahedral meshes. Such data structure, called a half-edge tree (HET), is built through the iterative application of a half-edge collapse, i.e. by contracting an edge to one of its endpoints. We also show that selective refined meshes extracted from an HET contain on average about 34% and up to 75% less tetrahedra than those extracted from an LOD model built through a general edge collapse.
Emanuele Danovaro, Leila De Floriani, Paola Magillo, Enrico Puppo, Davide Sobrero, Neta Sokolovsky
SMI5
2004 A multi-resolution topological representation for non-manifold meshes
Leila De Floriani, Paola Magillo, Enrico Puppo, Davide Sobrero
Comput. Aided Des.4