The SCEAS System
| |||||||

## Search the dblp DataBase
Francis Lazarus:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Erin W. Chambers, Éric Colin de Verdière, Jeff Erickson, Francis Lazarus, Kim Whittlesey
**Splitting (complicated) surfaces is hard.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2006, pp:421-429 [Conf] - Francis Lazarus, Michel Pocchiola, Gert Vegter, Anne Verroust
**Computing a canonical polygonal schema of an orientable triangulated surface.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2001, pp:80-89 [Conf] - Éric Colin de Verdière, Francis Lazarus
**Optimal System of Loops on an Orientable Surface.**[Citation Graph (0, 0)][DBLP] FOCS, 2002, pp:627-636 [Conf] - Éric Colin de Verdière, Francis Lazarus
**Optimal Pants Decompositions and Shortest Homotopic Cycles on an Orientable Surface.**[Citation Graph (0, 0)][DBLP] Graph Drawing, 2003, pp:478-490 [Conf] - Gabriel Taubin, André Guéziec, William Horn, Francis Lazarus
**Progressive Forest Split Compression.**[Citation Graph (0, 0)][DBLP] SIGGRAPH, 1998, pp:123-132 [Conf] - Francis Lazarus, Anne Verroust
**Level set diagrams of polyhedral objects.**[Citation Graph (0, 0)][DBLP] Symposium on Solid Modeling and Applications, 1999, pp:130-140 [Conf] - Anne Verroust, Francis Lazarus
**Extracting Skeletal Curves from 3D Scattered Data.**[Citation Graph (0, 0)][DBLP] Shape Modeling International, 1999, pp:194-201 [Conf] - André Guéziec, Gabriel Taubin, Francis Lazarus, William Horn
**Converting sets of polygons to manifold surfaces by cutting and stitching.**[Citation Graph (0, 0)][DBLP] IEEE Visualization, 1998, pp:383-390 [Conf] - André Guéziec, Gabriel Taubin, Francis Lazarus, William Horn
**Simplicial Maps for Progressive Transmission of Polygonal Surfaces.**[Citation Graph (0, 0)][DBLP] VRML, 1998, pp:25-31 [Conf] - Francis Lazarus
**Smooth interpolation between two polylines in space.**[Citation Graph (0, 0)][DBLP] Computer-Aided Design, 1997, v:29, n:3, pp:189-196 [Journal] - Francis Lazarus, Sabine Coquillart, Pierre Jancène
**Axial deformations: an intuitive deformation technique.**[Citation Graph (0, 0)][DBLP] Computer-Aided Design, 1994, v:26, n:8, pp:607-613 [Journal] - Éric Colin de Verdière, Francis Lazarus
**Optimal System of Loops on an Orientable Surface.**[Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 2005, v:33, n:3, pp:507-534 [Journal] - Francis Lazarus, Anne Verroust
**Metamorphosis of Cylinder-like Objects.**[Citation Graph (0, 0)][DBLP] Journal of Visualization and Computer Animation, 1997, v:8, n:3, pp:131-146 [Journal] - André Guéziec, Gabriel Taubin, Francis Lazarus, William Horn
**Cutting and Stitching: Converting Sets of Polygons to Manifold Surfaces.**[Citation Graph (0, 0)][DBLP] IEEE Trans. Vis. Comput. Graph., 2001, v:7, n:2, pp:136-151 [Journal] - Francis Lazarus, Anne Verroust
**Three-dimensional metamorphosis: a survey.**[Citation Graph (0, 0)][DBLP] The Visual Computer, 1998, v:14, n:8/9, pp:373-389 [Journal] - Anne Verroust, Francis Lazarus
**Extracting skeletal curves from 3D scattered data.**[Citation Graph (0, 0)][DBLP] The Visual Computer, 2000, v:16, n:1, pp:15-25 [Journal] - Grégoire Aujay, Franck Hétroy, Francis Lazarus, Christine Depraz
**Harmonic skeleton for realistic character animation.**[Citation Graph (0, 0)][DBLP] Symposium on Computer Animation, 2007, pp:151-160 [Conf] - Éric Colin de Verdière, Francis Lazarus
**Optimal pants decompositions and shortest homotopic cycles on an orientable surface.**[Citation Graph (0, 0)][DBLP] J. ACM, 2007, v:54, n:4, pp:- [Journal] **Walking your dog in the woods in polynomial time.**[Citation Graph (, )][DBLP]**Output-sensitive algorithm for the edge-width of an embedded graph.**[Citation Graph (, )][DBLP]**Finding shortest non-trivial cycles in directed graphs on surfaces.**[Citation Graph (, )][DBLP]**A Framework for Streaming Geometry in VRML.**[Citation Graph (, )][DBLP]**Splitting (complicated) surfaces is hard.**[Citation Graph (, )][DBLP]**Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time.**[Citation Graph (, )][DBLP]
Search in 0.005secs, Finished in 0.006secs | |||||||

| |||||||

| |||||||

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