Équipe associée McGill-ISA

Objectifs

Agenda

2 au 6 janvier 2007 : visite de Hazel Everett et Sylvain Lazard à McGill.

26 janvier au 2 février 2007 : 6th McGill - INRIA workshop on Computational Geometry.

 

---

Réalisations

• N. Amenta, D. Attali, O.Devillers. Complexity of Delaunay triangulation for points on lower-dimensional polyhedra, SODA 2007, to appear.


• H. Bronnimann, O. Devillers, V. Dujmovic, H. Everett, M. Glisse, X. Goaoc, S. Lazard, H. -S. Na, S. Whitesides, Lines and free line segments tangent to arbitrary three-dimensional convex polyhedra, SIAM Journal of Computing, to appear.


• M. Glisse, An upper bound on the average size of silhouettes, in Proc. of the 22nd ACM Symposium on Computational Geometry (SoCG), Sedona, Arizona, June 2006.


• H. Alt, E. M. Arkin, H. Bronniman, J. Erickson, S. P. Fekete, C. Knauer, J. Lenchner, J. S. B. Mitchell, K. Whittlesey, Minimum-Cost Coverage of Point Sets by Disks, In Proc of the 22nd ACM Symposium on Computational Geometry (SoCG), Sedona, Arizona, June 2006.


• M. Glisse, H. Bronnimann, Octrees with near optimal cost for ray-shooting, Computational Geometry: Theory and Applications, 34(3):182-194,2006.


• H. Everett, S. Lazard, W. Lenhart, J. Redburn, L.Zhang, Predicates for Line Transversals in 3D, in Proc. 18th Canadian Conference on Computational Geometry (CCCG'06), pp. 43-46, 2006.


• H. Everett, S. Lazard, S. Petitjean, L.Zhang An experimental assessment of the 2D visibility complex, In Proc. 17th Canadian Conference on Computational Geometry (CCCG'05), pp. 298-301, 2005. Research Report 5822, INRIA, Feb 2006, 17 pages. Also to appear in, International Journal of Computational Geometry and Applications.


• O. Devillers, V. Dujmovic, H. Everett, S. Hornus, S. Whitesides, S. Wismath. Maintaining visibility information of planar point sets with a moving viewpoint. In Proc. 17th Canadian Conference on Computational Geometry (CCCG'05), pp. 302-305 2005. INRIA Research Report N^o 5742, 11 pages, 2005. Also to appear in, International Journal of Computational Geometry and Applications


• H. Bronnimann, O. Devillers, V. Dujmovic, H. Everett, M. Glisse, X. Goaoc, S. Lazard, H.-S. Na, S. Whitesides. The number of lines tangent to arbitrary convex polyhedra in 3D In Proc. of the 20th ACM Symposium on Computational Geometry, New York, June 2004. (paper.pdf.)


• Cost-Optimal Trees for Ray Shooting. H. Brönnimann, M. Glisse. In Proc. Latin American Theoretical Informatics Conf. (LATIN'04). Accepted for publication in Computational Geometry: Theory and Applications (CGTA).

 
• C. Borcea, X. Goaoc, S. Lazard, and S. Petitjean. Common Tangents to Spheres in R³. Rapport de Recherche INRIA No 5325, 2004 , 16 pages. Also in Discrete and Computational Geometry, 35(2):287-300,2006.
   
• C. Borcea, X. Goaoc, S. Lazard, and S. Petitjean. On tangents to quadric surfaces. Preprint arXiv:math.AG/0402394, 2004.

 
• X. Goaoc. Structures de visibilité globales : tailles, calculs et dégénérescences. Thèse de l'université Nancy 2, mai 2004.

 
• V. Dujmovic. Track layouts of graphs. PhD Thesis, McGill University, Oct. 2003.

 
• Lines tangent to four triangles in R3, H. Brönnimann, O. Devillers, S. Lazard, and F. Sottile. In Proc. Canadian Conference on Computational Geometry 2004 (Proc CCCG'04); paper.ps.gz. Accepted for publication in Discrete and Computational Geometry (2006).

 
• The number of transversals to line segments in R³, H. Brönnimann, H. Everett, S. Lazard, F. Sottile, and S. Whitesides. In Proc. Canadian Conference on Computational Geometry 2003 (Proc CCCG'03); (paper.ps.gz.) Discrete and Computational Geometry 34:381--390 (2005).

 
• Disjoint Unit Spheres admit at most two Line Transversals, O. Cheong, X. Goaoc, and H.-S. Na. In Proc. of the 11th Annual European Symposium on Algorithms (ESA), 2003. Rapport de Recherche INRIA No 4854, 2002, 11 pages (Research report).

 
• On the worst-case complexity of the silhouette of a polytope, H. Alt, M. Glisse, and X. Goaoc. In Proc. Canadian Conference on Computational Geometry (Proc CCCG'03.) (paper.ps.gz)

 
• An algebraic framework for computing the 3D visibility complex, X. Goaoc, S. Petitjean. Manuscript.

 
• The expected number of 3D visibility events is linear. O. Devillers, V. Dujmovic, H. Everett, X. Goaoc, S. Lazard, H.-S. Na, S. Petitjean. SIAM Journal on Computing, Vol 32:6, June 2003, pp. 1586-1620. Rapport de Recherche INRIA No 4671, 2002, 42 pages. (RR.ps.gz).

 
• On the Number of Lines Tangent to Four Convex Polyhedra. H. Bronnimann, O. Devillers, V. Dujmovic, H. Everett, M. Glisse, X. Goaoc, S. Lazard, H.-S. Na, S. Whitesides. In Proc. Canadian Conference on Computational Geometry 2002 (Proc CCCG'02.). (paper.ps.gz)

 
• Cost-Optimal Quadtrees for Ray Shooting. H. Brönnimann, M. Glisse, D. Wood. In Proc. Canadian Conference on Computational Geometry 2002 (Proc CCCG'02.). (paper)

 

---

Contacts

ISA, INRIA-Lorraine: Hazel Everett
Laboratoire de géométrie algorithmique, université McGill : Sue Whitesides

---