default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichel Pocchiola
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[j15]Luc Habert, Michel Pocchiola:
LR Characterization of Chirotopes of Finite Planar Families of Pairwise Disjoint Convex bodies. Discret. Comput. Geom. 50(3): 552-648 (2013)- 2012
- [j14]Vincent Pilaud
, Michel Pocchiola:
Multitriangulations, Pseudotriangulations and Primitive Sorting Networks. Discret. Comput. Geom. 48(1): 142-191 (2012) - [j13]Luc Habert, Michel Pocchiola:
Computing Pseudotriangulations via Branched Coverings. Discret. Comput. Geom. 48(3): 518-579 (2012) - 2011
- [j12]Julien Ferté, Vincent Pilaud, Michel Pocchiola:
On the Number of Simple Arrangements of Five Double Pseudolines. Discret. Comput. Geom. 45(2): 279-302 (2011) - [i5]Luc Habert, Michel Pocchiola:
Arrangements of double pseudolines. CoRR abs/1101.1022 (2011) - [i4]Luc Habert, Michel Pocchiola:
Computing pseudotriangulations via branched coverings. CoRR abs/1102.0151 (2011) - 2010
- [i3]Julien Ferté, Vincent Pilaud, Michel Pocchiola:
On the number of simple arrangements of five double pseudolines. CoRR abs/1009.1575 (2010) - [i2]Vincent Pilaud, Michel Pocchiola:
Multitriangulations, pseudotriangulations and primitive sorting networks. CoRR abs/1009.5344 (2010)
2000 – 2009
- 2009
- [c10]Luc Habert, Michel Pocchiola:
Arrangements of double pseudolines: extended abstract. SCG 2009: 314-323 - 2008
- [j11]Patrice Ossona de Mendez, Michel Pocchiola, Dominique Poulalhon, Jorge L. Ramírez Alfonsín, Gilles Schaeffer:
Preface. Electron. Notes Discret. Math. 31: 1-4 (2008) - 2006
- [j10]Hervé Brönnimann, Lutz Kettner, Michel Pocchiola, Jack Snoeyink:
Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm. SIAM J. Comput. 36(3): 721-739 (2006) - 2005
- [c9]Hervé Brönnimann, Lutz Kettner, Michel Pocchiola, Jack Snoeyink:
Counting and Enumerating Pointed Pseudo-triangulations with the Greedy Flip Algorithm. ALENEX/ANALCO 2005: 98-110 - 2003
- [j9]Éric Colin de Verdière, Michel Pocchiola, Gert Vegter:
Tutte's barycenter method applied to isotopies. Comput. Geom. 26(1): 81-97 (2003) - 2001
- [c8]Éric Colin de Verdière, Michel Pocchiola, Gert Vegter:
Tutte's barycenter method applied to isotopies. CCCG 2001: 57-60 - [c7]Francis Lazarus, Michel Pocchiola, Gert Vegter, Anne Verroust:
Computing a canonical polygonal schema of an orientable triangulated surface. SCG 2001: 80-89 - [c6]Pierre Angelier, Michel Pocchiola:
A sum of squares theorem for visibility. SCG 2001: 302-311 - 2000
- [i1]Pierre Angelier, Michel Pocchiola:
On Computing Tangent Visibility Graphs. EuroCG 2000: 108-111
1990 – 1999
- 1996
- [j8]Michel Pocchiola, Gert Vegter:
Minimal Tangent Visibility Graphs. Comput. Geom. 6: 303-314 (1996) - [j7]Michel Pocchiola, Gert Vegter:
Topologically Sweeping Visibility Complexes via Pseudotriangulations. Discret. Comput. Geom. 16(4): 419-453 (1996) - [j6]Jean Berstel, Michel Pocchiola:
Random generation of finite Sturmian words. Discret. Math. 153(1-3): 29-39 (1996) - [j5]Michel Pocchiola, Gert Vegter:
The visibility complex. Int. J. Comput. Geom. Appl. 6(3): 279-308 (1996) - [c5]Michel Pocchiola, Gert Vegter:
Pseudo-Triangulations: Theory and Applications. SCG 1996: 291-300 - 1995
- [c4]Michel Pocchiola, Gert Vegter:
Computing the Visibility Graph via Pseudo-Triangulations. SCG 1995: 248-257 - 1994
- [j4]Evangelos Kranakis, Michel Pocchiola:
Counting Problems Relating to a Theorem of Dirichlet. Comput. Geom. 4: 309-325 (1994) - [j3]Evangelos Kranakis, Michel Pocchiola:
Camera Placement in Integer Lattices. Discret. Comput. Geom. 12: 91-104 (1994) - [j2]Jean Berstel, Michel Pocchiola:
Average Cost of Duval's Algorithm for Generating Lyndon Words. Theor. Comput. Sci. 132(2): 415-425 (1994) - [c3]Michel Pocchiola, Gert Vegter:
Minimal Tangent Visibility Graphs. CCCG 1994: 24-29 - 1993
- [j1]Jean Berstel, Michel Pocchiola:
A Geometric Proof of the Enumeration Formula for Sturmian Words. Int. J. Algebra Comput. 3(3): 349-356 (1993) - [c2]Michel Pocchiola, Gert Vegter:
The Visibility Complex. SCG 1993: 328-337 - 1990
- [c1]Evangelos Kranakis, Michel Pocchiola:
Enumeration and Visibility Problems in Integer Lattices (Extended Abstract). SCG 1990: 261-270
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-04-24 22:47 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:
