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. David Eppstein, Philipp Kindermann, Stephen G. Kobourov, Giuseppe Liotta, Anna Lubiw, Aude Maignan, Debajyoti Mondal, Hamideh Vosoughpour, Sue Whitesides, and Stephen K. Wismath. On the Planar Split Thickness of Graphs. Algorithmica, 80(3):977--994, 2018. [WWW ] [bibtex-entry]

1. Baptiste Angles, Marco Tarini, Brian Wyvill, Loïc Barthe, and Andrea Tagliasacchi. Sketch-based Implicit Blending. ACM Trans. Graph. (Proc. SIGGRAPH Asia), 36(6):181:1--181:13, November 2017. [WWW ]
   Keywords: implicit surfaces, sketch-based modeling. [bibtex-entry]

1. 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]



2. 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]



3. Mukul Sati, Jarek Rossignac, Raimund Seidel, Brian Wyvill, and Suraj Musuvathy. Average curve of smooth planar curves. Computer-Aided Design, 70:46 - 55, 2016.
   Note: {SPM} 2015. [WWW ]
   Keywords: Average of curves, Medial axis, Statistical analysis of shapes. [bibtex-entry]

1. Herbert Grasberger, Jean-Luc Duprat, Brian Wyvill, Paul Lalonde, and Jarek Rossignac. Efficient data-parallel tree-traversal for BlobTrees. Computer-Aided Design, pp -, 2015. [WWW ]
   Keywords: BlobTree, Tree traversal, Acceleration. [bibtex-entry]

1. 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]



2. William Evans, Michael Kaufmann, William Lenhart, Tamara Mchedlidze, and Stephen Wismath. Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs. Journal of Graph Algorithms and Applications, 18(5):721--739, 2014. [bibtex-entry]

1. 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]



2. Vida Dujmovic, Will Evans, Sylvain Lazard, William Lenhart, Giuseppe Liotta, David Rappaport, and Steve Wismath. On Point-sets that Support Planar Graphs. Computational Geometry, 43(1):29--50, 2013. [WWW ] [bibtex-entry]

1. Nina Amenta, Dominique Attali, and Olivier Devillers. A Tight Bound for the Delaunay Triangulation of Points on a Polyhedron. Discrete & Computational Geometry, 48:19--38, 2012. [WWW ] [bibtex-entry]



2. Giuseppe Di Battista, Ethan Kim, Giuseppe Liotta, Anna Lubiw, and Sue Whitesides. The Shape of Orthogonal Cycles in Three Dimensions. Discrete & Computational Geometry, 47(3):461-491, 2012. [bibtex-entry]



3. 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]

1. Helmut Alt, Sergio Cabello, Panos Giannopoulos, and Christian Knauer. Minimum cell connection and separation in line segment arrangements. CoRR, abs/1104.4618, 2011. [bibtex-entry]

1. Erin W. Chambers, Alejandro Erickson, Sándor P. Fekete, Jonathan Lenchner, Jeff Sember, Venkatesh Srinivasan, Ulrike Stege, Svetlana Stolpner, Christophe Weibel, and Sue Whitesides. Connectivity graphs of uncertainty regions. CoRR, abs/1009.3469, 2010. [bibtex-entry]



2. Erin W. Chambers, Alejandro Erickson, Sándor P. Fekete, Jonathan Lenchner, Jeff Sember, Venkatesh Srinivasan, Ulrike Stege, Svetlana Stolpner, Christophe Weibel, and Sue Whitesides. Connectivity graphs of uncertainty regions. CoRR, abs/1009.3469, 2010. [bibtex-entry]

1. 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]



2. Michael R. Fellows, Panos Giannopoulos, Christian Knauer, Christophe Paul, Frances A. Rosamond, Sue Whitesides, and Nathan Yu. Abstract Milling with Turn Costs. CoRR, abs/0912.1050, 2009. [bibtex-entry]

1. Vida Dujmovic, Michael R. Fellows, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Sue Whitesides, and David R. Wood. On the Parameterized Complexity of Layered Graph Drawing. Algorithmica, 52(2):267-292, 2008. [bibtex-entry]



2. Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, and Sue Whitesides. Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. Algorithmica, 52(2):167-176, 2008. [bibtex-entry]

1. 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]



2. Hervé Brönnimann, Olivier Devillers, Sylvain Lazard, and Frank Sottile. Lines tangent to four triangles in three-dimensional space. Discrete and Computational Geometry, 37:369--380, 2007. [WWW ] [bibtex-entry]



3. Olivier Devillers, Vida Dujmovic, Hazel Everett, Samuel Hornus, Sue Whitesides, and Steve Wismath. Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint. Internat. J. Comput. Geom. Appl., 17:297--304, 2007. [WWW ] [bibtex-entry]

1. Esther M. Arkin, Hervé Brönnimann, Jeff Erickson, Sándor P. Fekete, Christian Knauer, Jonathan Lenchner, Joseph S. B. Mitchell, and Kim Whittlesey. Minimum-Cost Coverage of Point Sets by Disks. CoRR, abs/cs/0604008, 2006. [bibtex-entry]



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



3. Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, and David R. Wood. A Fixed-Parameter Approach to 2-Layer Planarization. Algorithmica, 45(2):159-182, 2006. [bibtex-entry]

1. H. Brönnimann, H. Everett, S. Lazard, F. Sottile, and S. Whitesides. Transversals to line segments in three-dimensional space. Discrete and Computational Geometry, 34(3):381--390, 2005. [bibtex-entry]



2. Otfried Cheong, X. Goaoc, and H.-S. Na. Geometric permutations of disjoint unit spheres. cgta, 30:253--270, 2005. [bibtex-entry]

1. Olivier Devillers, Vida Dujmovic, Hazel Everett, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, and Sylvain Petitjean. The expected number of 3D visibility events is linear. SIAM Journal on Computing, 32:1586--1620, 2003. [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