default search action
Francis Lazarus
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j21]Francis Lazarus, Florent Tallerie:
A Universal Triangulation for Flat Tori. Discret. Comput. Geom. 71(1): 278-307 (2024) - [j20]Camille Lanuel, Francis Lazarus, Rudi Pendavingh:
A Linear Bound for the Colin de Verdière Parameter \(\boldsymbol{\mu }\) for Graphs Embedded on Surfaces. SIAM J. Discret. Math. 38(3): 2289-2296 (2024) - [i8]Matthijs Ebbens, Francis Lazarus:
Computing the second and third systoles of a combinatorial surface. CoRR abs/2407.13479 (2024) - 2023
- [j19]Erin Wolf Chambers, Francis Lazarus, Arnaud de Mesmay, Salman Parsa:
Algorithms for Contractibility of Compressed Curves on 3-Manifold Boundaries. Discret. Comput. Geom. 70(2): 323-354 (2023) - [c20]Vincent Delecroix, Matthijs Ebbens, Francis Lazarus, Ivan Yakovlev:
Algorithms for Length Spectra of Combinatorial Tori. SoCG 2023: 26:1-26:16 - [i7]Camille Lanuel, Francis Lazarus, Rudi Pendavingh:
A linear bound for the Colin de Verdiére parameter μ for graphs embedded on surfaces. CoRR abs/2303.00556 (2023) - [i6]Vincent Delecroix, Matthijs Ebbens, Francis Lazarus, Ivan Yakovlev:
Algorithms for Length Spectra of Combinatorial Tori. CoRR abs/2303.08036 (2023) - 2022
- [c19]Francis Lazarus, Florent Tallerie:
A Universal Triangulation for Flat Tori. SoCG 2022: 53:1-53:18 - [i5]Francis Lazarus, Florent Tallerie:
A Universal Triangulation for Flat Tori. CoRR abs/2203.05496 (2022) - 2021
- [c18]Erin Wolf Chambers
, Francis Lazarus, Arnaud de Mesmay, Salman Parsa:
Algorithms for Contractibility of Compressed Curves on 3-Manifold Boundaries. SoCG 2021: 23:1-23:16 - 2020
- [i4]Erin Wolf Chambers, Francis Lazarus, Arnaud de Mesmay, Salman Parsa:
Algorithms for Contractibility of Compressed Curves on 3-Manifold Boundaries. CoRR abs/2012.02352 (2020)
2010 – 2019
- 2019
- [j18]Vincent Despré, Francis Lazarus:
Computing the Geometric Intersection Number of Curves. J. ACM 66(6): 45:1-45:49 (2019) - 2018
- [j17]Evangelis Bartzos
An Explicit Isometric Reduction of the Unit Sphere into an Arbitrarily Small Ball. Found. Comput. Math. 18(4): 1015-1042 (2018) - 2017
- [c17]Vincent Despré, Francis Lazarus:
Computing the Geometric Intersection Number of Curves. SoCG 2017: 35:1-35:15 - 2016
- [j16]Vincent Despré, Francis Lazarus:
Some Triangulated Surfaces without Balanced Splitting. Graphs Comb. 32(6): 2339-2353 (2016) - [j15]Sergio Cabello, Éric Colin de Verdière, Francis Lazarus:
Finding shortest non-trivial cycles in directed graphs on surfaces. J. Comput. Geom. 7(1): 123-148 (2016) - 2015
- [i3]Vincent Despré, Francis Lazarus:
Some Triangulated Surfaces without Balanced Splitting. CoRR abs/1509.00269 (2015) - [i2]Vincent Despré, Francis Lazarus:
Computing the Geometric Intersection Number of Curves. CoRR abs/1511.09327 (2015) - 2012
- [j14]Sergio Cabello
Algorithms for the edge-width of an embedded graph. Comput. Geom. 45(5-6): 215-224 (2012) - [c16]Francis Lazarus, Julien Rivaud:
On the Homotopy Test on Surfaces. FOCS 2012: 440-449 - 2011
- [j13]Sergio Cabello
Finding Cycles with Topological Properties in Embedded Graphs. SIAM J. Discret. Math. 25(4): 1600-1614 (2011) - [i1]Francis Lazarus, Julien Rivaud:
On the homotopy test on surfaces. CoRR abs/1110.4573 (2011) - 2010
- [j12]Erin W. Chambers
Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time. Comput. Geom. 43(3): 295-311 (2010) - [c15]Sergio Cabello
Output-sensitive algorithm for the edge-width of an embedded graph. SCG 2010: 147-155 - [c14]Sergio Cabello
Finding shortest non-trivial cycles in directed graphs on surfaces. SCG 2010: 156-165
2000 – 2009
- 2008
- [j11]Erin W. Chambers
Splitting (complicated) surfaces is hard. Comput. Geom. 41(1-2): 94-110 (2008) - [c13]Erin W. Chambers
Walking your dog in the woods in polynomial time. SCG 2008: 101-109 - 2007
- [j10]Éric Colin de Verdière, Francis Lazarus:
Optimal pants decompositions and shortest homotopic cycles on an orientable surface. J. ACM 54(4): 18 (2007) - [c12]Grégoire Aujay, Franck Hétroy
Harmonic skeleton for realistic character animation. Symposium on Computer Animation 2007: 151-160 - 2006
- [c11]Erin W. Chambers
Splitting (complicated) surfaces is hard. SCG 2006: 421-429 - 2005
- [j9]Éric Colin de Verdière, Francis Lazarus:
Optimal System of Loops on an Orientable Surface. Discret. Comput. Geom. 33(3): 507-534 (2005) - 2003
- [c10]Éric Colin de Verdière, Francis Lazarus:
Optimal Pants Decompositions and Shortest Homotopic Cycles on an Orientable Surface. GD 2003: 478-490 - 2002
- [c9]Éric Colin de Verdière, Francis Lazarus:
Optimal System of Loops on an Orientable Surface. FOCS 2002: 627-636 - 2001
- [j8]André Guéziec, Gabriel Taubin
Cutting and Stitching: Converting Sets of Polygons to Manifold Surfaces. IEEE Trans. Vis. Comput. Graph. 7(2): 136-151 (2001) - [c8]Francis Lazarus, Michel Pocchiola, Gert Vegter, Anne Verroust
Computing a canonical polygonal schema of an orientable triangulated surface. SCG 2001: 80-89 - 2000
- [j7]Anne Verroust
Extracting skeletal curves from 3D scattered data. Vis. Comput. 16(1): 15-25 (2000)
1990 – 1999
- 1999
- [j6]André Guéziec, Gabriel Taubin
A Framework for Streaming Geometry in VRML. IEEE Computer Graphics and Applications 19(2): 68-78 (1999) - [c7]Francis Lazarus, Anne Verroust
Level set diagrams of polyhedral objects. Symposium on Solid Modeling and Applications 1999: 130-140 - [c6]Anne Verroust, Francis Lazarus:
Extracting Skeletal Curves from 3D Scattered Data. Shape Modeling International 1999: 194-201 - 1998
- [j5]Gabriel Taubin
Geometry coding and VRML. Proc. IEEE 86(6): 1228-1243 (1998) - [j4]Francis Lazarus, Anne Verroust
Three-dimensional metamorphosis: a survey. Vis. Comput. 14(8/9): 373-389 (1998) - [c5]Gabriel Taubin
Progressive Forest Split Compression. SIGGRAPH 1998: 123-132 - [c4]André Guéziec, Gabriel Taubin, Francis Lazarus, William Horn:
Converting sets of polygons to manifold surfaces by cutting and stitching. SIGGRAPH Abstracts and Applications 1998: 245 - [c3]André Guéziec, Gabriel Taubin
Converting sets of polygons to manifold surfaces by cutting and stitching. IEEE Visualization 1998: 383-390 - [c2]André Guéziec, Gabriel Taubin, Francis Lazarus, William Horn:
Simplicial Maps for Progressive Transmission of Polygonal Surfaces. VRML 1998: 25-31 - 1997
- [j3]Francis Lazarus:
Smooth interpolation between two polylines in space. Comput. Aided Des. 29(3): 189-196 (1997) - [j2]Francis Lazarus, Anne Verroust:
Metamorphosis of Cylinder-like Objects. Comput. Animat. Virtual Worlds 8(3): 131-146 (1997) - 1995
- [b1]Francis Lazarus:
Courbes, cylindres et métamorphoses pour l'image de synthèse. (Curves, cylinders and metamorphoses for computer graphics). Paris Diderot University, France, 1995 - 1994
- [j1]Francis Lazarus, Sabine Coquillart, Pierre Jancène:
Axial deformations: an intuitive deformation technique. Comput. Aided Des. 26(8): 607-613 (1994) - 1993
- [c1]Francis Lazarus, Sabine Coquillart, Pierre Jancène:
Interactive Axial Deformations. Modeling in Computer Graphics 1993: 241-254
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-09-21 02:42 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: