Marc Glisse
9
Documents
Publications
- 9
- 9
- 7
- 5
- 4
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 4
- 1
- 1
- 1
|
Farthest-Polygon Voronoi DiagramsComputational Geometry, 2011, Computational Geometry, Theory and Applications, 44 (4), pp.14. ⟨10.1016/j.comgeo.2010.11.004⟩
Article dans une revue
inria-00442816v3
|
|
On the Complexity of Umbra and PenumbraComputational Geometry, 2009, 42 (8), pp.758--771. ⟨10.1016/j.comgeo.2008.04.007⟩
Article dans une revue
inria-00431418v1
|
|
Lines and free line segments Tangent to Arbitrary Three-dimensional Convex PolyhedraSIAM Journal on Computing, 2007, 37 (2), pp.522-551. ⟨10.1137/S0097539705447116⟩
Article dans une revue
inria-00103916v1
|
|
Between umbra and penumbraProceedings 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⟩
Communication dans un congrès
inria-00187253v1
|
|
Farthest-Polygon Voronoi Diagrams15th Annual European Symposium on Algorithms - ALGO 2007, Oct 2007, Eilat, Israel. pp.407-418, ⟨10.1007/978-3-540-75520-3_37⟩
Communication dans un congrès
inria-00189038v1
|
|
The Number of Lines Tangent to Arbitrary Convex Polyhedra in 3DProceedings of the 20th Annual Symposium on Computational Geometry, Jun 2004, Brooklyn, NY, United States. pp.46 - 55, ⟨10.1145/997817.997827⟩
Communication dans un congrès
inria-00103995v1
|
|
On the Number of Lines Tangent to Four Convex Polyhedra14th Canadian Conference on Computational Geometry - CCCG'02, 2002, Lethbridge, Canada
Communication dans un congrès
inria-00099449v1
|
|
On the Complexity of Umbra and Penumbra[Research Report] RR-6347, INRIA. 2007, pp.28
Rapport
inria-00186262v2
|
|
On the Number of Maximal Free Line Segments Tangent to Arbitrary Three-dimensional Convex Polyhedra[Research Report] RR-5671, INRIA. 2005
Rapport
inria-00071226v1
|