|
||
---|---|---|
hal-00752064v1
Journal articles
Set Systems and Families of Permutations with Small Traces European Journal of Combinatorics, Elsevier, 2013, 34, pp.229-239 |
||
tel-00650204v2
Habilitation à diriger des recherches
Transversal Helly numbers, pinning theorems and projection of simplicial complexes Computational Geometry [cs.CG]. Université Henri Poincaré - Nancy I, 2011 |
||
hal-00620460v1
Conference papers
Set Systems and Families of Permutations with Small Traces (abstract) 8th French Combinatorial Conference, 2010, France |
||
inria-00539957v1
Reports
Bounded-Curvature Shortest Paths through a Sequence of Points [Research Report] RR-7465, INRIA. 2010, pp.53 |
||
inria-00518033v1
Journal articles
Pinning a Line by Balls or Ovaloids in $R^3$ Discrete and Computational Geometry, Springer Verlag, 2011, 45 (2), pp.303-320. ⟨10.1007/s00454-010-9297-5⟩ ![]() |
||
inria-00518028v1
Journal articles
Lines Pinning Lines Discrete and Computational Geometry, Springer Verlag, 2011 |
||
inria-00517899v1
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⟩ |
||
inria-00441376v2
Reports
Set Systems and Families of Permutations with Small Traces [Research Report] RR-7154, INRIA. 2009, pp.14 |
||
inria-00099873v1
Conference papers
On the number of line tangents to four triangles in three-dimensional space 16th Canadian Conference on Computational Geometry - CCCG'04, 2004, Montreal, Canada, 4 p |
||
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-00099289v1
Journal articles
Motion planning of legged robots SIAM Journal on Computing, Society for Industrial and Applied Mathematics, 2000, 30 (1), pp.218-246. ⟨10.1137/S0097539797326289⟩ |
||
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⟩ |
||
inria-00438409v1
Reports
The Effect of Noise on the Number of Extreme Points [Research Report] RR-7134, INRIA. 2009, pp.24 |
||
inria-00431768v1
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 |
||
|
||
inria-00431437v1
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⟩ |
||
inria-00335946v1
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⟩ |
||
inria-00331423v1
Journal articles
Inflating balls is NP-hard International Journal of Computational Geometry and Applications, World Scientific Publishing, 2008 |
||
inria-00181775v1
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⟩ |
||
inria-00189019v1
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 |
||
inria-00431544v1
Conference papers
Computing Direct Shadows Cast by Convex Polyhedra 25th European Workshop on Computational Geometry - EuroCG 2009, Mar 2009, Brussels, Belgium |
||
inria-00431418v1
Journal articles
On the Complexity of Umbra and Penumbra Computational Geometry, Elsevier, 2009, 42 (8), pp.758--771. ⟨10.1016/j.comgeo.2008.04.007⟩ |
||
inria-00431408v1
Journal articles
Untangling a Planar Graph Discrete and Computational Geometry, Springer Verlag, 2009, 42 (4), pp.542-569. ⟨10.1007/s00454-008-9130-6⟩ ![]() |
||
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⟩ |
||
inria-00395837v1
Reports
Lower Bounds for Pinning Lines by Balls [Research Report] RR-6961, INRIA. 2009, pp.12 |
||
inria-00099624v1
Journal articles
Anisotropic Polygonal Remeshing ACM Transactions on Graphics, Association for Computing Machinery, 2003, 22 (3), pp.485-493. ⟨10.1145/1201775.882296⟩ |
||
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-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-00192927v1
Journal articles
Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint International Journal of Computational Geometry and Applications, World Scientific Publishing, 2007, 17 (4), pp.297-304. ⟨10.1142/S0218195907002343⟩ |
||
inria-00100261v1
Journal articles
Common Tangents to Spheres in $R3$ Discrete and Computational Geometry, Springer Verlag, 2006, 35 (2), pp.287-300. ⟨10.1007/s00454-005-1230-y⟩ |
||
inria-00103923v1
Journal articles
Drawing Kn in Three Dimensions with One Bend per Edge Journal of Graph Algorithms and Applications, Brown University, 2006, 10 (2), pp.287-295 |
||
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-00187253v1
Conference papers
Between umbra and penumbra Proceedings of the 23rd Annual Symposium on Computational Geometry, Hee-Kap Ahn, Otfried Cheong, and Kyung-Yong Chwa, Jun 2007, Gyeongju, South Korea. pp.265-274, ⟨10.1145/1247069.1247117⟩ |
||
inria-00186262v2
Reports
On the Complexity of Umbra and Penumbra [Research Report] RR-6347, INRIA. 2007, pp.28 |
||
inria-00179277v3
Reports
Helly-type theorems for approximate covering [Research Report] RR-6342, INRIA. 2007, pp.12 |
||
inria-00179313v2
Reports
Random sampling of a cylinder yields a not so nasty Delaunay triangulation [Research Report] RR-6323, INRIA. 2007, pp.10 |
||
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-00176201v1
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⟩ |
||
inria-00176198v1
Journal articles
Line transversals to disjoint balls Discrete and Computational Geometry, Springer Verlag, 2008, 39 (1-3), pp.158--173. ⟨10.1007/s00454-007-9016-z⟩ |
||
inria-00000206v1
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⟩ |
||
inria-00103857v1
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⟩ |
||
inria-00103856v1
Journal articles
Helly-Type Theorems for Line Transversals to Disjoint Unit Balls Discrete and Computational Geometry, Springer Verlag, 2008, 39 (1-3), pp.194-212 |
||
inria-00000637v1
Journal articles
Geometric Permutations of Disjoint Unit Spheres Computational Geometry, Elsevier, 2005, 30 (3), pp.253-270 |
||
inria-00099478v1
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 |
||
hal-00097239v1
Journal articles
A note on maximally repeated sub-patterns of a point set Discrete Mathematics, Elsevier, 2006, 306 (16), pp.1965-1968. ⟨10.1016/j.disc.2006.03.045⟩ |
||
inria-00077116v1
Reports
Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint [Research Report] RR-5742, INRIA. 2005, pp.11 |
||
inria-00075274v1
Reports
Applications of random sampling to on-line algorithms in computational geometry [Research Report] RR-1285, INRIA. 1990 |
||
inria-00071914v1
Reports
The expected number of 3D visibility events is linear [Research Report] RR-4671, INRIA. 2002 |
||
|
||
|