Xavier Goaoc

Orcid: 0000-0002-4331-7169

Affiliations:
  • Université de Lorraine, Nancy, France
  • University of Marne-la-Vallée, France (former)


According to our database1, Xavier Goaoc authored at least 51 papers between 2002 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Some New Results on Geometric Transversals.
Discret. Comput. Geom., September, 2024

Guest Editors' Foreword.
Discret. Comput. Geom., January, 2024

A canonical tree decomposition for order types, and some applications.
CoRR, 2024

A Canonical Tree Decomposition for Chirotopes.
Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023
Convex Hulls of Random Order Types.
J. ACM, February, 2023

2021
A Stepping-Up Lemma for Topological Set Systems.
Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020
An experimental study of forbidden patterns in geometric permutations by combinatorial lifting.
J. Comput. Geom., 2020

2019
Shatter Functions with Polynomial Growth Rates.
SIAM J. Discret. Math., 2019

Shellability is NP-complete.
J. ACM, 2019

2018
On Order Types of Random Point Sets.
CoRR, 2018

Consistent Sets of Lines with no Colorful Incidence.
Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017
The Number of Holes in the Union of Translates of a Convex Set in Three Dimensions.
Discret. Comput. Geom., 2017

The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg.
CoRR, 2017

2016
Smoothed complexity of convex hulls by witnesses and collectors.
J. Comput. Geom., 2016

Geometric permutations of non-overlapping unit balls revisited.
Comput. Geom., 2016

2015
Simplifying Inclusion-Exclusion Formulas.
Comb. Probab. Comput., 2015

Bounding Helly Numbers via Betti Numbers.
Proceedings of the 31st International Symposium on Computational Geometry, 2015

On Generalized Heawood Inequalities for Manifolds: A Van Kampen-Flores-type Nonembeddability Result.
Proceedings of the 31st International Symposium on Computational Geometry, 2015

Limits of Order Types.
Proceedings of the 31st International Symposium on Computational Geometry, 2015

On the Smoothed Complexity of Convex Hulls.
Proceedings of the 31st International Symposium on Computational Geometry, 2015

2013
Bounded-Curvature Shortest Paths through a Sequence of Points Using Convex Optimization.
SIAM J. Comput., 2013

Set systems and families of permutations with small traces.
Eur. J. Comb., 2013

Complexity analysis of random geometric structures made simpler.
Proceedings of the Symposium on Computational Geometry 2013, 2013

2012
The monotonicity of f-vectors of random polytopes
CoRR, 2012

Multinerves and helly numbers of acyclic families.
Proceedings of the 28th ACM Symposium on Computational Geometry, 2012

2011
Inflating Balls is NP-Hard.
Int. J. Comput. Geom. Appl., 2011

Pinning a Line by Balls or Ovaloids in ℝ<sup>3</sup>.
Discret. Comput. Geom., 2011

Lines Pinning Lines.
Discret. Comput. Geom., 2011

Helly numbers of acyclic families
CoRR, 2011

Transversal Helly numbers, pinning theorems and projection of simplicial complexes. (Nombres de Helly, théorèmes d'épinglement et projection de complexes simpliciaux).
, 2011

2010
Admissible linear map models of linear cameras.
Proceedings of the Twenty-Third IEEE Conference on Computer Vision and Pattern Recognition, 2010

2009
Lower Bounds for Pinning Lines by Balls (Extended Abstract).
Electron. Notes Discret. Math., 2009

Untangling a Planar Graph.
Discret. Comput. Geom., 2009

Helly-Type Theorems for Approximate Covering.
Discret. Comput. Geom., 2009

Lower Bounds for Pinning Lines by Balls
CoRR, 2009

2008
Helly-Type Theorems for Line Transversals to Disjoint Unit Balls.
Discret. Comput. Geom., 2008

Line Transversals to Disjoint Balls.
Discret. Comput. Geom., 2008

Empty-ellipse graphs.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2007
Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra.
SIAM J. Comput., 2007

Hadwiger and Helly-type theorems for disjoint unit spheres
CoRR, 2007

Moving Vertices to Make Drawings Plane.
Proceedings of the Graph Drawing, 15th International Symposium, 2007

2006
A note on maximally repeated sub-patterns of a point set.
Discret. Math., 2006

Common Tangents to Spheres in R<sup>3</sup>.
Discret. Comput. Geom., 2006

2005
Geometric permutations of disjoint unit spheres.
Comput. Geom., 2005

A Polynomial-time Algorithm to Design Push Plans for Sensorless Parts Sorting.
Proceedings of the Robotics: Science and Systems I, 2005

Hadwiger and Helly-type theorems for disjoint unit spheres in R<sup>3</sup>.
Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

2004
The number of lines tangent to arbitrary convex polyhedra in 3D.
Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

2003
The Expected Number of 3D Visibility Events Is Linear.
SIAM J. Comput., 2003

Disjoint Unit Spheres admit at Most Two Line Transversals.
Proceedings of the Algorithms, 2003

On the worst-case complexity of the silhouette of a polytope.
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002
On the number of lines tangent to four convex polyhedra.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002


  Loading...