

de Recherche et d’Innovation
en Cybersécurité et Société
Allili, M.; Li, D.; Allili, M. S.
A digital topology-based method for the topological filtering of a reconstructed surface Article d'actes
Dans: Proceedings of SPIE - The International Society for Optical Engineering, San Francisco, CA, 2011, ISBN: 0277786X (ISSN); 978-081948405-5 (ISBN), (Journal Abbreviation: Proc SPIE Int Soc Opt Eng).
Résumé | Liens | BibTeX | Étiquettes: Approximation algorithms, Closing holes, Data handling, Data visualization, Digital topology, Piecewise linear techniques, Surface reconstruction, Three dimensional, Topological filtering, Topology, Visualization, Volumetric representation, Voronoi, Voronoi filtering
@inproceedings{allili_digital_2011,
title = {A digital topology-based method for the topological filtering of a reconstructed surface},
author = {M. Allili and D. Li and M. S. Allili},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-79951882558&doi=10.1117%2f12.872653&partnerID=40&md5=678176a90e6b1b3e76292d3dadaadd72},
doi = {10.1117/12.872653},
isbn = {0277786X (ISSN); 978-081948405-5 (ISBN)},
year = {2011},
date = {2011-01-01},
booktitle = {Proceedings of SPIE - The International Society for Optical Engineering},
volume = {7868},
address = {San Francisco, CA},
abstract = {In this paper, we use concepts from digital topology for the topological filtering of reconstructed surfaces. Given a finite set S of sample points in 3D space, we use the voronoi-based algorithm of Amenta & Bern 1 to reconstruct a piecewise-linear approximation surface in the form of a triangular mesh with vertex set equal to S. A typical surface obtained by means of this algorithm often contains small holes that can be considered as noise. We propose a method to remove the unwanted holes that works as follows. We first embed the triangulated surface in a volumetric representation. Then, we use the 3Dhole closing algorithm of Aktouf et al.2 to filter the holes by their size and close the small holes that are in general irrelevant to the surface while the larger holes often represent topological features of the surface. We present some experimental results that show that this method allows to automatically and effectively search and suppress unwanted holes in a 3D surface. © 2011 SPIE-IS&T.},
note = {Journal Abbreviation: Proc SPIE Int Soc Opt Eng},
keywords = {Approximation algorithms, Closing holes, Data handling, Data visualization, Digital topology, Piecewise linear techniques, Surface reconstruction, Three dimensional, Topological filtering, Topology, Visualization, Volumetric representation, Voronoi, Voronoi filtering},
pubstate = {published},
tppubtype = {inproceedings}
}
Davoust, A.; Esfandiari, B.
Linking and navigating data in a P2P file-sharing network Article d'actes
Dans: CEUR Workshop Proceedings, Madrid, 2009, (ISSN: 16130073).
Résumé | Liens | BibTeX | Étiquettes: Data handling, Demo, Distributed computer systems, Dynamic infrastructure, File sharing networks, Linked datum, Peer to peer, Peer to peer networks, Replicated data, Sharing network, URI
@inproceedings{davoust_linking_2009,
title = {Linking and navigating data in a P2P file-sharing network},
author = {A. Davoust and B. Esfandiari},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84888109555&partnerID=40&md5=15b8071da5a8a44f3c719a82075fdc07},
year = {2009},
date = {2009-01-01},
booktitle = {CEUR Workshop Proceedings},
volume = {538},
address = {Madrid},
abstract = {We demonstrate a tool for publishing and navigating linked data over the highly dynamic infrastructure of a P2P file- sharing network. Our links are based on a URI scheme which allows unambiguous designation of replicated data items, regardless of their location in the network. In a true decentralized P2P spirit, users publish and distribute the links just like other data items.},
note = {ISSN: 16130073},
keywords = {Data handling, Demo, Distributed computer systems, Dynamic infrastructure, File sharing networks, Linked datum, Peer to peer, Peer to peer networks, Replicated data, Sharing network, URI},
pubstate = {published},
tppubtype = {inproceedings}
}