Marc Glisse
17
Documents
Publications
- 17
- 16
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 2
- 2
- 1
- 1
- 2
- 1
- 1
- 1
- 1
|
Smoothed complexity of convex hulls by witnesses and collectorsJournal of Computational Geometry, 2016, 7 (2), pp.101-144. ⟨10.20382/jocg.v7i2a6⟩
Article dans une revue
hal-01285120v1
|
|
The monotonicity of $f$-vectors of random polytopesElectronic Communications in Probability, 2013, 18 (23), pp.1-8. ⟨10.1214/ECP.v18-2469⟩
Article dans une revue
hal-00805690v1
|
|
Helly-type theorems for approximate coveringDiscrete and Computational Geometry, 2009, 42 (3), pp.379--398. ⟨10.1007/s00454-009-9167-1⟩
Article dans une revue
inria-00404171v1
|
|
Lines and free line segments Tangent to Arbitrary Three-dimensional Convex PolyhedraSIAM Journal on Computing, 2007, 37 (2), pp.522-551. ⟨10.1137/S0097539705447116⟩
Article dans une revue
inria-00103916v1
|
|
On the smoothed complexity of convex hullsProceedings of the 31st International Symposium on Computational Geometry, Jun 2015, Eindhoven, Netherlands. pp.224-238, ⟨10.4230/LIPIcs.SOCG.2015.224⟩
Communication dans un congrès
hal-01144473v2
|
|
Complexity Analysis of Random Geometric Structures Made Simpler29th Annual Symposium on Computational Geometry, Jun 2013, Rio, Brazil. pp.167-175, ⟨10.1145/2462356.2462362⟩
Communication dans un congrès
hal-00833774v1
|
|
Helly-type theorems for approximate coveringSoCG 2008 - 24th Annual Symposium on Computational Geometry, Jun 2008, College Park, Maryland, United States. pp.120--128
Communication dans un congrès
inria-00331435v1
|
|
The Number of Lines Tangent to Arbitrary Convex Polyhedra in 3DProceedings of the 20th Annual Symposium on Computational Geometry, Jun 2004, Brooklyn, NY, United States. pp.46 - 55, ⟨10.1145/997817.997827⟩
Communication dans un congrès
inria-00103995v1
|
|
On the worst-case complexity of the silhouette of a polytope15th Canadian Conference on Computational Geometry - CCCG 2003, 2003, Halifax, Canada, 4 p
Communication dans un congrès
inria-00099478v1
|
|
On the Number of Lines Tangent to Four Convex Polyhedra14th Canadian Conference on Computational Geometry - CCCG'02, 2002, Lethbridge, Canada
Communication dans un congrès
inria-00099449v1
|
|
Two Lower Bounds for Random Point Sets via Negative Association2023
Pré-publication, Document de travail
hal-04320184v1
|
|
On Order Types of Random Point Sets2020
Pré-publication, Document de travail
hal-01962093v2
|
|
Smoothed complexity of convex hulls by witnesses and collectors[Research Report] 8787, INRIA. 2015, pp.41
Rapport
hal-01214021v2
|
|
The monotonicity of f-vectors of random polytopes[Research Report] RR-8154, INRIA. 2012, pp.10
Rapport
hal-00758686v1
|
|
Complexity analysis of random geometric structures made simpler[Research Report] RR-8168, INRIA. 2012
Rapport
hal-00761171v1
|
|
Helly-type theorems for approximate covering[Research Report] RR-6342, INRIA. 2007, pp.12
Rapport
inria-00179277v3
|
|
On the Number of Maximal Free Line Segments Tangent to Arbitrary Three-dimensional Convex Polyhedra[Research Report] RR-5671, INRIA. 2005
Rapport
inria-00071226v1
|