BACK TO INDEX

All publications sorted by year
2016
  1. 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-key = devillers:hal-01285120] [bibtex-entry]


  2. David Eppstein, Philipp Kindermann, Stephen Kobourov, Giuseppe Liotta, Anna Lubiw, Aude Maignan, Debajyoti Mondal, Hamideh Vosoughpour, Sue Whitesides, and Stephen Wismath. On the Planar Split Thickness of Graphs. In LATIN 2014: Theoretical Informatics - 13th Latin American Symposium. Proceedings, volume 9644 of Lecture Notes in Computer Science, 2016. Springer.
    Note: On print. [bibtex-key = Barbados-latin/2016] [bibtex-entry]


2015
  1. Helmut Alt, Mark de Berg, and Christian Knauer. Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons. In Algorithms - ESA 2015 - 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings, pages 25--34, 2015. [WWW ] [bibtex-key = DBLP:conf/esa/AltBK15] [bibtex-entry]


  2. 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-key = devillers:hal-01144473] [bibtex-entry]


  3. Laurie J. Heyer, Anna Lubiw, Debajyoti Mondal, Ulrike Stege, and Sue Whitesides. Reconfiguring a Chain of Cubes. In Proceedings of the 27th Canadian Conference on Computational Geometry, CCCG 2015, Kingston, Ontario, Canada, August 10-12, 2015, 2015. [WWW ] [bibtex-key = DBLP:conf/cccg/HeyerLMSW15] [bibtex-entry]


2014
  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-key = attali:hal-01132440] [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-key = JGAA-343] [bibtex-entry]


  3. 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-key = attali:hal-01015747] [bibtex-entry]


2013
  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-key = geometrica-8154a] [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-key = dujmovic:hal-00684510] [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-key = geometrica-8169i] [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-key = geometrica-8168i] [bibtex-entry]


  5. William Lenhart, Giuseppe Liotta, Debajyoti Mondal, and Rahnuma Islam Nishat. Planar and Plane Slope Number of Partial 2-Trees. In Graph Drawing, pages 412-423, 2013. [bibtex-key = DBLP:conf/gd/LenhartLMN13] [bibtex-entry]


2012
  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-key = geometrica-6522a] [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-key = DBLP:journals/dcg/BattistaKLLW12] [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-key = glisse:hal-00643880] [bibtex-entry]


  4. David Bremner, William Evans, Fabrizio Frati, Laurie Heyer, Stephen G. Kobourov, William Lenhart, Giuseppe Liotta, David Rappaport, and Sue Whitesides. On Representing Graphs by Touching Cuboids. In Graph Drawing, 2012. [bibtex-key = Brenmer+2012] [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-key = Frati+2012] [bibtex-entry]


  6. Stephen G. Kobourov, Debajyoti Mondal, and Rahnuma Islam Nishat. Touching Triangle Representations for 3-Connected Planar Graphs. In Graph Drawing, 2012. [bibtex-key = kmn12] [bibtex-entry]


  7. Guillaume Moroz and Boris Aronov. Computing the distance between piecewise-linear bivariate functions. In 23rd ACM-SIAM Symposium on Discrete Algorithms, SODA'12, pages 288--293, 2012. SIAM. [WWW ] [bibtex-key = Moroz:2012:CDP:2095116.2095143] [bibtex-entry]


  8. Brian Wyvill, Paul G. Kry, Raimund Seidel, and David Mould. Determining an Aesthetic Inscribed Curve. In Computational Aesthetics, pages 63-70, 2012. [bibtex-key = DBLP:conf/cae/WyvillKSM12] [bibtex-entry]


  9. 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-key = geometrica-8169t] [bibtex-entry]


  10. 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-key = geometrica-8154t] [bibtex-entry]


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


2011
  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-key = DBLP:journals/corr/abs-1104-4618] [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. In Graph Drawing, 2011. [WWW ] [bibtex-key = dujmovic:hal-00643824] [bibtex-entry]


2010
  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-key = DBLP:journals/corr/abs-1009-3469] [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-key = DBLP:journals/corr/abs-1009-3469] [bibtex-entry]


  3. 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. In ISAAC, pages 434-445, 2010. [bibtex-key = DBLP:conf/isaac/ChambersEFLSSSSWW10] [bibtex-entry]


  4. 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. In ISAAC, pages 434-445, 2010. [bibtex-key = DBLP:conf/isaac/ChambersEFLSSSSWW10] [bibtex-entry]


  5. Vida Dujmovic, William Evans, Stephen G. Kobourov, Giuseppe Liotta, Christophe Weibel, and Steve Wismath. On Graphs Supported by Line Sets. In Graph Drawing, pages 177-182, 2010. [bibtex-key = DBLP:conf/gd/DujmovicEKLWW10] [bibtex-entry]


  6. Mike R. Fellows, Panos Giannopoulos, Christian Knauer, Christophe Paul, Frances A. Rosamond, Sue Whitesides, and Nathan Yu. Milling a Graph with Turn Costs: A Parameterized Complexity Perspective. In WG, pages 123-134, 2010. [bibtex-key = DBLP:conf/wg/FellowsGKPRWY10] [bibtex-entry]


  7. 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-key = glisse:inria-00442751] [bibtex-entry]


