# Michel Pocchiola

According to our database

Collaborative distances:

^{1}, Michel Pocchiola authored at least 30 papers between 1990 and 2013.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2013

LR Characterization of Chirotopes of Finite Planar Families of Pairwise Disjoint Convex bodies.

Discrete & Computational Geometry, 2013

2012

Multitriangulations, Pseudotriangulations and Primitive Sorting Networks.

Discrete & Computational Geometry, 2012

Computing Pseudotriangulations via Branched Coverings.

Discrete & Computational Geometry, 2012

2011

On the Number of Simple Arrangements of Five Double Pseudolines.

Discrete & Computational Geometry, 2011

Computing pseudotriangulations via branched coverings

CoRR, 2011

Arrangements of double pseudolines

CoRR, 2011

2010

Multitriangulations, pseudotriangulations and primitive sorting networks

CoRR, 2010

On the number of simple arrangements of five double pseudolines

CoRR, 2010

2009

Arrangements of double pseudolines: extended abstract.

Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

2008

Preface.

Electronic Notes in Discrete Mathematics, 2008

2006

Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm.

SIAM J. Comput., 2006

2005

Counting and Enumerating Pointed Pseudo-triangulations with the Greedy Flip Algorithm.

Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, 2005

2003

Tutte's barycenter method applied to isotopies.

Comput. Geom., 2003

2001

Computing a canonical polygonal schema of an orientable triangulated surface.

Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

A sum of squares theorem for visibility.

Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

Tutte's barycenter method applied to isotopies.

Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

2000

On Computing Tangent Visibility Graphs.

EuroCG, 2000

1996

The visibility complex.

Int. J. Comput. Geometry Appl., 1996

Random generation of finite Sturmian words.

Discrete Mathematics, 1996

Topologically Sweeping Visibility Complexes via Pseudotriangulations.

Discrete & Computational Geometry, 1996

Minimal Tangent Visibility Graphs.

Comput. Geom., 1996

Pseudo-Triangulations: Theory and Applications.

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

1995

Computing the Visibility Graph via Pseudo-Triangulations.

Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994

Average Cost of Duval's Algorithm for Generating Lyndon Words.

Theor. Comput. Sci., 1994

Camera Placement in Integer Lattices.

Discrete & Computational Geometry, 1994

Counting Problems Relating to a Theorem of Dirichlet.

Comput. Geom., 1994

Minimal Tangent Visibility Graphs.

Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1993

A Geometric Proof of the Enumeration Formula for Sturmian Words.

IJAC, 1993

The Visibility Complex.

Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

1990

Enumeration and Visibility Problems in Integer Lattices (Extended Abstract).

Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990