Access content directly

# Xavier Goaoc

60
Documents

## Presentation

Professor, Laboratoire d'informatique Gaspard Monge, Université Paris Est Marne-la-Vallée

## Publications

### Convexité combinatoire

Informatique Mathématique : Une photographie en 2020, , 2020, 978-2271134134
Book sections

### Bounding Helly Numbers via Betti Numbers

Martin Loebl, Jaroslav Nešetřil, Robin Thomas. A Journey Through Discrete Mathematics: A Tribute to Jiří Matoušek , Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, pp.407-447, 2017, ⟨10.1007/978-3-319-44479-6_17⟩
Book sections

### Some Discrete Properties of the Space of Line Transversals to Disjoint Balls

I. Emiris, F. Sottile and T. Theobald. Non-linear Computational Geometry, 151, Springer New York, pp.51-84, 2008, The IMA Volumes in Mathematics and its Applications, 978-1-4419-0998-5 (Print) 978-1-4419-0999-2 (Online). ⟨10.1007/978-1-4419-0999-2_3⟩
Book sections

### Convex Hulls of Random Order Types

Journal of the ACM (JACM), In press, ⟨10.1145/3570636⟩
Journal articles

### An experimental study of forbidden patterns in geometric permutations by combinatorial lifting

Journal of Computational Geometry, 2021, Special Issue of Selected Papers from SoCG 2019, 11 (2), pp.131-161. ⟨10.20382/jocg.v11i2a6⟩
Journal articles

### Random polytopes and the wet part for arbitrary probability distributions

Annales Henri Lebesgue, 2020, 3, pp.701-715. ⟨10.5802/ahl.44⟩
Journal articles

### The discrete yet ubiquitous theorems of Caratheodory, Helly, Sperner, Tucker, and Tverberg

Bulletin of the American Mathematical Society, 2019, 56, pp.415-511. ⟨10.1090/bull/1653⟩
Journal articles

### Shatter functions with polynomial growth rates

SIAM Journal on Discrete Mathematics, 2019, 33 (2), pp.784-794. ⟨10.1137/17M1113680⟩
Journal articles

### Shellability is NP-complete

Journal of the ACM (JACM), 2019, 66 (3), pp.1-18. ⟨10.1145/3314024⟩
Journal articles

### On Generalized Heawood Inequalities for Manifolds: A Van Kampen–Flores-type Nonembeddability Result

Israel Journal of Mathematics, 2017, 222 (2), pp.841-866. ⟨10.1007/s11856-017-1607-7⟩
Journal articles

### The Number of Holes in the Union of Translates of a Convex Set in Three Dimensions

Discrete and Computational Geometry, 2017, 57 (1), pp.104 - 124. ⟨10.1007/s00454-016-9820-4⟩
Journal articles

### Smoothed complexity of convex hulls by witnesses and collectors

Journal of Computational Geometry, 2016, 7 (2), pp.101-144. ⟨10.20382/jocg.v7i2a6⟩
Journal articles

### Geometric permutations of non-overlapping unit balls revisited

Computational Geometry, 2016, 53, pp.36-50. ⟨10.1016/j.comgeo.2015.12.003⟩
Journal articles

### Simplifying Inclusion–Exclusion Formulas

Combinatorics, Probability and Computing, 2015, 24 (02), pp.438 - 456. ⟨10.1017/S096354831400042X⟩
Journal articles

### Helly numbers of acyclic families

Advances in Mathematics, 2014, 253, pp.163-193. ⟨10.1016/j.aim.2013.11.004⟩
Journal articles

### Bounded-Curvature Shortest Paths through a Sequence of Points using Convex Optimization

SIAM Journal on Computing, 2013, 42 (2), pp.662-684. ⟨10.1137/100816079⟩
Journal articles

### The monotonicity of $f$-vectors of random polytopes

Electronic Communications in Probability, 2013, 18 (23), pp.1-8. ⟨10.1214/ECP.v18-2469⟩
Journal articles

### Set Systems and Families of Permutations with Small Traces

European Journal of Combinatorics, 2013, 34, pp.229-239
Journal articles