2009
  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-key = geometrica-6347a] [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-key = DBLP:journals/corr/abs-0912-1050] [bibtex-entry]


  3. Dominique Attali, Olivier Devillers, and Xavier Goaoc. The Effect of Noise on the Number of Extreme Points. Research Report 7134, INRIA, 2009. [WWW ] [bibtex-key = geometrica-7134t] [bibtex-entry]


2008
  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-key = DBLP:journals/algorithmica/DujmovicFKLMNRRWW08] [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-key = DBLP:journals/algorithmica/FellowsKNRRSTW08] [bibtex-entry]


  3. Helmut Alt, Sergio Cabello, Panos Giannopoulos, and Christian Knauer. On some connection problems in straight-line segment arrangements. In 24th European Workshop on Computational Geometry (EuroCG'08), 2008. [bibtex-key = alt08] [bibtex-entry]


  4. 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-key = devillers:inria-00336256] [bibtex-entry]


  5. Svetlana Stolpner, Jonathan Lenchner, Giuseppe Liotta, David Bremner, Christophe Paul, Marc Pouget, and Steve Wismath. A note on alpha-drawable k-trees. In CCCG, 2008. [bibtex-key = DBLP:conf/cccg/StolpnerLLBPPW08] [bibtex-entry]


2007
  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-key = geometrica-5671a] [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-key = geometrica-5693a] [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-key = geometrica-5742a] [bibtex-entry]


  4. Nina Amenta, Dominique Attali, and Olivier Devillers. Complexity of Delaunay triangulation for points on lower-dimensional polyhedra. In 18th ACM-SIAM Symposium on Discrete Algorithms, pages 1106--1113, 2007. [WWW ] [bibtex-key = geometrica-5986i] [bibtex-entry]


  5. 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-key = geometrica-6347i] [bibtex-entry]


2006
  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-key = DBLP:journals/corr/abs-cs-0604008] [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-key = DBLP:journals/comgeo/BronnimannG06] [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-key = DBLP:journals/algorithmica/DujmovicFHKLMNRRSWW06] [bibtex-entry]


  4. Helmut Alt, 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. In Symposium on Computational Geometry -- SoCG'06, pages 449-458, 2006. [bibtex-key = DBLP:conf/compgeom/AltABEFKLMW06] [bibtex-entry]


2005
  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-key = bronnimann05a] [bibtex-entry]


  2. Otfried Cheong, X. Goaoc, and H.-S. Na. Geometric permutations of disjoint unit spheres. cgta, 30:253--270, 2005. [bibtex-key = gp-j] [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. In 17th Canad. Conf. Comput. Geom., pages 302--305, 2005. [WWW ] [bibtex-key = geometrica-5742i] [bibtex-entry]


2004
  1. 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-key = geometrica-5671i] [bibtex-entry]


  2. Hervé Brönnimann, Olivier Devillers, Sylvain Lazard, and Frank Sottile. On the number of line tangents to four triangles in three-dimensional space. In 10th Canad. Conf. Comput. Geom., 2004. [bibtex-key = geometrica-5693i] [bibtex-entry]


  3. Hervé Brönnimann and Marc Glisse. Cost-Optimal Trees for Ray Shooting. In LATIN, pages 349-358, 2004. [bibtex-key = DBLP:conf/latin/BronnimannG04] [bibtex-entry]


  4. 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. In ESA, pages 311-322, 2004. [bibtex-key = DBLP:conf/esa/FellowsKNRRSTW04] [bibtex-entry]


2003
  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-key = prisme-4671a] [bibtex-entry]


  2. 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-key = silh] [bibtex-entry]


  3. Hervé Bronnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, and Sue Whitesides. Transversals to Line Segments in R3. In 15th Canadian Conference on Computational Geometry - CCCG'2003, pages 4 p, 2003. [WWW ] [bibtex-key = bronnimann:inria-00099479] [bibtex-entry]


  4. O. Cheong, X. Goaoc, and H.-S. Na. Disjoint Unit Spheres Admit At Most Two Line Transversals. In 11th European Symposium on Algorithms -- ESA'03, volume 2832 of lncs, pages 127--135, 2003. [bibtex-key = gp-c] [bibtex-entry]


2002
  1. 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-key = geometrica-5671i1] [bibtex-entry]


  2. Hervé Brönnimann, Marc Glisse, and David R. Wood. Cost-optimal quadtrees for ray shooting. In CCCG, pages 109-112, 2002. [bibtex-key = DBLP:conf/cccg/BronnimannGW02] [bibtex-entry]



BACK TO INDEX




Disclaimer:

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.




Last modified: Thu May 12 15:15:31 2016
Author: lazard.


This document was translated from BibTEX by bibtex2html