1. David Bremner, Olivier Devillers, Marc Glisse, Sylvain Lazard, Giuseppe Liotta, Tamara Mchedlidze, Guillaume Moroz, Sue Whitesides, and Stephen Wismath. Monotone Simultaneous Paths Embeddings in $\mathbb{R}^d$. Discrete Mathematics and Theoretical Computer Science, 20(1):1-11, January 2018. [WWW ] [PDF ]
   Keywords: algorithm, point hyperplane duality, graph drawing, high-dimensional space. [bibtex-entry]



2. Dominique Attali, Olivier Devillers, Marc Glisse, and Sylvain Lazard. Recognizing Shrinkable Complexes Is NP-Complete. Journal of Computational Geometry, 7(1):430--443, 2016. [WWW ] [PDF ] [bibtex-entry]



3. Olivier Devillers, Marc Glisse, Xavier Goaoc, and Rémy Thomasse. Smoothed complexity of convex hulls by witnesses and collectors. Journal of Computational Geometry, 7(2):101-144, 2016. [WWW ] [bibtex-entry]



4. Dominique Attali, Ulrich Bauer, Olivier Devillers, Marc Glisse, and André Lieutier. Homological Reconstruction and Simplification in R3. Computational Geometry, pp http://www.sciencedirect.com/science/article/pii/S0925772114000923, 2014. [WWW ] [PDF ]
   Keywords: persistence, NP-hard problems, homology. [bibtex-entry]



5. Olivier Devillers, Marc Glisse, Xavier Goaoc, Guillaume Moroz, and Matthias Reitzner. The monotonicity of $f$-vectors of random polytopes. Electronic Communications in Probability, 18(23):1-8, 2013. [WWW ] [bibtex-entry]



6. Marc Glisse and Sylvain Lazard. On the Complexity of Sets of Free Lines and Line Segments Among Balls in Three Dimensions. Discrete and Computational Geometry, 47(4):756-772, 2012. [WWW ] [bibtex-entry]



7. Julien Demouth, Olivier Devillers, Hazel Everett, Marc Glisse, Sylvain Lazard, and Raimund Seidel. On the complexity of umbra and penumbra. Comput. Geom. Theory Appl., 42:758--771, 2009. [WWW ] [bibtex-entry]



8. H. Brönnimann, O. Devillers, Vida Dujmovic, H. Everett, M. Glisse, X. Goaoc, S. Lazard, H.-S. Na, and S. Whitesides. Lines and free line segments tangent to arbitrary three-dimensional convex polyhedra. SIAM Journal on Computing, 37:522--551, 2007. [WWW ] [bibtex-entry]



9. Hervé Brönnimann and Marc Glisse. Octrees with near optimal cost for ray-shooting. Comput. Geom., 34(3):182-194, 2006. [bibtex-entry]

1. Olivier Devillers, Marc Glisse, Xavier Goaoc, and Rémy Thomasse. On the smoothed complexity of convex hulls. In 31st International Symposium on Computational Geometry, Eindhoven, Netherlands, June 2015. Lipics. [WWW ] [PDF ] [bibtex-entry]



2. Dominique Attali, Olivier Devillers, Marc Glisse, and Sylvain Lazard. Recognizing shrinkable complexes is NP-complete. In A. Schulz and D. Wagner, editors, 22nd European Symposium on Algorithms, volume 8737, Wroclaw, Poland, pages 74-86, 2014. Springer. [WWW ] [PDF ] [bibtex-entry]



3. Dominique Attali, Ulrich Bauer, Olivier Devillers, Marc Glisse, and AndrŽ Lieutier. Homological reconstruction and simplification in $I\!\!R^3$. In Proc. of the 29th Annual Symposium on Computational Geometry, pages 117--125, 2013. [WWW ] [bibtex-entry]



4. Olivier Devillers, Marc Glisse, and Xavier Goaoc. Complexity analysis of random geometric structures made simpler. In Proc. of the 29th Annual Symposium on Computational Geometry, pages 167--175, 2013. [WWW ] [bibtex-entry]



