The SCEAS System
| |||||||

## Search the dblp DataBase
Marc Glisse:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Helmut Alt, Marc Glisse, Xavier Goaoc
**On the worst-case complexity of the silhouette of a polytope.**[Citation Graph (0, 0)][DBLP] CCCG, 2003, pp:51-55 [Conf] - Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides
**On the number of lines tangent to four convex polyhedra.**[Citation Graph (0, 0)][DBLP] CCCG, 2002, pp:113-117 [Conf] - Hervé Brönnimann, Marc Glisse, David R. Wood
**Cost-optimal quadtrees for ray shooting.**[Citation Graph (0, 0)][DBLP] CCCG, 2002, pp:109-112 [Conf] - Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides
**The number of lines tangent to arbitrary convex polyhedra in 3D.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2004, pp:46-55 [Conf] - Marc Glisse
**An upper bound on the average size of silhouettes.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2006, pp:105-111 [Conf] - Julien Demouth, Olivier Devillers, Hazel Everett, Marc Glisse, Sylvain Lazard, Raimund Seidel
**Between umbra and penumbra.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2007, pp:265-274 [Conf] - Hervé Brönnimann, Marc Glisse
**Cost-Optimal Trees for Ray Shooting.**[Citation Graph (0, 0)][DBLP] LATIN, 2004, pp:349-358 [Conf] - Hervé Brönnimann, Marc Glisse
**Octrees with near optimal cost for ray-shooting.**[Citation Graph (0, 0)][DBLP] Comput. Geom., 2006, v:34, n:3, pp:182-194 [Journal] - Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na
**Farthest-Polygon Voronoi Diagrams.**[Citation Graph (0, 0)][DBLP] ESA, 2007, pp:407-418 [Conf] - Marc Glisse, Sylvain Lazard
**An Upper Bound on the Average Size of Silhouettes**[Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal] - Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides
**Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2007, v:37, n:2, pp:522-551 [Journal] **Helly-type theorems for approximate covering.**[Citation Graph (, )][DBLP]**Predicates for line transversals to lines and line segments in three-dimensional space.**[Citation Graph (, )][DBLP]**Proximity of persistence modules and their diagrams.**[Citation Graph (, )][DBLP]**On the complexity of sets of free lines and line segments among balls in three dimensions.**[Citation Graph (, )][DBLP]**On the complexity of umbra and penumbra.**[Citation Graph (, )][DBLP]**Farthest-Polygon Voronoi Diagrams**[Citation Graph (, )][DBLP]**An Upper Bound on the Average Size of Silhouettes.**[Citation Graph (, )][DBLP]**Helly-Type Theorems for Approximate Covering.**[Citation Graph (, )][DBLP]
Search in 0.227secs, Finished in 0.228secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |