Nombre de documents

25

CV de Pascal Lienhardt


Communication dans un congrès8 documents

  • Pascal Lienhardt, Samuel Peltier. Homology Computation During an Incremental Construction Process. Alexandra Bac, Jean-Luc Mari. Computational Topology in Image Context - CTIC 2016, Jun 2016, Marseille, France. Springer, Lecture Notes in Computer Science, 9667, pp.7-15, 2016, Computational Topology in Image Context (CTIC 2016). <10.1007/978-3-319-39441-1_2>. <hal-01506980>
  • Sylvie Alayrangues, Samuel Peltier, Guillaume Damiand, Pascal Lienhardt. Border operator for generalized maps. Discrete Geometry for Computer Imagery, Sep 2009, Montreal, Canada. 5810, pp.300--312, 2009, Lecture Notes in Computer Science. <hal-00437746>
  • Sylvie Alayrangues, Guillaume Damiand, Laurent Fuchs, Pascal Lienhardt, Samuel Peltier. Homology Computation on Cellular Structures in Image Context. Computational Topology in Image Context, Aug 2009, St. Kathrein/Offenegg, Austria. pp.19--28, 2009. <hal-00437766>
  • Samuel Peltier, Laurent Fuchs, Pascal Lienhardt. Homology of simploidal sets. Discrete Geometry for Computer Imagery, Oct 2006, Szeged, Hungary. 4245, pp.235--246, 2006. <hal-00308014>
  • Guillaume Damiand, Samuel Peltier, Laurent Fuchs, Pascal Lienhardt. Topological Map: An Efficient Tool to Compute Incrementally Topological Features on 3D Images. International Workshop on Combinatorial Image Analysis, Jun 2006, Berlin, Germany. 4040, pp.1--15, 2006, Lecture Notes in Computer Science. <10.1007/11774938_1>. <hal-00366101>
  • Carine Grasset-Simon, Guillaume Damiand, Pascal Lienhardt. Receptive Fields for Generalized Map Pyramids: The Notion of Generalized Orbit. Discrete Geometry for Computer Imagery, Apr 2005, Poitiers, France. Springer, Berlin, Heidelberg, Lecture Notes in Computer Science Discrete, 3429, pp.56-67, 2005, Geometry for Computer Imagery. <10.1007/978-3-540-31965-8_6>. <hal-01511756>
  • Carine Grasset-Simon, Guillaume Damiand, Pascal Lienhardt. Pyramids of n-Dimensional Generalized Maps. Graph-Based Representations in Pattern Recognition, Apr 2005, Poitiers, France. Springer Berlin/Heidelberg, Lecture Notes in Computer Science :, 3434, pp.142-152, 2005, Graph-Based Representations in Pattern Recognition <10.1007/978-3-540-31988-7_13>. <hal-01511770>
  • David Fradin, Daniel Meneveaux, Pascal Lienhardt. Partition de l'espace et hiérarchie de cartes généralisées : application aux complexes architecturaux. AFIG, Dec 2002, France. 2002. <hal-00337806>

Rapport3 documents

  • Sylvie Alayrangues, Pascal Lienhardt, Samuel Peltier. Conversion between chains of maps and chains of surfaces; application to the computation of incidence graphs homology. [Research Report] Université de Poitiers. 2015. <hal-01130543>
  • Sylvie Alayrangues, Guillaume Damiand, Pascal Lienhardt, Samuel Peltier. A Boundary Operator for Computing the Homology of Cellular Structures. 2011. <hal-00683031v2>
  • David Fradin, Daniel Meneveaux, Pascal Lienhardt. Hierarchy of Generalized Maps for Modeling and Rendering Complex Indoor Scenes. 2005. <hal-00337810>

Pré-publication, Document de travail3 documents

  • Pascal Lienhardt, Samuel Peltier. Simploidal Sets. 2016. <hal-01274880>
  • Sylvie Alayrangues, Laurent Fuchs, Pascal Lienhardt, Samuel Peltier. Incremental Computation of the Homology of Generalized Maps: An Application of Effective Homology Results. 2015. <hal-01142760v2>
  • Ana Maria Pacheco Martinez, Pascal Lienhardt, Pedro Real Juarez. Extracting cell complexes from digital images. 2014. <hal-01016498v2>

Article dans une revue7 documents

  • Sylvie Alayrangues, Guillaume Damiand, Pascal Lienhardt, Samuel Peltier. Homology of Cellular Structures Allowing Multi-incidence. Discrete and Computational Geometry, Springer Verlag, 2015, 54 (1), pp.42-77. <10.1007/s00454-015-9662-5>. <hal-01189215>
  • Samuel Peltier, Laurent Fuchs, Pascal Lienhardt. Simploidals sets: Definitions, Operations and Comparison with Simplicial Sets. Discrete Applied Mathematics, Elsevier, 2009, 157, pp.542--557. <10.1016/j.dam.2008.05.032>. <hal-00366069>
  • Sylvie Alayrangues, X. Daragon, Jacques-Olivier Lachaud, Pascal Lienhardt. Equivalence between Closed Connected n-G-Maps without Multi-Incidence and n-Surfaces.. Journal of Mathematical Imaging and Vision, Springer Verlag, 2008, Vol.32, p.1-22. <hal-00340945>
  • Carine Grasset-Simon, Guillaume Damiand, Pascal Lienhardt. nD generalized map pyramids: definition, representations and basic operations. Pattern Recognition, Elsevier, 2006, 39 (4), pp.527-538. <10.1016/j.patcog.2005.10.004>. <hal-00211784>
  • Samuel Peltier, Laurent Fuchs, Pascal Lienhardt. Homologie des ensembles simploïdaux. Revue des Sciences et Technologies de l'Information - Série TSI : Technique et Science Informatiques, Lavoisier, 2006, 25 (6), pp.791--813. <10.3166/tsi.25.791-813>. <hal-00366223>
  • David Fradin, Daniel Meneveaux, Pascal Lienhardt. A Hierarchical Topology-Based Model for Handling Complex Indoor Scenes. Computer Graphics Forum, Wiley, 2006, 25 (2), pp.149--162. <hal-00332648>
  • Guillaume Damiand, Martine Dexet, Pascal Lienhardt, Eric Andres. Removal and contraction operations to define combinatorial pyramids: application to the design of a spatial modeler. Image and Vision Computing, Elsevier, 2005, 23 (2), pp.259-269. <10.1016/j.imavis.2004.06.016>. <hal-00211776>

Chapitre d'ouvrage2 documents

  • Pascal Lienhardt, Laurent Fuchs, Yves Bertrand. Combinatorial models for topology-based geometric modeling. G. Di Maio, S. Naimpally. Theory and applications of proximity, nearness and uniformity, Quaderni di matematica, dipartimento di matematica, seconda universita di Napoli, pp.151-198, 2009. <hal-00580708>
  • Pascal Lienhardt, Laurent Fuchs, Yves Bertrand. Modèles topologiques. Informatique graphique, modélisation géométrique et animation, Lavoisier, pp.49-93, 2007. <hal-00580707>

Autre publication1 document

  • Mathieu Poudret, Agnès Arnould, Yves Bertrand, Pascal Lienhardt. Cartes Combinatoires Ouvertes. Rapport de recherche SIC. 2007. <hal-00353772>

Ouvrage (y compris édition critique et traduction)1 document