 |
 |
 |
|
|
||
|---|---|---|
| hal-02185566v1
Conference papers
Randomized incremental construction of Delaunay triangulations of nice point sets ESA 2019 - 27th Annual European Symposium on Algorithms, Sep 2019, Munich, Germany. ⟨10.4230/LIPIcs.ESA.2019.22⟩ |
||
| hal-02186693v1
Conference papers
Hardness results on Voronoi, Laguerre and Apollonius diagrams CCCG 2019 - Canadian Conference on Computational Geometry, Aug 2019, Edmonton, Canada |
||
| hal-02394144v1
Conference papers
A Poisson sample of a smooth surface is a good sample EuroCG 2019 - 35th European Workshop on Computational Geometry, Mar 2019, Utrecht, Netherlands |
||
| hal-02338733v2
Reports
Expected Complexity of Routing in $\Theta_6$ and Half-$\Theta_6$ Graphs [Research Report] INRIA. 2019, pp.18 |
||
| hal-01950119v2
Reports
Randomized incremental construction of Delaunay triangulations of nice point sets [Research Report] INRIA. 2019 |
||
| 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-00336256v1
Conference papers
Predicates for line transversals to lines and line segments in three-dimensional space SoCG 2008 - 24th Annual Symposium on Computational Geometry, Jun 2008, College Park, Maryland, United States. pp.174-181, ⟨10.1145/1377676.1377704⟩ |
||
| 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 |
||
|
|
||
