 |
 |
 |
|
|
||
|---|---|---|
| inria-00438409v1
Reports
The Effect of Noise on the Number of Extreme Points [Research Report] RR-7134, INRIA. 2009, pp.24 |
||
| inria-00103916v1
Journal articles
Lines and free line segments Tangent to Arbitrary Three-dimensional Convex Polyhedra SIAM Journal on Computing, Society for Industrial and Applied Mathematics, 2007, 37 (2), pp.522-551. ⟨10.1137/S0097539705447116⟩ |
||
| inria-00103995v1
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⟩ |
||
| inria-00099449v1
Conference papers
On the Number of Lines Tangent to Four Convex Polyhedra 14th Canadian Conference on Computational Geometry - CCCG'02, 2002, Lethbridge, Canada |
||
| inria-00071226v1
Reports
On the Number of Maximal Free Line Segments Tangent to Arbitrary Three-dimensional Convex Polyhedra [Research Report] RR-5671, INRIA. 2005 |
||
| inria-00179277v3
Reports
Helly-type theorems for approximate covering [Research Report] RR-6342, INRIA. 2007, pp.12 |
||
| inria-00331435v1
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 |
||
| inria-00404171v1
Journal articles
Helly-type theorems for approximate covering Discrete and Computational Geometry, Springer Verlag, 2009, 42 (3), pp.379--398. ⟨10.1007/s00454-009-9167-1⟩ |
||
| hal-01214021v2
Reports
Smoothed complexity of convex hulls by witnesses and collectors [Research Report] 8787, INRIA. 2015, pp.41 |
||
| hal-01285120v1
Journal articles
Smoothed complexity of convex hulls by witnesses and collectors Journal of Computational Geometry, Carleton University, Computational Geometry Laboratory, 2016, 7 (2), pp.101-144. ⟨10.20382/jocg.v7i2a6⟩ |
||
| hal-01144473v2
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⟩ |
||
| inria-00071914v1
Reports
The expected number of 3D visibility events is linear [Research Report] RR-4671, INRIA. 2002 |
||
| |
||
| inria-00176204v1
Conference papers
Empty-ellipse graphs 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'08), 2008, San Francisco, United States. pp.1249--1256 |
||
| inria-00179313v2
Reports
Random sampling of a cylinder yields a not so nasty Delaunay triangulation [Research Report] RR-6323, INRIA. 2007, pp.10 |
||
| hal-00805690v1
Journal articles
The monotonicity of $f$-vectors of random polytopes Electronic Communications in Probability, Institute of Mathematical Statistics (IMS), 2013, 18 (23), pp.1-8. ⟨10.1214/ECP.v18-2469⟩ |
||
| hal-00761171v1
Reports
Complexity analysis of random geometric structures made simpler [Research Report] RR-8168, INRIA. 2012 |
||
| hal-00833774v1
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⟩ |
||
| inria-00099810v1
Journal articles
The expected number of 3D visibility events is linear SIAM Journal on Computing, Society for Industrial and Applied Mathematics, 2003, 32 (6), pp.1586-1620. ⟨10.1137/S0097539702419662⟩ |
||
| hal-00758686v1
Reports
The monotonicity of f-vectors of random polytopes [Research Report] RR-8154, INRIA. 2012, pp.10 |
||
| hal-01172466v1
Conference papers
Limits of order types Symposium on Computational Geometry 2015, Jun 2015, Eindhoven, Netherlands. pp.876, ⟨10.4230/LIPIcs.SOCG.2015.300⟩ |
||
|
|
||