5. Fabrizio Frati, Marc Glisse, William Lenhart, Giuseppe Liotta, Tamara Mchedlidze, and Rahnuma Islam Nishat. Point-Set Embeddability of 2-Colored Trees. In Graph Drawing, 2012. [bibtex-entry]



6. Marc Glisse and Sylvain Lazard. On the Complexity of Sets of Free Lines and Line Segments Among Balls in Three Dimensions. In 26th Symposium on Computational geometry - SoCG'10, 2010. [WWW ] [bibtex-entry]



7. Olivier Devillers, Marc Glisse, and Sylvain Lazard. Predicates for line transversals to lines and line segments in three-dimensional space. In 24th Symposium on Computational Geometry -- SoCG'08, pages 174-181, 2008. [WWW ] [bibtex-entry]



8. Julien Demouth, Olivier Devillers, Hazel Everett, Marc Glisse, Sylvain Lazard, and Raimund Seidel. Between umbra and penumbra. In 23th Symposium on Computational Geometry -- SoCG'07, pages 265--274, 2007. [WWW ] [bibtex-entry]



9. H. Brönnimann, O. Devillers, Vida Dujmovic, H. Everett, M. Glisse, X. Goaoc, S. Lazard, H.-S. Na, and S. Whitesides. The Number of Lines Tangent to Arbitrary Convex Polyhedra in 3D. In 20th Symposium on Computational Geometry -- SoCG'04, pages 46--59, 2004. [WWW ] [bibtex-entry]



10. Hervé Brönnimann and Marc Glisse. Cost-Optimal Trees for Ray Shooting. In LATIN, pages 349-358, 2004. [bibtex-entry]



11. H. Alt, M. Glisse, and X. Goaoc. On the worst-case complexity of the silhouette of a polytope. In 15th Canadian Conference on Computational Geometry - CCCG, 4 pages, 2003. [WWW ] [bibtex-entry]



12. H. Brönnimann, O. Devillers, Vida Dujmovic, H. Everett, M. Glisse, X. Goaoc, S. Lazard, H.-S. Na, and S. Whitesides. On the Number of Lines Tangent to Four Convex Polyhedra. In 8th Canad. Conf. Comput. Geom., pages 113--117, 2002. [bibtex-entry]



13. Hervé Brönnimann, Marc Glisse, and David R. Wood. Cost-optimal quadtrees for ray shooting. In CCCG, pages 109-112, 2002. [bibtex-entry]

1. Dominique Attali, Ulrich Bauer, Olivier Devillers, Marc Glisse, and André Lieutier. Homological reconstruction and simplification in ${\mathbb R}^3$. Research Report 8169, INRIA, 2012. [WWW ] [bibtex-entry]



2. Olivier Devillers, Marc Glisse, and Xavier Goaoc. Complexity analysis of random geometric structures made simpler. Research Report 8168, INRIA, 2012. [WWW ] [bibtex-entry]



3. Olivier Devillers, Marc Glisse, Xavier Goaoc, Guillaume Moroz, and Matthias Reitzner. The monotonicity of $f$-vectors of random polytopes. Research Report 8154, INRIA, 2012. [WWW ] [bibtex-entry]

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

Les documents contenus dans ces répertoires sont rendus disponibles par les auteurs qui y ont contribué en vue d'assurer la diffusion à temps de travaux savants et techniques sur une base non-commerciale. Les droits de copie et autres droits sont gardés par les auteurs et par les détenteurs du copyright, en dépit du fait qu'ils présentent ici leurs travaux sous forme électronique. Les personnes copiant ces informations doivent adhérer aux termes et contraintes couverts par le copyright de chaque auteur. Ces travaux ne peuvent pas être rendus disponibles ailleurs sans la permission explicite du détenteur du copyright.

This document was translated from BibT_EX by bibtex2html