15 résultats  enregistrer la recherche


...
inria-00098832v1  Communication dans un congrès
Therese C. BiedlErik D. DemaineSylvain LazardSteven M. RobbinsMichael A. SossConvexifying Monotone Polygons
Alok Aggarwal and C. Pandu Rangan. 10th Annual International Symposium on Algorithms & Computation - ISAAC'99, Dec 1999, Chennai, India. Springer-Verlag, LNCS 1741, 10 p, 1999, Lecture Notes in Computer Science; Algorithms and Computation 10th International Symposium, ISAAC'99 Chennai, India, December 16–18, 1999 Proceedings. <http://www.springerlink.com/content/550xbyrwva7rew49/fulltext.pdf>. <10.1007/3-540-46632-0_42>
...
inria-00099479v1  Communication dans un congrès
Hervé BronnimannHazel EverettSylvain LazardFrank SottileSue WhitesidesTransversals to Line Segments in R3
15th Canadian Conference on Computational Geometry - CCCG'2003, 2003, Halifax, Canada, 4 p, 2003
...
inria-00099466v1  Communication dans un congrès
Nachum DershowitzClaude KirchnerAbstract Saturation-based Inference
Eighteenth Annual IEEE Symposium on Logic in Computer Science - LICS'2003), Jun 2003, Ottawa, Canada, 10 p, 2003
...
inria-00099449v1  Communication dans un congrès
Hervé BrönnimannOlivier DevillersVida DujmovicHazel EverettMarc Glisse et al.  On the Number of Lines Tangent to Four Convex Polyhedra
14th Canadian Conference on Computational Geometry - CCCG'02, 2002, Lethbridge, Canada, 2002
inria-00100889v1  Article dans une revue
Thérèse BiedlErik DemaineMartin DemaineSylvain LazardAnna Lubiw et al.  A Note on Reconfiguring Tree Linkages: Trees can Lock
Discrete Applied Mathematics, Elsevier, 2002, 117 (1-3), pp.293-297. <10.1016/S0166-218X(01)00229-3>
...
inria-00099810v1  Article dans une revue
Olivier DevillersVida DujmovicHazel EverettXavier GoaocSylvain Lazard et al.  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>