Marc Glisse
13
Documents
Publications
- 13
- 13
- 7
- 5
- 4
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 1
- 1
- 1
- 3
- 1
- 1
- 1
|
Variable-width contouring for additive manufacturingACM Transactions on Graphics, 2020, 39 (4 (Proc. SIGGRAPH)), ⟨10.1145/3386569.3392448⟩
Article dans une revue
hal-02568677v2
|
|
Monotone Simultaneous Paths Embeddings in $\mathbb{R}^d$Discrete Mathematics and Theoretical Computer Science, 2018, Vol. 20 no. 1 (1), pp.1-11. ⟨10.23638/DMTCS-20-1-1⟩
Article dans une revue
hal-01529154v2
|
|
Recognizing Shrinkable Complexes Is NP-CompleteJournal of Computational Geometry, 2016, 7 (1), pp.430--443. ⟨10.20382/jocg.v7i1a18⟩
Article dans une revue
hal-01384396v2
|
|
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
|
|
Monotone Simultaneous Paths Embeddings in $\mathbb{R}^d$24th International Symposium on Graph Drawing & Network Visualization, Sep 2016, Athens, Greece. ⟨10.1007/978-3-319-50106-2_42⟩
Communication dans un congrès
hal-01366148v1
|
|
Recognizing shrinkable complexes is NP-completeESA 2014 - 22nd Annual European Symposium on Algorithms, Sep 2014, Wroclaw, Poland. pp.74-86, ⟨10.1007/978-3-662-44777-2_7⟩
Communication dans un congrès
hal-01015747v1
|
|
Predicates for line transversals to lines and line segments in three-dimensional spaceSoCG 2008 - 24th Annual Symposium on Computational Geometry, Jun 2008, College Park, Maryland, United States. pp.174-181, ⟨10.1145/1377676.1377704⟩
Communication dans un congrès
inria-00336256v1
|
|
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
|
|
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
|