Michel Pocchiola - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 26 from 26

2013

LR Characterization of Chirotopes of Finite Planar Families of Pairwise Disjoint Convex bodiesLuc Habert, Michel Pocchiola. dcg, 50(3):552-648, 2013. [doi]

2012

Computing Pseudotriangulations via Branched CoveringsLuc Habert, Michel Pocchiola. dcg, 48(3):518-579, 2012. [doi]

Multitriangulations, Pseudotriangulations and Primitive Sorting NetworksVincent Pilaud, Michel Pocchiola. dcg, 48(1):142-191, 2012. [doi]

2011

On the Number of Simple Arrangements of Five Double PseudolinesJulien Ferté, Vincent Pilaud, Michel Pocchiola. dcg, 45(2):279-302, 2011. [doi]

2009

Arrangements of double pseudolines: extended abstractLuc Habert, Michel Pocchiola. compgeom 2009: 314-323 [doi]

2008

PrefacePatrice Ossona de Mendez, Michel Pocchiola, Dominique Poulalhon, Jorge L. Ramírez Alfonsín, Gilles Schaeffer. endm, 31:1-4, 2008. [doi]

2006

Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip AlgorithmHervé Brönnimann, Lutz Kettner, Michel Pocchiola, Jack Snoeyink. SICOMP, 36(3):721-739, 2006. [doi]

2005

Counting and Enumerating Pointed Pseudo-triangulations with the Greedy Flip AlgorithmHervé Brönnimann, Lutz Kettner, Michel Pocchiola, Jack Snoeyink. alenex 2005: 98-110 [doi]

2003

Tutte s barycenter method applied to isotopiesÉric Colin de Verdière, Michel Pocchiola, Gert Vegter. comgeo, 26(1):81-97, 2003. [doi]

2001

A sum of squares theorem for visibilityPierre Angelier, Michel Pocchiola. compgeom 2001: 302-311 [doi]

Computing a canonical polygonal schema of an orientable triangulated surfaceFrancis Lazarus, Michel Pocchiola, Gert Vegter, Anne Verroust. compgeom 2001: 80-89 [doi]

Tutte s barycenter method applied to isotopiesÉric Colin de Verdière, Michel Pocchiola, Gert Vegter. cccg 2001: 57-60 [doi]

2000

On Computing Tangent Visibility GraphsPierre Angelier, Michel Pocchiola. ewcg 2000: 108-111

1996

Random generation of finite Sturmian wordsJean Berstel, Michel Pocchiola. DM, 153(1-3):29-39, 1996. [doi]

Topologically Sweeping Visibility Complexes via PseudotriangulationsMichel Pocchiola, Gert Vegter. dcg, 16(4):419-453, 1996. [doi]

Pseudo-Triangulations: Theory and ApplicationsMichel Pocchiola, Gert Vegter. compgeom 1996: 291-300 [doi]

Minimal Tangent Visibility GraphsMichel Pocchiola, Gert Vegter. comgeo, 6:303-314, 1996.

The visibility complexMichel Pocchiola, Gert Vegter. ijcga, 6(3):279-308, 1996.

1995

Computing the Visibility Graph via Pseudo-TriangulationsMichel Pocchiola, Gert Vegter. compgeom 1995: 248-257 [doi]

1994

Average Cost of Duval s Algorithm for Generating Lyndon WordsJean Berstel, Michel Pocchiola. TCS, 132(2):415-425, 1994.

Counting Problems Relating to a Theorem of DirichletEvangelos Kranakis, Michel Pocchiola. comgeo, 4:309-325, 1994.

Camera Placement in Integer LatticesEvangelos Kranakis, Michel Pocchiola. dcg, 12:91-104, 1994.

Minimal Tangent Visibility GraphsMichel Pocchiola, Gert Vegter. cccg 1994: 24-29

1993

A Geometric Proof of the Enumeration Formula for Sturmian WordsJean Berstel, Michel Pocchiola. ijac, 3(3):349-356, 1993. [doi]

The Visibility ComplexMichel Pocchiola, Gert Vegter. compgeom 1993: 328-337 [doi]

1990

Enumeration and Visibility Problems in Integer Lattices (Extended Abstract)Evangelos Kranakis, Michel Pocchiola. compgeom 1990: 261-270 [doi]

Sign in or sign up to see more results.

runs on WebDSL