Pub Date : 1900-01-01DOI: 10.2312/LocalChapterEvents/ItalChap/ItalianChapConf2010/135-140
Mattia Natali, M. Attene, G. Ottonello
This paper describes an operational pipeline that exploits computational geometry to derive useful knowledge about the crystallization behaviour of materials composed of varying amounts of pure components. Starting from existing knowledge related to the pure components, we compute the Gibbs free energy of all their possible compositions in a given range of temperatures, both in liquid and solid phases. Then, we exploit the convex hull method to derive the coexistence of solid and liquid phases, and model the resulting liquidus hypersurface as a simplicial complex. On such a complex, we propose novel tools to robustly compute descent lines describing the crystallization path induced by heat loss for any initial composition in the system.
{"title":"Modeling Liquidus Hypersurfaces through Simplicial Complexes","authors":"Mattia Natali, M. Attene, G. Ottonello","doi":"10.2312/LocalChapterEvents/ItalChap/ItalianChapConf2010/135-140","DOIUrl":"https://doi.org/10.2312/LocalChapterEvents/ItalChap/ItalianChapConf2010/135-140","url":null,"abstract":"This paper describes an operational pipeline that exploits computational geometry to derive useful knowledge about the crystallization behaviour of materials composed of varying amounts of pure components. Starting from existing knowledge related to the pure components, we compute the Gibbs free energy of all their possible compositions in a given range of temperatures, both in liquid and solid phases. Then, we exploit the convex hull method to derive the coexistence of solid and liquid phases, and model the resulting liquidus hypersurface as a simplicial complex. On such a complex, we propose novel tools to robustly compute descent lines describing the crystallization path induced by heat loss for any initial composition in the system.","PeriodicalId":405486,"journal":{"name":"European Interdisciplinary Cybersecurity Conference","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122014082","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.2312/LocalChapterEvents/ItalChap/ItalianChapConf2008/035-042
A. D. Santis, G. Gironimo, A. Marzano, B. Siciliano, A. Tarallo
The design of solutions for robotic extenders of wheelchairs must take into account both objective and subjective metrics for everyday activities in human environments. Virtual Reality (VR) constitutes a useful tool to effectively test design ideas and to verify performance criteria. This paper presents the development of a simulation environment, where three different manipulators to be mounted on a commercially available wheelchair have been considered. Experimental results are discussed in a significant case study, based upon users’ feedback.
{"title":"A Virtual-Reality-based Evaluation Environment for Wheelchair-mounted Manipulators","authors":"A. D. Santis, G. Gironimo, A. Marzano, B. Siciliano, A. Tarallo","doi":"10.2312/LocalChapterEvents/ItalChap/ItalianChapConf2008/035-042","DOIUrl":"https://doi.org/10.2312/LocalChapterEvents/ItalChap/ItalianChapConf2008/035-042","url":null,"abstract":"The design of solutions for robotic extenders of wheelchairs must take into account both objective and subjective metrics for everyday activities in human environments. Virtual Reality (VR) constitutes a useful tool to effectively test design ideas and to verify performance criteria. This paper presents the development of a simulation environment, where three different manipulators to be mounted on a commercially available wheelchair have been considered. Experimental results are discussed in a significant case study, based upon users’ feedback.","PeriodicalId":405486,"journal":{"name":"European Interdisciplinary Cybersecurity Conference","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123902268","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.2312/LocalChapterEvents/ItalChap/ItalianChapConf2006/083-089
S. Partipilo, F. Felice, F. Renna, G. Attolico, A. Distante
This work addresses the calibration of the CyberGlove, a device which provides information about the position and attitude in space of all the components of the user hand in a haptic system for the fruition of digital 3D contents by blind people. A realistic haptic interaction requires a reliable detection of user movements and a good calibration of the device to account for size and articulation capability of the specific hand. At the same time the application of interest calls for a calibration procedure that should be executable in a natural and straightforward way by every user. The two methods provided by the CyberGlove software are not suitable for these purposes: one is very simple and fast but produces quite imprecise results while the other is effective and accurate but involves a complex and cumbersome trial-and-error process not suited for general users. The proposed method aims to reach satisfactory results using a intuitive and simple approach. The user is asked to assume with his hand several pre-defined poses, each supplying the sensors output associated to known joints’ angles. Combining these data with the constraints derived by the anatomical structure of the hand it is possible to evaluate the values of the two parameters, gain and offset, that drive the digitalization of the sensor output. This process, in spite of its simplicity, has provided satisfactory results in several experimental sessions, enabling a realistic and reliable mirroring of user movements in the virtual space. “
{"title":"A natural and effective calibration of the CyberGlove","authors":"S. Partipilo, F. Felice, F. Renna, G. Attolico, A. Distante","doi":"10.2312/LocalChapterEvents/ItalChap/ItalianChapConf2006/083-089","DOIUrl":"https://doi.org/10.2312/LocalChapterEvents/ItalChap/ItalianChapConf2006/083-089","url":null,"abstract":"This work addresses the calibration of the CyberGlove, a device which provides information about the position and attitude in space of all the components of the user hand in a haptic system for the fruition of digital 3D contents by blind people. A realistic haptic interaction requires a reliable detection of user movements and a good calibration of the device to account for size and articulation capability of the specific hand. At the same time the application of interest calls for a calibration procedure that should be executable in a natural and straightforward way by every user. The two methods provided by the CyberGlove software are not suitable for these purposes: one is very simple and fast but produces quite imprecise results while the other is effective and accurate but involves a complex and cumbersome trial-and-error process not suited for general users. The proposed method aims to reach satisfactory results using a intuitive and simple approach. The user is asked to assume with his hand several pre-defined poses, each supplying the sensors output associated to known joints’ angles. Combining these data with the constraints derived by the anatomical structure of the hand it is possible to evaluate the values of the two parameters, gain and offset, that drive the digitalization of the sensor output. This process, in spite of its simplicity, has provided satisfactory results in several experimental sessions, enabling a realistic and reliable mirroring of user movements in the virtual space. “","PeriodicalId":405486,"journal":{"name":"European Interdisciplinary Cybersecurity Conference","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124802707","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.2312/LocalChapterEvents/ItalChap/ItalianChapConf2008/049-056
R. D. Chiara, A. Fish
EulerView is a novel resource management tool, enabling the representation of non-hierarchical categorisation structures within which to place resources. Since the initial incarnation for use in file-system management, it has been integrated with other systems, such as Flickr to produce Eulr, which assists in user manipulation of photo tags. Another system currently under development is Eulicious, a url management tool integrated with delicious the social bookmarking site. We bring these areas together, enabling the management of different types of resources, such as photo and url’s, for user convenience. User feedback obtained from Eulr testing indicated that certain extra facilities would assist in their development of EulerView categorisation structures. To address this user request, we have introduced projections which capture information, within our broader non-hierarchical structure, in a similar manner to symbolic links in hierarchical structures. This will enable an easy transfer of user knowledge, whilst still providing the greater power of a non-hierarchical structure to be utilised when desired.
{"title":"Eulerview with Projections: Non Hierarchical Visualisation","authors":"R. D. Chiara, A. Fish","doi":"10.2312/LocalChapterEvents/ItalChap/ItalianChapConf2008/049-056","DOIUrl":"https://doi.org/10.2312/LocalChapterEvents/ItalChap/ItalianChapConf2008/049-056","url":null,"abstract":"EulerView is a novel resource management tool, enabling the representation of non-hierarchical categorisation structures within which to place resources. Since the initial incarnation for use in file-system management, it has been integrated with other systems, such as Flickr to produce Eulr, which assists in user manipulation of photo tags. Another system currently under development is Eulicious, a url management tool integrated with delicious the social bookmarking site. We bring these areas together, enabling the management of different types of resources, such as photo and url’s, for user convenience. User feedback obtained from Eulr testing indicated that certain extra facilities would assist in their development of EulerView categorisation structures. To address this user request, we have introduced projections which capture information, within our broader non-hierarchical structure, in a similar manner to symbolic links in hierarchical structures. This will enable an easy transfer of user knowledge, whilst still providing the greater power of a non-hierarchical structure to be utilised when desired.","PeriodicalId":405486,"journal":{"name":"European Interdisciplinary Cybersecurity Conference","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128567390","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.2312/LocalChapterEvents/ItalChap/ItalianChapConf2006/263-266
S. Battiato, C. Bosco, G. Farinella, G. Impoco
In surgical knee replacement, the damaged knee joint is replaced with artificial prostheses . An accurate clinical evaluation must be carried out before applying knee prostheses to ensure optimal outcome from surgical operations and to reduce the probability of having long-term problems. Useful information can be inferred from CT scans of the knee area, that can be used to estimate the stress that will be acting on the prosthesis being implanted. This information can be exploited to tailor the prothesis to the patient’s anatomy. We present some ideas for a system intended to help surgeons in evaluating the post-operative outcome of knee prosthesis implantation. We also show some preliminary results about the 3D segmentation of CT data, that is the main activity of our lab in the project.
{"title":"3D CT Segmentation for Clinical Evaluation of Knee Prosthesis Operations","authors":"S. Battiato, C. Bosco, G. Farinella, G. Impoco","doi":"10.2312/LocalChapterEvents/ItalChap/ItalianChapConf2006/263-266","DOIUrl":"https://doi.org/10.2312/LocalChapterEvents/ItalChap/ItalianChapConf2006/263-266","url":null,"abstract":"In surgical knee replacement, the damaged knee joint is replaced with artificial prostheses . An accurate clinical evaluation must be carried out before applying knee prostheses to ensure optimal outcome from surgical operations and to reduce the probability of having long-term problems. Useful information can be inferred from CT scans of the knee area, that can be used to estimate the stress that will be acting on the prosthesis being implanted. This information can be exploited to tailor the prothesis to the patient’s anatomy. We present some ideas for a system intended to help surgeons in evaluating the post-operative outcome of knee prosthesis implantation. We also show some preliminary results about the 3D segmentation of CT data, that is the main activity of our lab in the project.","PeriodicalId":405486,"journal":{"name":"European Interdisciplinary Cybersecurity Conference","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127375078","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.2312/LocalChapterEvents/ItalChap/ItalianChapConf2007/213-216
L. Gonzo, F. Voltolini, S. Girardi, A. Rizzi, Fabio Remondino, S. El-Hakim
According to an UNESCO survey, Italy accounts for more than half of the Cultural Heritage of the entire world. Italy’s Cultural Heritage therefore represents an enormous wealth not only for the country itself but also for the entire world and this asset should be preserved and documented for future generations and possibly used as source of revenues. Within the relevant methods of the Information Technology which can be applied to Cultural Heritage, that of accurate and realistic 3D "shape capture" of art works has been challenging the scientific community since a long time because an extremely high degree of realism is required. Thereby the virtual reconstruction of cultural heritage sites is becoming a significant field of application in the 3D modeling area. This paper proposes an integrated approach based upon a seamless combination of different 3D measurement techniques for the virtual reconstruction of complex architectures. Depending on the required spatial resolutions, different techniques can be used and at the end all the acquired data have to be integrated into a single 3D model. As example the model of a castle located in Trentino (Italy) was done using surveying, 3D laser scanner, close-range and aerial photogrammetry.
{"title":"Multiple Techniques Approach to the 3D Virtual Reconstruction of Cultural Heritage","authors":"L. Gonzo, F. Voltolini, S. Girardi, A. Rizzi, Fabio Remondino, S. El-Hakim","doi":"10.2312/LocalChapterEvents/ItalChap/ItalianChapConf2007/213-216","DOIUrl":"https://doi.org/10.2312/LocalChapterEvents/ItalChap/ItalianChapConf2007/213-216","url":null,"abstract":"According to an UNESCO survey, Italy accounts for more than half of the Cultural Heritage of the entire world. Italy’s Cultural Heritage therefore represents an enormous wealth not only for the country itself but also for the entire world and this asset should be preserved and documented for future generations and possibly used as source of revenues. Within the relevant methods of the Information Technology which can be applied to Cultural Heritage, that of accurate and realistic 3D \"shape capture\" of art works has been challenging the scientific community since a long time because an extremely high degree of realism is required. Thereby the virtual reconstruction of cultural heritage sites is becoming a significant field of application in the 3D modeling area. This paper proposes an integrated approach based upon a seamless combination of different 3D measurement techniques for the virtual reconstruction of complex architectures. Depending on the required spatial resolutions, different techniques can be used and at the end all the acquired data have to be integrated into a single 3D model. As example the model of a castle located in Trentino (Italy) was done using surveying, 3D laser scanner, close-range and aerial photogrammetry.","PeriodicalId":405486,"journal":{"name":"European Interdisciplinary Cybersecurity Conference","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125567369","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.2312/LocalChapterEvents/ItalChap/ItalianChapConf2006/091-097
Yu Zhang
This paper presents a data-driven method for synthesizing new realistic 3D human faces by morphing a set of facial features. The method takes as examples 3D scanned human face models in order to exploit the shape variations presented in the real faces of individuals. We automatically compute a vertex-to-vertex correspondence between the unregistered face scans by deforming a generic mesh to fit the specific person’s face geometry in a global-tolocal fashion. Exploiting the statistics of the generated datasets of feature shapes we transform them into vector space representations by applying a principal component analysis (PCA). Our feature shape morphing model is formed as a linear combination of the main modes of feature shape variations. We introduce a shape smoothing and blending method for generating a seamlessly deformed mesh around the feature borders. We demonstrate our method by combining 3D morphing of four features to generate a wide range of different face shapes.
{"title":"Data-Driven Facial Feature Morphing for 3D Face Synthesis","authors":"Yu Zhang","doi":"10.2312/LocalChapterEvents/ItalChap/ItalianChapConf2006/091-097","DOIUrl":"https://doi.org/10.2312/LocalChapterEvents/ItalChap/ItalianChapConf2006/091-097","url":null,"abstract":"This paper presents a data-driven method for synthesizing new realistic 3D human faces by morphing a set of facial features. The method takes as examples 3D scanned human face models in order to exploit the shape variations presented in the real faces of individuals. We automatically compute a vertex-to-vertex correspondence between the unregistered face scans by deforming a generic mesh to fit the specific person’s face geometry in a global-tolocal fashion. Exploiting the statistics of the generated datasets of feature shapes we transform them into vector space representations by applying a principal component analysis (PCA). Our feature shape morphing model is formed as a linear combination of the main modes of feature shape variations. We introduce a shape smoothing and blending method for generating a seamlessly deformed mesh around the feature borders. We demonstrate our method by combining 3D morphing of four features to generate a wide range of different face shapes.","PeriodicalId":405486,"journal":{"name":"European Interdisciplinary Cybersecurity Conference","volume":"254 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121323195","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.2312/LocalChapterEvents/ItalChap/ItalianChapConf2007/031-038
Alessandro Martinelli
We propose to use an explicit function for adaptive tessellation of parametric curves and surfaces. This function behaves as a new parametrization from the surface domain (or curve domain) to the domain itself; it is build using information about derivatives and curvature: a fixed tessellation may be re-arranged in an adaptive tessellation, which takes care of those parts of the curve or surface which need to be tessellated more and those which may use a poorer tessellation. We show how to produce and how to use the kernel function with four example: a simple cubic curve, a spline curve, a cubic bezièr triangle and a cubic quadrilateral patch. For every example, we compare the fixed tessellation with the adaptive one: the number of vertexes used is always the same, but the points are re-arranged in a better way. At the end we show how to use commonly known forward differencing methods to evaluate both the explicit parametrization and the curve or surface; we also show how simply this method may be implemented on common graphics cards.
{"title":"Explicit Adaptive Tessellation based on re-parametrization on Graphics Hardware","authors":"Alessandro Martinelli","doi":"10.2312/LocalChapterEvents/ItalChap/ItalianChapConf2007/031-038","DOIUrl":"https://doi.org/10.2312/LocalChapterEvents/ItalChap/ItalianChapConf2007/031-038","url":null,"abstract":"We propose to use an explicit function for adaptive tessellation of parametric curves and surfaces. This function behaves as a new parametrization from the surface domain (or curve domain) to the domain itself; it is build using information about derivatives and curvature: a fixed tessellation may be re-arranged in an adaptive tessellation, which takes care of those parts of the curve or surface which need to be tessellated more and those which may use a poorer tessellation. We show how to produce and how to use the kernel function with four example: a simple cubic curve, a spline curve, a cubic bezièr triangle and a cubic quadrilateral patch. For every example, we compare the fixed tessellation with the adaptive one: the number of vertexes used is always the same, but the points are re-arranged in a better way. At the end we show how to use commonly known forward differencing methods to evaluate both the explicit parametrization and the curve or surface; we also show how simply this method may be implemented on common graphics cards.","PeriodicalId":405486,"journal":{"name":"European Interdisciplinary Cybersecurity Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114171954","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.2312/LocalChapterEvents/ItalChap/ItalianChapConf2008/073-080
F. Guggeri, S. Marras, Claudio Mura, R. Scateni
Recent advances in acquisition and modelling techniques led to generating an exponentially increasing amount of 3D shapes available both over the Internet or in specific databases. While the number grows it becomes more and more difficult to keep an organized knowledge over the content of this repositories. It is commonly intended that in the near future 3D shapes and models will be indexed and searched using procedure and instruments mimicking the same operations performed on images while using algorithms, data structures and instruments peculiar to the domain. In this context it is thus important to have tools for automatic characterization of 3D shapes, and skeletons and partitions are the two most prominent ones among them. In this paper we will describe an experience of building some of this tools on the top of a popular and robust library for manipulating meshes (OpenMesh). The preliminary results we present are promising enough to let us expect that the sum of the tools will be a useful aid to improving indexing and retrieval of digital 3D objects. The work presented here is part of a larger project: Three-Dimensional Shape Indexing and Retrieval Techniques (3-SHIRT), in collaboration with the Universities of Genoa, Padua, Udine, and Verona.
{"title":"Topological Operations on Triangle Meshes Using the OpenMesh Library","authors":"F. Guggeri, S. Marras, Claudio Mura, R. Scateni","doi":"10.2312/LocalChapterEvents/ItalChap/ItalianChapConf2008/073-080","DOIUrl":"https://doi.org/10.2312/LocalChapterEvents/ItalChap/ItalianChapConf2008/073-080","url":null,"abstract":"Recent advances in acquisition and modelling techniques led to generating an exponentially increasing amount of 3D shapes available both over the Internet or in specific databases. While the number grows it becomes more and more difficult to keep an organized knowledge over the content of this repositories. It is commonly intended that in the near future 3D shapes and models will be indexed and searched using procedure and instruments mimicking the same operations performed on images while using algorithms, data structures and instruments peculiar to the domain. In this context it is thus important to have tools for automatic characterization of 3D shapes, and skeletons and partitions are the two most prominent ones among them. In this paper we will describe an experience of building some of this tools on the top of a popular and robust library for manipulating meshes (OpenMesh). The preliminary results we present are promising enough to let us expect that the sum of the tools will be a useful aid to improving indexing and retrieval of digital 3D objects. The work presented here is part of a larger project: Three-Dimensional Shape Indexing and Retrieval Techniques (3-SHIRT), in collaboration with the Universities of Genoa, Padua, Udine, and Verona.","PeriodicalId":405486,"journal":{"name":"European Interdisciplinary Cybersecurity Conference","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116096208","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.2312/LocalChapterEvents/ItalChap/ItalianChapConf2011/053-060
David Canino, L. Floriani
Modeling and understanding complex non-manifold shapes is a key issue in shape analysis and retrieval. The topological structure of a non-manifold shape can be analyzed through its decomposition into a collection of components with a simpler topology. Here, we consider a representation for arbitrary shapes, that we call Manifold-Connected Decomposition (MC-decomposition), which is based on a unique decomposition of the shape into nearly manifold parts. We present efficient and powerful two-level representations for non-manifold shapes based on the MC-decomposition and on an efficient and compact data structure for encoding the underlying components. We describe a dimension-independent algorithm to generate such decomposition. We also show that the MC-decomposition provides a suitable basis for geometric reasoning and for homology computation on non-manifold shapes. Finally, we present a comparison with existing representations for arbitrary shapes.
{"title":"A Decomposition-based Approach to Modeling and Understanding Arbitrary Shapes","authors":"David Canino, L. Floriani","doi":"10.2312/LocalChapterEvents/ItalChap/ItalianChapConf2011/053-060","DOIUrl":"https://doi.org/10.2312/LocalChapterEvents/ItalChap/ItalianChapConf2011/053-060","url":null,"abstract":"Modeling and understanding complex non-manifold shapes is a key issue in shape analysis and retrieval. The topological structure of a non-manifold shape can be analyzed through its decomposition into a collection of components with a simpler topology. Here, we consider a representation for arbitrary shapes, that we call Manifold-Connected Decomposition (MC-decomposition), which is based on a unique decomposition of the shape into nearly manifold parts. We present efficient and powerful two-level representations for non-manifold shapes based on the MC-decomposition and on an efficient and compact data structure for encoding the underlying components. We describe a dimension-independent algorithm to generate such decomposition. We also show that the MC-decomposition provides a suitable basis for geometric reasoning and for homology computation on non-manifold shapes. Finally, we present a comparison with existing representations for arbitrary shapes.","PeriodicalId":405486,"journal":{"name":"European Interdisciplinary Cybersecurity Conference","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116697716","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：