### Lower Bounds to Helly Numbers of Line Transversals to Disjoint Congruent Balls

Israel Journal of Mathematics, 2012, 190 (1), pp.213-228
Journal articles

### Lines Pinning Lines

Discrete and Computational Geometry, 2011
Journal articles

### Pinning a Line by Balls or Ovaloids in $R^3$

Discrete and Computational Geometry, 2011, 45 (2), pp.303-320. ⟨10.1007/s00454-010-9297-5⟩
Journal articles

### Helly-type theorems for approximate covering

Discrete and Computational Geometry, 2009, 42 (3), pp.379--398. ⟨10.1007/s00454-009-9167-1⟩
Journal articles

### Untangling a Planar Graph

Discrete and Computational Geometry, 2009, 42 (4), pp.542-569. ⟨10.1007/s00454-008-9130-6⟩
Journal articles

### Line transversals to disjoint balls

Discrete and Computational Geometry, 2008, 39 (1-3), pp.158--173. ⟨10.1007/s00454-007-9016-z⟩
Journal articles

### Helly-Type Theorems for Line Transversals to Disjoint Unit Balls

Discrete and Computational Geometry, 2008, 39 (1-3), pp.194-212
Journal articles

### Inflating balls is NP-hard

International Journal of Computational Geometry and Applications, 2008
Journal articles

### Lines and free line segments Tangent to Arbitrary Three-dimensional Convex Polyhedra

SIAM Journal on Computing, 2007, 37 (2), pp.522-551. ⟨10.1137/S0097539705447116⟩
Journal articles

### A note on maximally repeated sub-patterns of a point set

Discrete Mathematics, 2006, 306 (16), pp.1965-1968. ⟨10.1016/j.disc.2006.03.045⟩
Journal articles

### Common Tangents to Spheres in $R3$

Discrete and Computational Geometry, 2006, 35 (2), pp.287-300. ⟨10.1007/s00454-005-1230-y⟩
Journal articles

### Geometric Permutations of Disjoint Unit Spheres

Computational Geometry, 2005, 30 (3), pp.253-270
Journal articles

### The expected number of 3D visibility events is linear

SIAM Journal on Computing, 2003, 32 (6), pp.1586-1620. ⟨10.1137/S0097539702419662⟩
Journal articles

### A Stepping-Up Lemma for Topological Set Systems

SoCG 2021 - 37th International Symposium on Computational Geometry, Jun 2021, Buffalo/virtual, United States. pp.40:1--40:17, ⟨10.4230/LIPIcs.SoCG.2021.40⟩
Conference papers

### Convex Hulls of Random Order Types

SoCG 2020 - 36th International Symposium on Computational Geometry, Jun 2020, Zürich / Virtual, Switzerland. pp.49:1--49:15, ⟨10.4230/LIPIcs.SoCG.2020.49⟩
Conference papers

### An experimental study of forbidden patterns in geometric permutations by combinatorial lifting

35th International Symposium on Computational Geometry, 2019, Portland, United States. ⟨10.4230/LIPIcs.SoCG.2019.40⟩
Conference papers

### Shellability is NP-complete

International Symposium on Computational Geometry, 2018, Budapest, Hungary
Conference papers

### Consistent Sets of Lines with no Colorful Incidence

SoCG 2018 - 34thInternational Symposium on Computational Geometry, Jun 2018, Budapest, Hungary. pp.1-20
Conference papers

### The Number of Holes in the Union of Translates of a Convex Set in Three Dimensions

SoCG 2016, Jun 2016, Boston, United States. pp.10:1-10:16
Conference papers

### Limits of order types

Symposium on Computational Geometry 2015, Jun 2015, Eindhoven, Netherlands. pp.876, ⟨10.4230/LIPIcs.SOCG.2015.300⟩
Conference papers

### On the smoothed complexity of convex hulls

Proceedings of the 31st International Symposium on Computational Geometry, Jun 2015, Eindhoven, Netherlands. pp.224-238, ⟨10.4230/LIPIcs.SOCG.2015.224⟩
Conference papers

### On Generalized Heawood Inequalities for Manifolds: A Van Kampen–Flores-type Nonembeddability Result

