Marc Glisse

According to our database1, Marc Glisse authored at least 37 papers between 2002 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Randomized Incremental Construction of Delaunay Triangulations of Nice Point Sets.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

DTM-Based Filtrations.
Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018
Monotone Simultaneous Paths Embeddings in ℝd.
Discret. Math. Theor. Comput. Sci., 2018

On Order Types of Random Point Sets.
CoRR, 2018

2016
Silhouette of a random polytope.
JoCG, 2016

Smoothed complexity of convex hulls by witnesses and collectors.
JoCG, 2016

Recognizing shrinkable complexes is NP-complete.
JoCG, 2016

Monotone Simultaneous Embeddings of Paths in R^d.
CoRR, 2016

Monotone Simultaneous Embeddings of Paths in d Dimensions.
Proceedings of the Graph Drawing and Network Visualization, 2016

The Structure and Stability of Persistence Modules.
Springer Briefs in Mathematics, Springer, ISBN: 978-3-319-42543-6, 2016

2015
Convergence rates for persistence diagram estimation in topological data analysis.
J. Mach. Learn. Res., 2015

Homological reconstruction and simplification in R3.
Comput. Geom., 2015

On the Smoothed Complexity of Convex Hulls.
Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014
The Gudhi Library: Simplicial Complexes and Persistent Homology.
Proceedings of the Mathematical Software - ICMS 2014, 2014

2013
Optimal rates of convergence for persistence diagrams in Topological Data Analysis
CoRR, 2013

Complexity analysis of random geometric structures made simpler.
Proceedings of the Symposuim on Computational Geometry 2013, 2013

2012
Metric Graph Reconstruction from noisy Data.
Int. J. Comput. Geom. Appl., 2012

On the Complexity of Sets of Free Lines and Line Segments Among Balls in Three Dimensions.
Discret. Comput. Geom., 2012

The monotonicity of f-vectors of random polytopes
CoRR, 2012

The structure and stability of persistence modules
CoRR, 2012

Point-Set Embeddability of 2-Colored Trees.
Proceedings of the Graph Drawing - 20th International Symposium, 2012

2011
Farthest-polygon Voronoi diagrams.
Comput. Geom., 2011

2009
Helly-Type Theorems for Approximate Covering.
Discret. Comput. Geom., 2009

On the complexity of umbra and penumbra.
Comput. Geom., 2009

Proximity of persistence modules and their diagrams.
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

2008
An Upper Bound on the Average Size of Silhouettes.
Discret. Comput. Geom., 2008

Predicates for line transversals to lines and line segments in three-dimensional space.
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

2007
Combinatoire des droites et segments pour la visibilité 3D. (Combinatorics of lines and segments for 3D visibility).
PhD thesis, 2007

Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra.
SIAM J. Comput., 2007

Between umbra and penumbra.
Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, 2007

2006
Octrees with near optimal cost for ray-shooting.
Comput. Geom., 2006

An upper bound on the average size of silhouettes.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

2004
Cost-Optimal Trees for Ray Shooting.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

The number of lines tangent to arbitrary convex polyhedra in 3D.
Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

2003
On the worst-case complexity of the silhouette of a polytope.
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002
Cost-optimal quadtrees for ray shooting.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

On the number of lines tangent to four convex polyhedra.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002


  Loading...