|
||
---|---|---|
inria-00099529v1
Journal articles
Properties of Arrangements Graphs International Journal of Computational Geometry and Applications, World Scientific Publishing, 2003, 13 (6), pp.447-462 |
||
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-00000384v1
Journal articles
Transversals to line segments in three-dimensional space Discrete and Computational Geometry, Springer Verlag, 2005, 34 (3), pp.381 - 390. ⟨10.1007/s00454-005-1183-1⟩ |
||
inria-00100017v1
Journal articles
Hierarchical decompositions and circular ray shooting in simple polygons Discrete and Computational Geometry, Springer Verlag, 2004, 32 (3), pp.401-415. ⟨10.1007/s00454-004-1098-2⟩ ![]() |
||
inria-00442816v3
Journal articles
Farthest-Polygon Voronoi Diagrams Computational Geometry, Elsevier, 2011, Computational Geometry, Theory and Applications, 44 (4), pp.14. ⟨10.1016/j.comgeo.2010.11.004⟩ |
||
inria-00434090v1
Journal articles
Parabola separation queries and their application to stone throwing International Journal of Computational Geometry and Applications, World Scientific Publishing, 2007, 17 (4), pp.349-360. ⟨10.1142/S0218195907002379⟩ |
||
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-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-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-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-00431518v1
Journal articles
The Voronoi diagram of three lines Discrete and Computational Geometry, Springer Verlag, 2009, 42 (1), pp.94-130. ⟨10.1007/s00454-009-9173-3⟩ |
||
inria-00099259v1
Journal articles
Planar segment visibility graphs Computational Geometry, Elsevier, 2000, 16 (4), pp.235-243 |
||
inria-00431769v1
Journal articles
Universal Sets of n Points for One-bend Drawings of Planar Graphs with n Vertices Discrete and Computational Geometry, Springer Verlag, 2010, 43 (2), pp.272-288. ⟨10.1007/s00454-009-9149-3⟩ |
||
inria-00431441v1
Journal articles
On the Degree of Standard Geometric Predicates for Line Transversals in 3D Computational Geometry, Elsevier, 2009, 42 (5), pp.484-494. ⟨10.1016/j.comgeo.2007.11.002⟩ |
||
inria-00103926v1
Journal articles
On the Expected Size of the 2D Visibility Complex International Journal of Computational Geometry and Applications, World Scientific Publishing, 2007, 17 (4), pp.361-381. ⟨10.1142/S0218195907002380⟩ |
||
inria-00098848v1
Journal articles
Stabbing information of a simple polygon Discrete Applied Mathematics, Elsevier, 1999, 91 (1-3), pp.67-92 |
||
|