Search the dblp DataBase
Michel Pocchiola: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Hervé Brönnimann, Lutz Kettner, Michel Pocchiola, Jack Snoeyink
Counting and Enumerating Pointed Pseudo-triangulations with the Greedy Flip Algorithm. [Citation Graph (0, 0)][DBLP]
ALENEX/ANALCO, 2005, pp:98-110 [Conf] - Michel Pocchiola, Gert Vegter
Minimal Tangent Visibility Graphs. [Citation Graph (0, 0)][DBLP]
CCCG, 1994, pp:24-29 [Conf] - Éric Colin de Verdière, Michel Pocchiola, Gert Vegter
Tutte's barycenter method applied to isotopies. [Citation Graph (0, 0)][DBLP]
CCCG, 2001, pp:57-60 [Conf] - Pierre Angelier, Michel Pocchiola
A sum of squares theorem for visibility. [Citation Graph (0, 0)][DBLP]
Symposium on Computational Geometry, 2001, pp:302-311 [Conf] - Evangelos Kranakis, Michel Pocchiola
Enumeration and Visibility Problems in Integer Lattices (Extended Abstract). [Citation Graph (0, 0)][DBLP]
Symposium on Computational Geometry, 1990, pp:261-270 [Conf] - Francis Lazarus, Michel Pocchiola, Gert Vegter, Anne Verroust
Computing a canonical polygonal schema of an orientable triangulated surface. [Citation Graph (0, 0)][DBLP]
Symposium on Computational Geometry, 2001, pp:80-89 [Conf] - Michel Pocchiola, Gert Vegter
The Visibility Complex. [Citation Graph (0, 0)][DBLP]
Symposium on Computational Geometry, 1993, pp:328-337 [Conf] - Michel Pocchiola, Gert Vegter
Computing the Visibility Graph via Pseudo-Triangulations. [Citation Graph (0, 0)][DBLP]
Symposium on Computational Geometry, 1995, pp:248-257 [Conf] - Michel Pocchiola, Gert Vegter
Pseudo-Triangulations: Theory and Applications. [Citation Graph (0, 0)][DBLP]
Symposium on Computational Geometry, 1996, pp:291-300 [Conf] - Pierre Angelier, Michel Pocchiola
On Computing Tangent Visibility Graphs. [Citation Graph (0, 0)][DBLP]
EWCG, 2000, pp:108-111 [Conf] - Evangelos Kranakis, Michel Pocchiola
Counting Problems Relating to a Theorem of Dirichlet. [Citation Graph (0, 0)][DBLP]
Comput. Geom., 1994, v:4, n:, pp:309-325 [Journal] - Éric Colin de Verdière, Michel Pocchiola, Gert Vegter
Tutte's barycenter method applied to isotopies. [Citation Graph (0, 0)][DBLP]
Comput. Geom., 2003, v:26, n:1, pp:81-97 [Journal] - Michel Pocchiola, Gert Vegter
Minimal Tangent Visibility Graphs. [Citation Graph (0, 0)][DBLP]
Comput. Geom., 1996, v:6, n:, pp:303-314 [Journal] - Evangelos Kranakis, Michel Pocchiola
Camera Placement in Integer Lattices. [Citation Graph (0, 0)][DBLP]
Discrete & Computational Geometry, 1994, v:12, n:, pp:91-104 [Journal] - Michel Pocchiola, Gert Vegter
Topologically Sweeping Visibility Complexes via Pseudotriangulations. [Citation Graph (0, 0)][DBLP]
Discrete & Computational Geometry, 1996, v:16, n:4, pp:419-453 [Journal] - Michel Pocchiola, Gert Vegter
The visibility complex. [Citation Graph (0, 0)][DBLP]
Int. J. Comput. Geometry Appl., 1996, v:6, n:3, pp:279-308 [Journal] - Hervé Brönnimann, Lutz Kettner, Michel Pocchiola, Jack Snoeyink
Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 2006, v:36, n:3, pp:721-739 [Journal] - Jean Berstel, Michel Pocchiola
Average Cost of Duval's Algorithm for Generating Lyndon Words. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1994, v:132, n:2, pp:415-425 [Journal] - Jean Berstel, Michel Pocchiola
Random generation of finite Sturmian words. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1996, v:153, n:1-3, pp:29-39 [Journal]
Arrangements of double pseudolines: extended abstract. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002