31st International Symposium on Computational Geometry (SoCG’15), Jun 2015, Eindhoven, Netherlands. pp.476-490, ⟨10.4230/LIPIcs.SOCG.2015.476⟩
Conference papers

### Bounding Helly Numbers via Betti Numbers

International Symposium on Computational Geometry, 2015, Eindhoven, Netherlands. pp.507--521, ⟨10.4230/LIPIcs.SOCG.2015.507⟩
Conference papers

### Complexity Analysis of Random Geometric Structures Made Simpler

29th Annual Symposium on Computational Geometry, Jun 2013, Rio, Brazil. pp.167-175, ⟨10.1145/2462356.2462362⟩
Conference papers

### Simplifying inclusion-exclusion formulas

European Conference on Combinatorics, Graph Theory and Applications, Sep 2013, Pisa, Italy
Conference papers

### Multinerves and Helly Numbers of Acyclic Families

Symposium on Computational Geometry - SoCG '12, Jun 2012, Chapel Hill, United States. pp.209-218, ⟨10.1145/2261250.2261282⟩
Conference papers

### Admissible Linear Map Models of Linear Cameras

23rd IEEE Conference on Computer Vision and Pattern Recognition - CVPR 2010, Jun 2010, San Francisco, United States. pp.1578 - 1585, ⟨10.1109/CVPR.2010.5539784⟩
Conference papers

### Set Systems and Families of Permutations with Small Traces (abstract)

8th French Combinatorial Conference, 2010, France
Conference papers

### Computing Direct Shadows Cast by Convex Polyhedra

25th European Workshop on Computational Geometry - EuroCG 2009, Mar 2009, Brussels, Belgium
Conference papers

### Lower Bounds for Pinning Lines by Balls (Extended Abstract)

European Conference on Combinatorics, Graph Theory and Applications - EuroComb 2009, Sep 2009, Bordeaux, France. pp.567-571, ⟨10.1016/j.endm.2009.07.094⟩
Conference papers

### Helly-type theorems for approximate covering

SoCG 2008 - 24th Annual Symposium on Computational Geometry, Jun 2008, College Park, Maryland, United States. pp.120--128
Conference papers

### Empty-ellipse graphs

19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'08), 2008, San Francisco, United States. pp.1249--1256
Conference papers

### There are arbitrary large minimal 2-pinning configurations

The First Asian Association for Algorithms and Computation Annual Meeting - AAAC 08, Apr 2008, Hong-Kong, China
Conference papers

### Moving vertices to make drawings plane

15th International Symposium on Graph Drawing, Sep 2007, Sydney, Australia. pp.101-112, ⟨10.1007/978-3-540-77537-9_13⟩
Conference papers

### Line transversals to disjoint balls

23rd Annual ACM Symposium on Computational Geometry 2007 - SoCG'07, 2007, Gyeongju, South Korea. pp.245-254, ⟨10.1145/1247069.1247115⟩
Conference papers

### Helly-type Theorems for Line transversals to Disjoint Unit Balls (Extended abstract)

European Workshop on Computational Geometry, Mar 2006, Delphi, Greece. pp.87--89
Conference papers

### Hadwiger and Helly-type theorems for disjoint unit spheres in R3

21st Annual ACM Symposium on Computational Geometry 2005 (SoCG'05 ), Jun 2005, Pisa, Italy. pp.10-15, ⟨10.1145/1064092.1064097⟩
Conference papers

### The Number of Lines Tangent to Arbitrary Convex Polyhedra in 3D

Proceedings of the 20th Annual Symposium on Computational Geometry, Jun 2004, Brooklyn, NY, United States. pp.46 - 55, ⟨10.1145/997817.997827⟩
Conference papers

### Disjoint Unit Spheres Admit At Most Two Line Transversals

11th Annual European Symposium on Algorithms - ESA 2003, Sep 2003, Budapest, Hungary. pp.127-135, ⟨10.1007/b13632⟩
Conference papers

### On the worst-case complexity of the silhouette of a polytope

15th Canadian Conference on Computational Geometry - CCCG 2003, 2003, Halifax, Canada, 4 p
Conference papers