2008
Conference article
Restricted
3D enhanced model from multiple data sources for the analysis of the Cylinder seal of Ibni-Sharrum
Cignoni P., Pitzalis D., Menu M., Aitken G.
In this paper we present the result of the integration of multiple data sources of different 3D acquisition techniques. These acquisitions have been done in order to create a new way to document works of art that have been applied to the "Cylinder seal of Ibni-Sharrum". X-ray tomography has been used to reveal the exact position of inclusions and the presence fissure in the mineral structure; optical micro topography gives the prints of the surface of the seal with a unparallelled precision of up to 0.1?m. Finally a lower resolution 3D model obtained via photogrammetry has been used as a starting point where the tomographic and micro topographic data sets have been superimposed and integrated without precision loss. Furthermore, the textures obtained from HDR photographs has been registered and merged onto the high resolution mesh. These methods have pros and cons that will be discussed and the final obtained model will be the sum of all the complementary cons. The final result of this interdisciplinary investigation will help the curator to better describe the fabrication tech- niques used in order to achieve the final object and a contemporary artist to do a reproduction of the cylinder at a scale of 1000:1.Source: The 9th International Symposium on VAST International Symposium on Virtual Reality, Archaeology and Cultural Heritage, pp. 79–84, Braga, Portugal, 2-5 December 2008
DOI: 10.2312/vast/vast08/079-084
Metrics:
Cignoni P., Pitzalis D., Menu M., Aitken G.
In this paper we present the result of the integration of multiple data sources of different 3D acquisition techniques. These acquisitions have been done in order to create a new way to document works of art that have been applied to the "Cylinder seal of Ibni-Sharrum". X-ray tomography has been used to reveal the exact position of inclusions and the presence fissure in the mineral structure; optical micro topography gives the prints of the surface of the seal with a unparallelled precision of up to 0.1?m. Finally a lower resolution 3D model obtained via photogrammetry has been used as a starting point where the tomographic and micro topographic data sets have been superimposed and integrated without precision loss. Furthermore, the textures obtained from HDR photographs has been registered and merged onto the high resolution mesh. These methods have pros and cons that will be discussed and the final obtained model will be the sum of all the complementary cons. The final result of this interdisciplinary investigation will help the curator to better describe the fabrication tech- niques used in order to achieve the final object and a contemporary artist to do a reproduction of the cylinder at a scale of 1000:1.Source: The 9th International Symposium on VAST International Symposium on Virtual Reality, Archaeology and Cultural Heritage, pp. 79–84, Braga, Portugal, 2-5 December 2008
DOI: 10.2312/vast/vast08/079-084
Metrics:
See at:
diglib.eg.org 
| CNR ExploRA
2006
Other
Unknown
See at: CNR ExploRA
2006
Software
Unknown
QuteMol
Marco Tarini, Paolo Cignoni
QuteMol is an open source (GPL), interactive, high quality molecular visualization system. QuteMol exploits the current GPU capabilites through OpenGL shaders to offers an array of innovative visual effects. QuteMol visualization techniques are aimed at improving clarity and an easier understanding of the 3D shape and structure of large molecules or complex proteins.
Marco Tarini, Paolo Cignoni
QuteMol is an open source (GPL), interactive, high quality molecular visualization system. QuteMol exploits the current GPU capabilites through OpenGL shaders to offers an array of innovative visual effects. QuteMol visualization techniques are aimed at improving clarity and an easier understanding of the 3D shape and structure of large molecules or complex proteins.
See at: CNR ExploRA
2006
Software
Unknown
Metro
Cignoni P.
Metro: strumento per il confronto geometrico di superfici triangolate basato sulla misura di Hausdorff. Il sistema è diventato lo strumento di riferimento, da quasi dieci anni, nell'ambito della comunità scientifica internazionale. Metro, aggiornato regolarmente, è attualmente utilizzato praticamente da tutti i maggiori centri di ricerca nel mondo per valutare in modo oggettivo la differenza tra due superfici triangolate. Più di 350 articoli scientifici ne citano esplicitamente il suo utilizzo. Sorgente e binari sono distribuiti liberamente sotto licenza GPL.
Cignoni P.
Metro: strumento per il confronto geometrico di superfici triangolate basato sulla misura di Hausdorff. Il sistema è diventato lo strumento di riferimento, da quasi dieci anni, nell'ambito della comunità scientifica internazionale. Metro, aggiornato regolarmente, è attualmente utilizzato praticamente da tutti i maggiori centri di ricerca nel mondo per valutare in modo oggettivo la differenza tra due superfici triangolate. Più di 350 articoli scientifici ne citano esplicitamente il suo utilizzo. Sorgente e binari sono distribuiti liberamente sotto licenza GPL.
See at: CNR ExploRA
2016
Conference article
Restricted
Harvesting dynamic 3DWorlds from commodity sensor clouds
Boubekeur T., Cignoni P., Eisemann E.
The EU FP7 FET-Open project "Harvest4D: Harvesting Dynamic 3D Worlds from Commodity Sensor Clouds" deals with the acquisition, processing, and display of dynamic 3D data. Technological progress is offering us a wide-spread availability of sensing devices that deliver different data streams, which can be easily deployed in the real world and produce streams of sampled data with increased density and easier iteration of the sampling process. These data need to be processed and displayed in a new way. The Harvest4D project proposes a radical change in acquisition and processing technology: instead of a goaldriven acquisition that determines the devices and sensors, its methods let the sensors and resulting available data determine the acquisition process. A variety of challenging problems need to be solved: huge data amounts, different modalities, varying scales, dynamic, noisy and colorful data. This short contribution presents a selection of the many scientific results produced by Harvest4D. We will focus on those results that could bring a major impact to the Cultural Heritage domain, namely facilitating the acquisition of the sampled data or providing advanced visual analysis capabilities.Source: Eurographics Workshop on Graphics and Cultural Heritage, pp. 19–22, Genova, Italy, 5-7 October 2016
DOI: 10.2312/gch.20161378
Metrics:
Boubekeur T., Cignoni P., Eisemann E.
The EU FP7 FET-Open project "Harvest4D: Harvesting Dynamic 3D Worlds from Commodity Sensor Clouds" deals with the acquisition, processing, and display of dynamic 3D data. Technological progress is offering us a wide-spread availability of sensing devices that deliver different data streams, which can be easily deployed in the real world and produce streams of sampled data with increased density and easier iteration of the sampling process. These data need to be processed and displayed in a new way. The Harvest4D project proposes a radical change in acquisition and processing technology: instead of a goaldriven acquisition that determines the devices and sensors, its methods let the sensors and resulting available data determine the acquisition process. A variety of challenging problems need to be solved: huge data amounts, different modalities, varying scales, dynamic, noisy and colorful data. This short contribution presents a selection of the many scientific results produced by Harvest4D. We will focus on those results that could bring a major impact to the Cultural Heritage domain, namely facilitating the acquisition of the sampled data or providing advanced visual analysis capabilities.Source: Eurographics Workshop on Graphics and Cultural Heritage, pp. 19–22, Genova, Italy, 5-7 October 2016
DOI: 10.2312/gch.20161378
Metrics:
See at:
diglib.eg.org | CNR ExploRA
2017
Conference article
Unknown
Tecnologie 3D per i beni culturali
Cignoni P.
Le tecnologie digitali 3D stanno trasformando il modo in cui ricercatori, restauratori, curatori lavorano quotidianamente, fornendo nuovi modi per collaborare, documentare scavi e ritrovamenti e restaurare artefatti.Source: La siderurgia italiana tra storia economica e archeologia industriale, pp. 183–189, Piombino, Italy, 4-5 Marzo 2016
Cignoni P.
Le tecnologie digitali 3D stanno trasformando il modo in cui ricercatori, restauratori, curatori lavorano quotidianamente, fornendo nuovi modi per collaborare, documentare scavi e ritrovamenti e restaurare artefatti.Source: La siderurgia italiana tra storia economica e archeologia industriale, pp. 183–189, Piombino, Italy, 4-5 Marzo 2016
See at: CNR ExploRA
2022
Journal article
Open Access
SkinMixer: blending 3D animated models
Nuvoli S., Pietroni N., Cignoni P., Scateni R., Tarini M.
We propose a novel technique to compose new 3D animated models, such as videogame characters, by combining pieces from existing ones. Our method works on production-ready rigged, skinned, and animated 3D models to reassemble new ones. We exploit mix-and-match operations on the skeletons to trigger the automatic creation of a new mesh, linked to the new skeleton by a set of skinning weights and complete with a set of animations. The resulting model preserves the quality of the input meshings (which can be quad-dominant and semi-regular), skinning weights (inducing believable deformation), and animations, featuring coherent movements of the new skeleton. Our method enables content creators to reuse valuable, carefully designed assets by assembling new ready-to-use characters while preserving most of the hand-crafted subtleties of models authored by digital artists. As shown in the accompanying video, it allows for drastically cutting the time needed to obtain the final result.Source: ACM transactions on graphics 41 (2022): 1–15. doi:10.1145/3550454.3555503
DOI: 10.1145/3550454.3555503
Metrics:
Nuvoli S., Pietroni N., Cignoni P., Scateni R., Tarini M.
We propose a novel technique to compose new 3D animated models, such as videogame characters, by combining pieces from existing ones. Our method works on production-ready rigged, skinned, and animated 3D models to reassemble new ones. We exploit mix-and-match operations on the skeletons to trigger the automatic creation of a new mesh, linked to the new skeleton by a set of skinning weights and complete with a set of animations. The resulting model preserves the quality of the input meshings (which can be quad-dominant and semi-regular), skinning weights (inducing believable deformation), and animations, featuring coherent movements of the new skeleton. Our method enables content creators to reuse valuable, carefully designed assets by assembling new ready-to-use characters while preserving most of the hand-crafted subtleties of models authored by digital artists. As shown in the accompanying video, it allows for drastically cutting the time needed to obtain the final result.Source: ACM transactions on graphics 41 (2022): 1–15. doi:10.1145/3550454.3555503
DOI: 10.1145/3550454.3555503
Metrics:
See at:
ISTI Repository 
| dl.acm.org | CNR ExploRA
1998
Conference article
Unknown
Power diagram depth sorting
Cignoni P., De Floriani L.
An abstract is not available.Source: CCCG'98: 10th Canadian Conference on Computational Geometry., pp. 88–89, Montreal, May, 11 1998
Cignoni P., De Floriani L.
An abstract is not available.Source: CCCG'98: 10th Canadian Conference on Computational Geometry., pp. 88–89, Montreal, May, 11 1998
See at: CNR ExploRA
1998
Doctoral thesis
Open Access
Scientific Visualization based on Simplicial Complexes
Cignoni P.
The main objective of the thesis is the development of a complete and efficient set of solutions for the Scientific Visualization (SciViz), the computer science field which deals with the study, design and implementation of algorithms and data structures for the visualization of scientific data. We propose the adoption of the simplicial complexes as the unifying geometric structure and we show how the choice of this structure as kernel geometric primitive is effective both for the theoretical and practical aspects of SciViz. The contents of the thesis can be summarized as follows. We interpret the diversified SciViz process as a two-steps mapping problem: a modeling step, in which data are mapped into geometry with visual attributes, and a rendering step where geometry and visual attributes are transformed into images. As unifying geometric structure for the modeling step we propose the adoption of the simplicial complexes. To validate our approach we define new algorithms and data structures for the SciViz problems, based on the use of the simplicial complex as basic geometric representation scheme. In particular the thesis supplies original solutions and results to the following problems: 1. Visualization of scalar volume datasets: optimizing techniques for the extraction of isosurface and for the direct volume rendering; 2. Depth sorting of simplicial complexes (a fundamental topic for the efficient and correct use of direct volume rendering based on projective techniques); 3. Integration of isosurface extraction techniques and direct volume rendering techniques. Definition of the concept of discontinuous transfer functions; 4. Simplification of the geometric complexity of simplicial complexes (in order to speed up the visualization process) while minimizing the introduced error; 5. Multiresolution representation schemes for simplicial complexes. These schemes permit both the visualization of complexes at different levels of details and the visualization of a single complex in which different parts are at different resolution.
Cignoni P.
The main objective of the thesis is the development of a complete and efficient set of solutions for the Scientific Visualization (SciViz), the computer science field which deals with the study, design and implementation of algorithms and data structures for the visualization of scientific data. We propose the adoption of the simplicial complexes as the unifying geometric structure and we show how the choice of this structure as kernel geometric primitive is effective both for the theoretical and practical aspects of SciViz. The contents of the thesis can be summarized as follows. We interpret the diversified SciViz process as a two-steps mapping problem: a modeling step, in which data are mapped into geometry with visual attributes, and a rendering step where geometry and visual attributes are transformed into images. As unifying geometric structure for the modeling step we propose the adoption of the simplicial complexes. To validate our approach we define new algorithms and data structures for the SciViz problems, based on the use of the simplicial complex as basic geometric representation scheme. In particular the thesis supplies original solutions and results to the following problems: 1. Visualization of scalar volume datasets: optimizing techniques for the extraction of isosurface and for the direct volume rendering; 2. Depth sorting of simplicial complexes (a fundamental topic for the efficient and correct use of direct volume rendering based on projective techniques); 3. Integration of isosurface extraction techniques and direct volume rendering techniques. Definition of the concept of discontinuous transfer functions; 4. Simplification of the geometric complexity of simplicial complexes (in order to speed up the visualization process) while minimizing the introduced error; 5. Multiresolution representation schemes for simplicial complexes. These schemes permit both the visualization of complexes at different levels of details and the visualization of a single complex in which different parts are at different resolution.
See at:
ISTI Repository | CNR ExploRA
2020
Journal article
Restricted
DHFSlicer: Double Height-Field Slicing for Milling Fixed-Height Materials
Yang J., Araujo C., Vining N., Ferguson Z., Rosales E., Panozzo D., Lefevbre S., Cignoni P., Sheffer A.
3-axis milling enables cheap and precise fabrication of target objects from precut slabs of materials such as wood or stone. However, the space of directly millable shapes is limited since a 3-axis mill can only carve a height-field (HF) surface during each milling and their size is bounded by the slab dimensions, one of which, the height, is typically significantly smaller than the other two for many typical materials. Extending 3-axis milling of precut slabs to general arbitrarily-sized shapes requires decomposing them into bounded-height 3-axis millable parts, or slices, which can be individually milled and then assembled to form the target object. We present DHFSlicer, a novel decomposition method that satisfies the above constraints and significantly reduces both milling time and material waste compared to alternative approaches. We satisfy the fabrication constraints by partitioning target objects into double height-field (DHF) slices, which can be fabricated using two milling passes: the HF surface accessible from one side is milled first, the slice is then flipped using appropriate fixtures, and then the second, remaining, HF surface is milled. DHFSlicer uses an efficient coarse-to-fine decomposition process: It first partitions the inputs into maximally coarse blocks that satisfy a local DHF criterion with respect to per-block milling axes, and then cuts each block into well-sized DHF slices. It minimizes milling time and material waste by keeping the slice count small, and maximizing slice height. We validate our method by embedding it within an end-to-end DHF milling pipeline and fabricating objects from slabs of foam, wood, and MDF; demonstrate that using the obtained slices reduces milling time and material waste by 42% on average compared to existing automatic alternatives; and highlight the benefits of DHFSlicer via extensive ablation studies.Source: ACM transactions on graphics 39 (2020). doi:10.1145/3414685.3417810
DOI: 10.1145/3414685.3417810
Metrics:
Yang J., Araujo C., Vining N., Ferguson Z., Rosales E., Panozzo D., Lefevbre S., Cignoni P., Sheffer A.
3-axis milling enables cheap and precise fabrication of target objects from precut slabs of materials such as wood or stone. However, the space of directly millable shapes is limited since a 3-axis mill can only carve a height-field (HF) surface during each milling and their size is bounded by the slab dimensions, one of which, the height, is typically significantly smaller than the other two for many typical materials. Extending 3-axis milling of precut slabs to general arbitrarily-sized shapes requires decomposing them into bounded-height 3-axis millable parts, or slices, which can be individually milled and then assembled to form the target object. We present DHFSlicer, a novel decomposition method that satisfies the above constraints and significantly reduces both milling time and material waste compared to alternative approaches. We satisfy the fabrication constraints by partitioning target objects into double height-field (DHF) slices, which can be fabricated using two milling passes: the HF surface accessible from one side is milled first, the slice is then flipped using appropriate fixtures, and then the second, remaining, HF surface is milled. DHFSlicer uses an efficient coarse-to-fine decomposition process: It first partitions the inputs into maximally coarse blocks that satisfy a local DHF criterion with respect to per-block milling axes, and then cuts each block into well-sized DHF slices. It minimizes milling time and material waste by keeping the slice count small, and maximizing slice height. We validate our method by embedding it within an end-to-end DHF milling pipeline and fabricating objects from slabs of foam, wood, and MDF; demonstrate that using the obtained slices reduces milling time and material waste by 42% on average compared to existing automatic alternatives; and highlight the benefits of DHFSlicer via extensive ablation studies.Source: ACM transactions on graphics 39 (2020). doi:10.1145/3414685.3417810
DOI: 10.1145/3414685.3417810
Metrics:
See at:
dl.acm.org | ACM Transactions on Graphics | INRIA a CCSD electronic archive server | CNR ExploRA
2021
Contribution to book
Open Access
Documentazione digitale avanzata in emergenza
Cignoni P.
Il contributo descrive la campagna di acquisizione condotta nel maggio 2020 in seguito al ritrovamento di una serie di sepolture di epoca romana durante alcuni scavi per manutenzione delle condotte idriche.Source: Emergenze etrusche e romane nell'anno del Covid-19, edited by Andrea Camilli, Carolina Megali, pp. 76–79. Pisa: Pacini Editore, 2021
Cignoni P.
Il contributo descrive la campagna di acquisizione condotta nel maggio 2020 in seguito al ritrovamento di una serie di sepolture di epoca romana durante alcuni scavi per manutenzione delle condotte idriche.Source: Emergenze etrusche e romane nell'anno del Covid-19, edited by Andrea Camilli, Carolina Megali, pp. 76–79. Pisa: Pacini Editore, 2021
See at:
ISTI Repository | CNR ExploRA
2021
Journal article
Open Access
Texture Defragmentation for Photo-Reconstructed 3D Models
Maggiordomo A, Cignoni P., Tarini M.
We propose a method to improve an existing parametrization (UV-map layout) of a textured 3D model, targeted explicitly at alleviating typical defects afflicting models generated with automatic photo-reconstruction tools from real-world objects. This class of 3D data is becoming increasingly important thanks to the growing popularity of reliable, ready-to-use photogrammetry software packages. The resulting textured models are richly detailed, but their underlying parametrization typically falls short of many practical requirements, particularly exhibiting excessive fragmentation and consequent problems. Producing a completely new UV-map, with standard parametrization techniques, and then resampling a new texture image, is often neither practical nor desirable for at least two reasons: first, these models have characteristics (such as inconsistencies, high resolution) that make them unfit for automatic or manual parametrization; second, the required resampling leads to unnecessary signal degradation because this process is unaware of the original texel densities. In contrast, our method improves the existing UV-map instead of replacing it, balancing the reduction of the map fragmentation with signal degradation due to resampling, while also avoiding oversampling of the original signal. The proposed approach is fully automatic and extensively tested on a large benchmark of photo-reconstructed models; quantitative evaluation evidences a drastic and consistent improvement of the mappingsSource: Computer graphics forum (Online) 40 (2021): 65–78. doi:10.1111/cgf.142615
DOI: 10.1111/cgf.142615
Project(s): ARIADNEplus
Metrics:
Maggiordomo A, Cignoni P., Tarini M.
We propose a method to improve an existing parametrization (UV-map layout) of a textured 3D model, targeted explicitly at alleviating typical defects afflicting models generated with automatic photo-reconstruction tools from real-world objects. This class of 3D data is becoming increasingly important thanks to the growing popularity of reliable, ready-to-use photogrammetry software packages. The resulting textured models are richly detailed, but their underlying parametrization typically falls short of many practical requirements, particularly exhibiting excessive fragmentation and consequent problems. Producing a completely new UV-map, with standard parametrization techniques, and then resampling a new texture image, is often neither practical nor desirable for at least two reasons: first, these models have characteristics (such as inconsistencies, high resolution) that make them unfit for automatic or manual parametrization; second, the required resampling leads to unnecessary signal degradation because this process is unaware of the original texel densities. In contrast, our method improves the existing UV-map instead of replacing it, balancing the reduction of the map fragmentation with signal degradation due to resampling, while also avoiding oversampling of the original signal. The proposed approach is fully automatic and extensively tested on a large benchmark of photo-reconstructed models; quantitative evaluation evidences a drastic and consistent improvement of the mappingsSource: Computer graphics forum (Online) 40 (2021): 65–78. doi:10.1111/cgf.142615
DOI: 10.1111/cgf.142615
Project(s): ARIADNEplus
Metrics:
See at:
diglib.eg.org | ISTI Repository | CNR ExploRA
2023
Journal article
Open Access
Texture inpainting for photogrammetric models
Maggiordomo A., Cignoni P., Tarini M.
We devise a technique designed to remove the texturing artefacts that are typical of 3D models representing real-world objects, acquired by photogrammetric techniques. Our technique leverages the recent advancements in inpainting of natural colour images, adapting them to the specific context. A neural network, modified and trained for our purposes, replaces the texture areas containing the defects, substituting them with new plausible patches of texels, reconstructed from the surrounding surface texture. We train and apply the network model on locally reparametrized texture patches, so to provide an input that simplifies the learning process, because it avoids any texture seams, unused texture areas, background, depth jumps and so on. We automatically extract appropriate training data from real-world datasets. We show two applications of the resulting method: one, as a fully automatic tool, addressing all problems that can be detected by analysing the UV-map of the input model; and another, as an interactive semi-automatic tool, presented to the user as a 3D 'fixing' brush that has the effect of removing artefacts from any zone the users paints on. We demonstrate our method on a variety of real-world inputs and provide a reference usable implementation.Source: Computer graphics forum (Print) (2023). doi:10.1111/cgf.14735
DOI: 10.1111/cgf.14735
Project(s): SUN
Metrics:
Maggiordomo A., Cignoni P., Tarini M.
We devise a technique designed to remove the texturing artefacts that are typical of 3D models representing real-world objects, acquired by photogrammetric techniques. Our technique leverages the recent advancements in inpainting of natural colour images, adapting them to the specific context. A neural network, modified and trained for our purposes, replaces the texture areas containing the defects, substituting them with new plausible patches of texels, reconstructed from the surrounding surface texture. We train and apply the network model on locally reparametrized texture patches, so to provide an input that simplifies the learning process, because it avoids any texture seams, unused texture areas, background, depth jumps and so on. We automatically extract appropriate training data from real-world datasets. We show two applications of the resulting method: one, as a fully automatic tool, addressing all problems that can be detected by analysing the UV-map of the input model; and another, as an interactive semi-automatic tool, presented to the user as a 3D 'fixing' brush that has the effect of removing artefacts from any zone the users paints on. We demonstrate our method on a variety of real-world inputs and provide a reference usable implementation.Source: Computer graphics forum (Print) (2023). doi:10.1111/cgf.14735
DOI: 10.1111/cgf.14735
Project(s): SUN
Metrics:
See at:
onlinelibrary.wiley.com | ISTI Repository | ZENODO | CNR ExploRA
2004
Journal article
Restricted
Selective refinement queries for volume visualization of unstructured tetrahedral meshes
Cignoni P., De Floriani L., Magillo P., Puppo E., Scopigno R.
In this paper, we address the problem of the efficient visualization of large irregular volume data sets by exploiting a multiresolution model based on tetrahedral meshes. Multiresolution models, also called Level-Of-Detail (LOD) models, allow encoding the whole data set at a virtually continuous range of di.erent resolutions. We have identi.ed a set of queries for extracting meshes at variable resolution from a multiresolution model, based on field values, domain location, or opacity of the transfer function. Such queries allow trading-off between resolution and speed in visualization. We de.ne a new compact data structure for encoding a multiresolution tetrahedral mesh built through edge collapses to support selective refinement efficiently, and show that such a structure has a storage cost from 3 to 5.5 times lower than standard data structures used for tetrahedral meshes. The data structures and variable resolution queries have been implemented together with state-of-the art visualization techniques in a system for the interactive visualization of three-dimensional scalar fields defined on tetrahedral meshes. Experimental results show that selective refinement queries can support interactive visualization of large datasets.Source: IEEE transactions on visualization and computer graphics 10 (2004): 29–45. doi:10.1109/TVCG.2004.1260756
DOI: 10.1109/tvcg.2004.1260756
Metrics:
Cignoni P., De Floriani L., Magillo P., Puppo E., Scopigno R.
In this paper, we address the problem of the efficient visualization of large irregular volume data sets by exploiting a multiresolution model based on tetrahedral meshes. Multiresolution models, also called Level-Of-Detail (LOD) models, allow encoding the whole data set at a virtually continuous range of di.erent resolutions. We have identi.ed a set of queries for extracting meshes at variable resolution from a multiresolution model, based on field values, domain location, or opacity of the transfer function. Such queries allow trading-off between resolution and speed in visualization. We de.ne a new compact data structure for encoding a multiresolution tetrahedral mesh built through edge collapses to support selective refinement efficiently, and show that such a structure has a storage cost from 3 to 5.5 times lower than standard data structures used for tetrahedral meshes. The data structures and variable resolution queries have been implemented together with state-of-the art visualization techniques in a system for the interactive visualization of three-dimensional scalar fields defined on tetrahedral meshes. Experimental results show that selective refinement queries can support interactive visualization of large datasets.Source: IEEE transactions on visualization and computer graphics 10 (2004): 29–45. doi:10.1109/TVCG.2004.1260756
DOI: 10.1109/tvcg.2004.1260756
Metrics:
See at:
IEEE Transactions on Visualization and Computer Graphics | CNR ExploRA
2005
Journal article
Open Access
Pinchmaps: textures with customizable discontinuities
Tarini M., Cignoni P.
We introduce a new texture representation that combines standard bi-linearly interpolated samples, for smoothly varying regions, with customizable discontinuities for sharp boundaries between these regions. It consists in a standard signal texture, plus a second texture we call pinchmap, which encodes discontinuities along generally curved lines; this structure is stored in texture memory as a pair of images and is efficiently interpreted on commodity graphic hardware in the fragment shader. We also present a fully automatic way to compute a pinchmap and signal texture pair from an much higher resolution image. We show that the nal effect on the screen is a comparable visual quality, for a fraction of the texture storage cost and a very small impact on performance.Source: Computer graphics forum (Print) 24 (2005): 557–568. doi:10.1111/j.1467-8659.2005.00881.x
DOI: 10.1111/j.1467-8659.2005.00881.x
Metrics:
Tarini M., Cignoni P.
We introduce a new texture representation that combines standard bi-linearly interpolated samples, for smoothly varying regions, with customizable discontinuities for sharp boundaries between these regions. It consists in a standard signal texture, plus a second texture we call pinchmap, which encodes discontinuities along generally curved lines; this structure is stored in texture memory as a pair of images and is efficiently interpreted on commodity graphic hardware in the fragment shader. We also present a fully automatic way to compute a pinchmap and signal texture pair from an much higher resolution image. We show that the nal effect on the screen is a comparable visual quality, for a fraction of the texture storage cost and a very small impact on performance.Source: Computer graphics forum (Print) 24 (2005): 557–568. doi:10.1111/j.1467-8659.2005.00881.x
DOI: 10.1111/j.1467-8659.2005.00881.x
Metrics:
See at:
Computer Graphics Forum | Computer Graphics Forum | CNR ExploRA
2006
Journal article
Restricted
Ambient occlusion and edge cueing to enhance real time molecular visualization
Tarini M., Cignoni P., Montani C.
The paper presents a set of combined techniques to enhance the real-time visualization of simple or complex molecules (up to order of 10^6 atoms) space fill mode. The proposed approach includes an innovative technique for efficient computation and storage of ambient occlusion terms, a small set of GPU accelerated procedural impostors for space-fill and ball-and-stick rendering, and novel edge-cueing techniques. As a result, the user's understanding of the three-dimensional structure under inspection is strongly increased (even for still images), while the rendering still occurs in real time.Source: IEEE transactions on visualization and computer graphics 12 (2006): 1237–1244. doi:10.1109/TVCG.2006.115
DOI: 10.1109/tvcg.2006.115
Metrics:
Tarini M., Cignoni P., Montani C.
The paper presents a set of combined techniques to enhance the real-time visualization of simple or complex molecules (up to order of 10^6 atoms) space fill mode. The proposed approach includes an innovative technique for efficient computation and storage of ambient occlusion terms, a small set of GPU accelerated procedural impostors for space-fill and ball-and-stick rendering, and novel edge-cueing techniques. As a result, the user's understanding of the three-dimensional structure under inspection is strongly increased (even for still images), while the rendering still occurs in real time.Source: IEEE transactions on visualization and computer graphics 12 (2006): 1237–1244. doi:10.1109/TVCG.2006.115
DOI: 10.1109/tvcg.2006.115
Metrics:
See at:
IEEE Transactions on Visualization and Computer Graphics | ieeexplore.ieee.org | CNR ExploRA
2010
Journal article
Open Access
Shape enhancement for rapid prototyping
Pintus R., Gobbetti E., Cignoni P., Scopigno R.
Many applications, for instance, in the reverse engineering and cultural heritage field, require building a physical replica of 3D digital models. Recent 3D printers can easily perform this task in a relatively short time and using color to reproduce object textures. However, the finite resolution of printers and, most of all, some peculiar optical and physical properties of the used materials reduce their perceptual quality. The contribution of this paper is a shape enhancing technique which allows users to increase readability of the tiniest details in physical replicas, without requiring manual post-reproduction interventions.Source: The visual computer 26 (2010): 831–840. doi:10.1007/s00371-010-0488-0
DOI: 10.1007/s00371-010-0488-0
Metrics:
Pintus R., Gobbetti E., Cignoni P., Scopigno R.
Many applications, for instance, in the reverse engineering and cultural heritage field, require building a physical replica of 3D digital models. Recent 3D printers can easily perform this task in a relatively short time and using color to reproduce object textures. However, the finite resolution of printers and, most of all, some peculiar optical and physical properties of the used materials reduce their perceptual quality. The contribution of this paper is a shape enhancing technique which allows users to increase readability of the tiniest details in physical replicas, without requiring manual post-reproduction interventions.Source: The visual computer 26 (2010): 831–840. doi:10.1007/s00371-010-0488-0
DOI: 10.1007/s00371-010-0488-0
Metrics:
See at:
The Visual Computer | The Visual Computer | link.springer.com | CNR ExploRA
2005
Journal article
Restricted
A six-degrees-of-freedom planning algorithm for the acquisition of complex surfaces
Impoco G., Cignoni P., Scopigno R.
The models produced by means of the available 3D-scanning technologies are considered accurate enough for most applications. Unfortunately, the acquisition of complex objects is still a demanding process that cannot be performed by non-specialists. Among the open problems, one of the most difficult to grasp is the planning of the acquisition session, i.e. choosing a set of positions of the scanner to view the whole surface of the object. Most of the algorithms proposed in the literature either can handle few degrees-of-freedom (DOFs) or are too burdensome, as they require the optimisation of complex objective functions. Hence, they are in trouble when dealing with complex surfaces. We propose a full 6-DOF pose-planning algorithm that is simple and easy to implement. We do not search for the next best view (NBV) to minimise the number of acquisitions, as most previous algorithms do. Rather, we pursue the less ambitious objective of finding a (possibly small) set of views, that guarantee a complete coverage of the surface with a minimum accuracy on the sampled data. Given an incomplete model, unsampled regions are detected and simple patches are built to cover the missing surface. New views are estimated by clustering the normals to unsampled patches.Source: International journal of shape modeling 11 (2005): 1–23. doi:10.1142/S0218654305000700
DOI: 10.1142/s0218654305000700
Metrics:
Impoco G., Cignoni P., Scopigno R.
The models produced by means of the available 3D-scanning technologies are considered accurate enough for most applications. Unfortunately, the acquisition of complex objects is still a demanding process that cannot be performed by non-specialists. Among the open problems, one of the most difficult to grasp is the planning of the acquisition session, i.e. choosing a set of positions of the scanner to view the whole surface of the object. Most of the algorithms proposed in the literature either can handle few degrees-of-freedom (DOFs) or are too burdensome, as they require the optimisation of complex objective functions. Hence, they are in trouble when dealing with complex surfaces. We propose a full 6-DOF pose-planning algorithm that is simple and easy to implement. We do not search for the next best view (NBV) to minimise the number of acquisitions, as most previous algorithms do. Rather, we pursue the less ambitious objective of finding a (possibly small) set of views, that guarantee a complete coverage of the surface with a minimum accuracy on the sampled data. Given an incomplete model, unsampled regions are detected and simple patches are built to cover the missing surface. New views are estimated by clustering the normals to unsampled patches.Source: International journal of shape modeling 11 (2005): 1–23. doi:10.1142/S0218654305000700
DOI: 10.1142/s0218654305000700
Metrics:
See at:
International Journal of Shape Modeling | www.worldscinet.com | CNR ExploRA
2001
Journal article
Unknown
Generating random points in a tetrahedon
Rocchini C., Cignoni P.
This paper proposes a simple and efficient technique to generae uniformly random point in a tetrahedron.Source: Journal of graphics tools 5 (2001): 9–12.
Rocchini C., Cignoni P.
This paper proposes a simple and efficient technique to generae uniformly random point in a tetrahedron.Source: Journal of graphics tools 5 (2001): 9–12.
See at: CNR ExploRA