The SCEAS System
Navigation Menu

Search the dblp DataBase


Isabelle Sivignon: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. David Coeurjolly, Florent Dupont, Laurent Jospin, Isabelle Sivignon
    Optimization Schemes for the Reversible Discrete Volume Polyhedrization Using Marching Cubes Simplification. [Citation Graph (0, 0)][DBLP]
    DGCI, 2006, pp:413-424 [Conf]
  2. Rodolphe Breton, Isabelle Sivignon, Florent Dupont, Eric Andres
    Towards an Invertible Euclidean Reconstruction of a Discrete Object. [Citation Graph (0, 0)][DBLP]
    DGCI, 2003, pp:246-256 [Conf]
  3. Jean-Marc Chassery, David Coeurjolly, Isabelle Sivignon
    Duality and Geometry Straightness, Characterization and Envelope. [Citation Graph (0, 0)][DBLP]
    DGCI, 2006, pp:1-16 [Conf]
  4. Isabelle Sivignon, David Coeurjolly
    Minimal Decomposition of a Digital Surface into Digital Plane Segments Is NP-Hard. [Citation Graph (0, 0)][DBLP]
    DGCI, 2006, pp:674-685 [Conf]
  5. Isabelle Sivignon, Florent Dupont, Jean-Marc Chassery
    New Results about Digital Intersections. [Citation Graph (0, 0)][DBLP]
    DGCI, 2003, pp:102-113 [Conf]
  6. Isabelle Sivignon, Florent Dupont, Jean-Marc Chassery
    Reversible Polygonalization of a 3D Planar Discrete Curve: Application on Discrete Surfaces. [Citation Graph (0, 0)][DBLP]
    DGCI, 2005, pp:347-358 [Conf]
  7. Jean-Marc Chassery, Florent Dupont, Isabelle Sivignon, Joëlle Vittone
    Digital Geometry Fundaments: Application to Plane Recognition. [Citation Graph (0, 0)][DBLP]
    ICIAP, 2001, pp:622- [Conf]
  8. Isabelle Sivignon, Florent Dupont, Jean-Marc Chassery
    Discrete Surface Segmentation into Discrete Planes. [Citation Graph (0, 0)][DBLP]
    IWCIA, 2004, pp:458-473 [Conf]
  9. Isabelle Sivignon, David Coeurjolly
    From Digital Plane Segmentation to Polyhedral Representation. [Citation Graph (0, 0)][DBLP]
    Theoretical Foundations of Computer Vision, 2002, pp:356-367 [Conf]
  10. Isabelle Sivignon, Florent Dupont, Jean-Marc Chassery
    Decomposition of a Three-Dimensional Discrete Object Surface into Discrete Plane Pieces. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:38, n:1, pp:25-43 [Journal]
  11. Isabelle Sivignon, Florent Dupont, Jean-Marc Chassery
    Digital Intersections: minimal carrier, connectivity, and periodicity properties. [Citation Graph (0, 0)][DBLP]
    Graphical Models, 2004, v:66, n:4, pp:226-244 [Journal]
  12. David Coeurjolly, Isabelle Sivignon, Florent Dupont, Fabien Feschet, Jean-Marc Chassery
    On digital plane preimage structure. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:151, n:1-3, pp:78-92 [Journal]
  13. Isabelle Sivignon, Rodolphe Breton, Florent Dupont, Eric Andres
    Discrete analytical curve reconstruction without patches. [Citation Graph (0, 0)][DBLP]
    Image Vision Comput., 2005, v:23, n:2, pp:191-202 [Journal]
  14. Tristan Roussillon, Laure Tougne, Isabelle Sivignon
    Computation of Binary Objects Sides Number using Discrete Geometry, Application to Automatic Pebbles Shape Analysis. [Citation Graph (0, 0)][DBLP]
    ICIAP, 2007, pp:763-768 [Conf]
  15. Isabelle Sivignon, Florent Dupont, Jean-Marc Chassery
    Reversible vectorisation of 3D digital planar curves and applications. [Citation Graph (0, 0)][DBLP]
    Image Vision Comput., 2007, v:25, n:10, pp:1644-1656 [Journal]

  16. On Three Constrained Versions of the Digital Circular Arc Recognition Problem. [Citation Graph (, )][DBLP]

  17. Robust decomposition of a digital curve into convex and concave parts. [Citation Graph (, )][DBLP]

  18. Hierarchical Discrete Medial Axis for Sphere-Tree Construction. [Citation Graph (, )][DBLP]

  19. What Does Digital Straightness Tell about Digital Convexity? [Citation Graph (, )][DBLP]

  20. Test and Measure of Circularity for Digital Curves. [Citation Graph (, )][DBLP]

  21. Introduction. [Citation Graph (, )][DBLP]

  22. Minimum decomposition of a digital surface into digital plane segments is NP-hard. [Citation Graph (, )][DBLP]

Search in 0.003secs, Finished in 0.004secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002