default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarc Glisse
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j17]Otfried Cheong
, Olivier Devillers, Marc Glisse, Ji-won Park:
Covering families of triangles. Period. Math. Hung. 87(1): 86-109 (2023)- [i14]Marc Glisse:
Fast persistent homology computation for functions on R. CoRR abs/2301.04745 (2023) - 2022
- [c27]Marc Glisse, Siddharth Pritam:
Swap, Shift and Trim to Edge Collapse a Filtration. SoCG 2022: 44:1-44:15 - [c26]Thibault de Surrel, Felix Hensel, Mathieu Carrière, Théo Lacombe, Yuichi Ike, Hiroaki Kurihara, Marc Glisse, Frédéric Chazal:
RipsNet: a general architecture for fast and robust estimation of the persistent homology of point clouds. TAG-ML 2022: 96-106 - [i13]Thibault de Surrel, Felix Hensel, Mathieu Carrière, Théo Lacombe, Yuichi Ike, Hiroaki Kurihara, Marc Glisse, Frédéric Chazal:
RipsNet: a general architecture for fast and robust estimation of the persistent homology of point clouds. CoRR abs/2202.01725 (2022) - [i12]Marc Glisse, Siddharth Pritam:
Swap, Shift and Trim to Edge Collapse a Filtration. CoRR abs/2203.07022 (2022) - 2021
- [j16]Jean-Daniel Boissonnat, Olivier Devillers, Kunal Dutta, Marc Glisse:
Randomized Incremental Construction of Delaunay Triangulations of Nice Point Sets. Discret. Comput. Geom. 66(1): 236-268 (2021) - [c25]Mathieu Carrière, Frédéric Chazal, Marc Glisse, Yuichi Ike, Hariprasad Kannan, Yuhei Umeda:
Optimizing persistent homology based functions. ICML 2021: 1294-1303 - [c24]Théo Lacombe, Yuichi Ike, Mathieu Carrière, Frédéric Chazal, Marc Glisse, Yuhei Umeda:
Topological Uncertainty: Monitoring Trained Neural Networks through Persistence of Activation Graphs. IJCAI 2021: 2666-2672 - [i11]Marc Glisse:
Lower bound on the Voronoi diagram of lines in $\mathbb{R}^d$. CoRR abs/2103.17251 (2021) - [i10]Théo Lacombe, Yuichi Ike, Mathieu Carrière, Frédéric Chazal, Marc Glisse, Yuhei Umeda:
Topological Uncertainty: Monitoring trained neural networks through persistence of activation graphs. CoRR abs/2105.04404 (2021) - 2020
- [j15]Samuel Hornus, Tim Kuipers, Olivier Devillers, Monique Teillaud, Jonàs Martínez, Marc Glisse, Sylvain Lazard, Sylvain Lefebvre:
Variable-width contouring for additive manufacturing. ACM Trans. Graph. 39(4): 131 (2020) - [i9]Mathieu Carrière, Frédéric Chazal, Marc Glisse, Yuichi Ike, Hariprasad Kannan:
A note on stochastic subgradient descent for persistence-based functionals: convergence and practical aspects. CoRR abs/2010.08356 (2020)
2010 – 2019
- 2019
- [c23]Hirokazu Anai, Frédéric Chazal, Marc Glisse, Yuichi Ike, Hiroya Inakoshi, Raphaël Tinarrage, Yuhei Umeda:
DTM-Based Filtrations. SoCG 2019: 58:1-58:15 - [c22]Jean-Daniel Boissonnat, Olivier Devillers, Kunal Dutta, Marc Glisse:
Randomized Incremental Construction of Delaunay Triangulations of Nice Point Sets. ESA 2019: 22:1-22:13 - 2018
- [j14]David Bremner, Olivier Devillers, Marc Glisse, Sylvain Lazard, Giuseppe Liotta, Tamara Mchedlidze, Guillaume Moroz, Sue Whitesides, Stephen K. Wismath:
Monotone Simultaneous Paths Embeddings in ℝd. Discret. Math. Theor. Comput. Sci. 20(1) (2018) - [i8]Hirokazu Anai, Frédéric Chazal, Marc Glisse, Yuichi Ike, Hiroya Inakoshi, Raphaël Tinarrage, Yuhei Umeda:
DTM-based filtrations. CoRR abs/1811.04757 (2018) - [i7]Olivier Devillers, Philippe Duchon, Marc Glisse, Xavier Goaoc:
On Order Types of Random Point Sets. CoRR abs/1812.08525 (2018) - 2016
- [b2]Frédéric Chazal, Vin de Silva, Marc Glisse, Steve Y. Oudot:
The Structure and Stability of Persistence Modules. Springer Briefs in Mathematics, Springer 2016, ISBN 978-3-319-42543-6, pp. I-X, 1-120 - [j13]Marc Glisse, Sylvain Lazard, Julien Michel, Marc Pouget:
Silhouette of a random polytope. J. Comput. Geom. 7(1): 86-99 (2016) - [j12]Dominique Attali, Olivier Devillers, Marc Glisse, Sylvain Lazard:
Recognizing shrinkable complexes is NP-complete. J. Comput. Geom. 7(1): 430-443 (2016) - [j11]Olivier Devillers, Marc Glisse, Xavier Goaoc, Rémy Thomasse:
Smoothed complexity of convex hulls by witnesses and collectors. J. Comput. Geom. 7(2): 101-144 (2016) - [c21]David Bremner, Olivier Devillers, Marc Glisse, Sylvain Lazard, Giuseppe Liotta, Tamara Mchedlidze, Sue Whitesides, Stephen K. Wismath:
Monotone Simultaneous Embeddings of Paths in d Dimensions. GD 2016: 546-553 - [i6]David Bremner, Olivier Devillers, Marc Glisse, Sylvain Lazard, Giuseppe Liotta, Tamara Mchedlidze, Sue Whitesides, Stephen K. Wismath:
Monotone Simultaneous Embeddings of Paths in R^d. CoRR abs/1608.08791 (2016) - 2015
- [j10]Dominique Attali, Ulrich Bauer, Olivier Devillers, Marc Glisse, André Lieutier:
Homological reconstruction and simplification in R3. Comput. Geom. 48(8): 606-621 (2015) - [j9]Frédéric Chazal, Marc Glisse, Catherine Labruère, Bertrand Michel:
Convergence rates for persistence diagram estimation in topological data analysis. J. Mach. Learn. Res. 16: 3603-3635 (2015) - [c20]Olivier Devillers, Marc Glisse, Xavier Goaoc, Rémy Thomasse:
On the Smoothed Complexity of Convex Hulls. SoCG 2015: 224-238 - 2014
- [c19]Dominique Attali, Olivier Devillers, Marc Glisse, Sylvain Lazard:
Recognizing Shrinkable Complexes Is NP-Complete. ESA 2014: 74-86 - [c18]Frédéric Chazal, Marc Glisse, Catherine Labruère, Bertrand Michel:
Convergence rates for persistence diagram estimation in Topological Data Analysis. ICML 2014: 163-171 - [c17]Clément Maria, Jean-Daniel Boissonnat, Marc Glisse, Mariette Yvinec:
The Gudhi Library: Simplicial Complexes and Persistent Homology. ICMS 2014: 167-174 - 2013
- [c16]Dominique Attali, Ulrich Bauer, Olivier Devillers, Marc Glisse, André Lieutier:
Homological reconstruction and simplification in R3. SoCG 2013: 117-126 - [c15]Olivier Devillers, Marc Glisse, Xavier Goaoc:
Complexity analysis of random geometric structures made simpler. SoCG 2013: 167-176 - [i5]Frédéric Chazal, Marc Glisse, Catherine Labruère, Bertrand Michel:
Optimal rates of convergence for persistence diagrams in Topological Data Analysis. CoRR abs/1305.6239 (2013) - 2012
- [j8]Marc Glisse, Sylvain Lazard:
On the Complexity of Sets of Free Lines and Line Segments Among Balls in Three Dimensions. Discret. Comput. Geom. 47(4): 756-772 (2012) - [j7]Mridul Aanjaneya, Frédéric Chazal, Daniel Chen, Marc Glisse, Leonidas J. Guibas, Dmitriy Morozov:
Metric Graph Reconstruction from noisy Data. Int. J. Comput. Geom. Appl. 22(4): 305-326 (2012) - [c14]Fabrizio Frati, Marc Glisse, William J. Lenhart, Giuseppe Liotta, Tamara Mchedlidze, Rahnuma Islam Nishat:
Point-Set Embeddability of 2-Colored Trees. GD 2012: 291-302 - [i4]Frédéric Chazal, Vin de Silva, Marc Glisse, Steve Oudot:
The structure and stability of persistence modules. CoRR abs/1207.3674 (2012) - [i3]Olivier Devillers, Marc Glisse, Xavier Goaoc, Guillaume Moroz, Matthias Reitzner:
The monotonicity of f-vectors of random polytopes. CoRR abs/1211.7020 (2012) - 2011
- [j6]Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na:
Farthest-polygon Voronoi diagrams. Comput. Geom. 44(4): 234-247 (2011) - [c13]Mridul Aanjaneya, Frédéric Chazal, Daniel Chen, Marc Glisse, Leonidas J. Guibas, Dmitriy Morozov:
Metric graph reconstruction from noisy data. SCG 2011: 37-46 - 2010
- [c12]Marc Glisse, Sylvain Lazard:
On the complexity of sets of free lines and line segments among balls in three dimensions. SCG 2010: 48-57 - [i2]Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na:
Farthest-Polygon Voronoi Diagrams. CoRR abs/1001.3593 (2010)
2000 – 2009
- 2009
- [j5]Julien Demouth, Olivier Devillers, Hazel Everett, Marc Glisse, Sylvain Lazard, Raimund Seidel:
On the complexity of umbra and penumbra. Comput. Geom. 42(8): 758-771 (2009) - [j4]Julien Demouth, Olivier Devillers, Marc Glisse, Xavier Goaoc:
Helly-Type Theorems for Approximate Covering. Discret. Comput. Geom. 42(3): 379-398 (2009) - [c11]Frédéric Chazal, David Cohen-Steiner, Marc Glisse, Leonidas J. Guibas, Steve Oudot:
Proximity of persistence modules and their diagrams. SCG 2009: 237-246 - 2008
- [j3]Marc Glisse, Sylvain Lazard:
An Upper Bound on the Average Size of Silhouettes. Discret. Comput. Geom. 40(2): 241-257 (2008) - [c10]Julien Demouth, Olivier Devillers, Marc Glisse, Xavier Goaoc:
Helly-type theorems for approximate covering. SCG 2008: 120-128 - [c9]Olivier Devillers, Marc Glisse, Sylvain Lazard:
Predicates for line transversals to lines and line segments in three-dimensional space. SCG 2008: 174-181 - 2007
- [b1]Marc Glisse:
Combinatoire des droites et segments pour la visibilité 3D. (Combinatorics of lines and segments for 3D visibility). Nancy 2 University, France, 2007 - [j2]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. SIAM J. Comput. 37(2): 522-551 (2007) - [c8]Julien Demouth, Olivier Devillers, Hazel Everett, Marc Glisse, Sylvain Lazard, Raimund Seidel:
Between umbra and penumbra. SCG 2007: 265-274 - [c7]Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na:
Farthest-Polygon Voronoi Diagrams. ESA 2007: 407-418 - [i1]Marc Glisse, Sylvain Lazard:
An Upper Bound on the Average Size of Silhouettes. CoRR abs/cs/0702087 (2007) - 2006
- [j1]Hervé Brönnimann, Marc Glisse:
Octrees with near optimal cost for ray-shooting. Comput. Geom. 34(3): 182-194 (2006) - [c6]Marc Glisse:
An upper bound on the average size of silhouettes. SCG 2006: 105-111 - 2004
- [c5]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. SCG 2004: 46-55 - [c4]Hervé Brönnimann, Marc Glisse:
Cost-Optimal Trees for Ray Shooting. LATIN 2004: 349-358 - 2003
- [c3]Helmut Alt, Marc Glisse, Xavier Goaoc:
On the worst-case complexity of the silhouette of a polytope. CCCG 2003: 51-55 - 2002
- [c2]Hervé Brönnimann, Marc Glisse, David R. Wood:
Cost-optimal quadtrees for ray shooting. CCCG 2002: 109-112 - [c1]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. CCCG 2002: 113-117
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
