default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIsabelle Sivignon
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i3]Florian Galliot, Sylvain Gravier, Isabelle Sivignon:
(k-2)-linear connected components in hypergraphs of rank k. CoRR abs/2307.06752 (2023)- [i2]Florian Galliot, Sylvain Gravier, Isabelle Sivignon:
An update on the coin-moving game on the square grid. CoRR abs/2307.06767 (2023) - 2022
- [c25]Isabelle Sivignon:
Exact and Optimal Conversion of a Hole-free 2d Digital Object into a Union of Balls in Polynomial Time. DGMM 2022: 382-394 - [i1]Florian Galliot, Sylvain Gravier, Isabelle Sivignon:
Structural tools for the Maker-Breaker game. Application to hypergraphs of rank 3: strategies and tractability. CoRR abs/2209.12819 (2022) - 2020
- [j19]David Coeurjolly
, Isabelle Sivignon:
Efficient distance transformation for path-based metrics. Comput. Vis. Image Underst. 194: 102925 (2020)
2010 – 2019
- 2019
- [j18]Dominique Attali, Tuong-Bach Nguyen, Isabelle Sivignon:
(δ, ε)-Ball Approximation of a Shape: Definition and Complexity. Discret. Comput. Geom. 61(3): 595-625 (2019) - [c24]Isabelle Sivignon:
Average Curve of n Digital Curves. DGCI 2019: 481-493 - 2017
- [c23]Zhuocheng Li, Tuong-Bach Nguyen, Quentin Lampin, Isabelle Sivignon, Steeve Zozor:
Ensuring k-coverage in Low-Power Wide Area Networks for Internet of Things. ICNC 2017: 26-30 - 2016
- [j17]Isabelle Sivignon:
A note on the computation of the fraction of smallest denominator in between two irreducible fractions. Discret. Appl. Math. 202: 197-201 (2016) - [c22]Tuong Nguyen, Isabelle Sivignon:
Epsilon-covering: a greedy optimal algorithm for simple shapes. CCCG 2016: 187-194 - [c21]Isabelle Sivignon:
Representation of Imprecise Digital Objects. DGCI 2016: 401-414 - 2015
- [j16]Isabelle Sivignon:
Fast recognition of a Digital Straight Line subsegment: Two algorithms of logarithmic time complexity. Discret. Appl. Math. 183: 130-146 (2015) - 2014
- [j15]Isabelle Sivignon:
A Near-Linear Time Guaranteed Algorithm for Digital Curve Simplification Under the Fréchet Distance. Image Process. Line 4: 116-127 (2014) - [c20]Isabelle Sivignon:
Algorithms for Fast Digital Straight Segments Union. DGCI 2014: 344-357 - 2013
- [c19]Jean-Marc Chassery, Isabelle Sivignon:
Optimal Covering of a Straight Line Applied to Discrete Convexity. DGCI 2013: 1-10 - [c18]Isabelle Sivignon:
Walking in the Farey Fan to Compute the Characteristics of a Discrete Straight Line Subsegment. DGCI 2013: 23-34 - 2011
- [j14]David Coeurjolly, Isabelle Sivignon:
Measure of straight lines for digital contour analysis. Int. J. Imaging Syst. Technol. 21(1): 67-75 (2011) - [j13]Tristan Roussillon, Isabelle Sivignon:
Faithful polygonal representation of the convex and concave parts of a digital curve. Pattern Recognit. 44(10-11): 2693-2700 (2011) - [c17]Isabelle Sivignon:
A Near-Linear Time Guaranteed Algorithm for Digital Curve Simplification under the Fréchet Distance. DGCI 2011: 333-345 - 2010
- [j12]Tristan Roussillon, Isabelle Sivignon, Laure Tougne:
Measure of circularity for parts of digital boundaries and its fast computation. Pattern Recognit. 43(1): 37-46 (2010)
2000 – 2009
- 2009
- [j11]David Coeurjolly, Isabelle Sivignon, Florent Dupont:
Introduction. Comput. Graph. 33(1): 1 (2009) - [j10]Isabelle Sivignon, David Coeurjolly:
Minimum decomposition of a digital surface into digital plane segments is NP-hard. Discret. Appl. Math. 157(3): 558-570 (2009) - [j9]Tristan Roussillon, Hervé Piégay, Isabelle Sivignon, Laure Tougne, Franck Lavigne:
Automatic computation of pebble roundness using digital imagery and discrete geometry. Comput. Geosci. 35(10): 1992-2000 (2009) - [j8]Isabelle Sivignon, David Coeurjolly, Laure Tougne:
Discrete Geometry for Computer Imagery. Pattern Recognit. 42(10): 2219 (2009) - [c16]Tristan Roussillon, Laure Tougne, Isabelle Sivignon:
On Three Constrained Versions of the Digital Circular Arc Recognition Problem. DGCI 2009: 34-45 - [c15]David Coeurjolly, Isabelle Sivignon:
Measure of Straight Lines and its Applications in Digital Geometry. IWCIA Special Track on Applications 2009: 37-48 - [c14]Tristan Roussillon, Laure Tougne, Isabelle Sivignon:
What Does Digital Straightness Tell about Digital Convexity? IWCIA 2009: 43-55 - [c13]Alain Broutta, David Coeurjolly, Isabelle Sivignon:
Hierarchical Discrete Medial Axis for Sphere-Tree Construction. IWCIA 2009: 56-67 - 2008
- [j7]David Coeurjolly, Jérôme Hulin, Isabelle Sivignon:
Finding a minimum medial axis of a discrete shape is NP-hard. Theor. Comput. Sci. 406(1-2): 72-79 (2008) - [c12]Tristan Roussillon, Isabelle Sivignon, Laure Tougne:
Robust decomposition of a digital curve into convex and concave parts. ICPR 2008: 1-4 - [c11]Tristan Roussillon, Isabelle Sivignon, Laure Tougne:
Test and Measure of Circularity for Digital Curves. IPCV 2008: 518-524 - [e1]David Coeurjolly, Isabelle Sivignon, Laure Tougne, Florent Dupont:
Discrete Geometry for Computer Imagery, 14th IAPR International Conference, DGCI 2008, Lyon, France, April 16-18, 2008. Proceedings. Lecture Notes in Computer Science 4992, Springer 2008, ISBN 978-3-540-79125-6 [contents] - 2007
- [j6]Isabelle Sivignon, Florent Dupont, Jean-Marc Chassery:
Reversible vectorisation of 3D digital planar curves and applications. Image Vis. Comput. 25(10): 1644-1656 (2007) - [c10]Tristan Roussillon, Laure Tougne, Isabelle Sivignon:
Computation of Binary Objects Sides Number using Discrete Geometry, Application to Automatic Pebbles Shape Analysis. ICIAP 2007: 763-768 - 2006
- [c9]Jean-Marc Chassery, David Coeurjolly, Isabelle Sivignon:
Duality and Geometry Straightness, Characterization and Envelope. DGCI 2006: 1-16 - [c8]David Coeurjolly, Florent Dupont, Laurent Jospin, Isabelle Sivignon:
Optimization Schemes for the Reversible Discrete Volume Polyhedrization Using Marching Cubes Simplification. DGCI 2006: 413-424 - [c7]Isabelle Sivignon, David Coeurjolly:
Minimal Decomposition of a Digital Surface into Digital Plane Segments Is NP-Hard. DGCI 2006: 674-685 - 2005
- [j5]David Coeurjolly, Isabelle Sivignon, Florent Dupont, Fabien Feschet, Jean-Marc Chassery:
On digital plane preimage structure. Discret. Appl. Math. 151(1-3): 78-92 (2005) - [j4]Isabelle Sivignon, Rodolphe Breton, Florent Dupont, Eric Andres:
Discrete analytical curve reconstruction without patches. Image Vis. Comput. 23(2): 191-202 (2005) - [c6]Isabelle Sivignon, Florent Dupont, Jean-Marc Chassery:
Reversible Polygonalization of a 3D Planar Discrete Curve: Application on Discrete Surfaces. DGCI 2005: 347-358 - 2004
- [j3]Isabelle Sivignon, Florent Dupont, Jean-Marc Chassery:
Decomposition of a Three-Dimensional Discrete Object Surface into Discrete Plane Pieces. Algorithmica 38(1): 25-43 (2004) - [j2]Isabelle Sivignon, Florent Dupont, Jean-Marc Chassery:
Digital Intersections: minimal carrier, connectivity, and periodicity properties. Graph. Model. 66(4): 226-244 (2004) - [c5]Isabelle Sivignon, Florent Dupont, Jean-Marc Chassery:
Discrete Surface Segmentation into Discrete Planes. IWCIA 2004: 458-473 - 2003
- [j1]David Coeurjolly, Isabelle Sivignon, Florent Dupont, Fabien Feschet, Jean-Marc Chassery:
Digital plane preimage structure. Electron. Notes Discret. Math. 12: 220-231 (2003) - [c4]Isabelle Sivignon, Florent Dupont, Jean-Marc Chassery:
New Results about Digital Intersections. DGCI 2003: 102-113 - [c3]Rodolphe Breton, Isabelle Sivignon, Florent Dupont, Eric Andres:
Towards an Invertible Euclidean Reconstruction of a Discrete Object. DGCI 2003: 246-256 - 2002
- [c2]Isabelle Sivignon, David Coeurjolly:
From Digital Plane Segmentation to Polyhedral Representation. Theoretical Foundations of Computer Vision 2002: 356-367 - 2001
- [c1]Jean-Marc Chassery, Florent Dupont, Isabelle Sivignon, Joëlle Vittone:
Digital Geometry Fundaments: Application to Plane Recognition. ICIAP 2001: 622
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
