Publications

Luca Castelli Aleardi, Éric Fusy, Jyh-Chwen Ko and Razvan S. Puscasu. Computation of toroidal Schnyder woods made simple and fast: from theory to practice. to appear in the Proc. of the 41th Int. Symposium on Computational Geometry (SoCG 2025).

Luca Castelli Aleardi and Olivier Devillers. SCARST: Schnyder Compact And Regularity Sensitive Triangulation Data Structure. Proc. of the 40th Int. Symposium on Computational Geometry (SoCG 2024), LIPIcs, volume 293, 32:1--32:19, 2024. [pdf on Hal] [www]

Luca Castelli Aleardi. Balanced Schnyder woods for planar triangulations: an experimental study with applications to graph drawing and graph separators. Proc. of the 27th Int. Symposium on Graph Drawing and Network Visualization (GD 2019), Springer LNCS, vol. 11904, p. 114-121, 2019. [arxiv] [WWW]

Luca Castelli Aleardi, Semih Salihoglu, Gurprit Singh and Maks Ovsjanikov. Spectral Measures of Distortion for Change Detection in Dynamic Graphs. Proc. of the 7th Int. Conference on Complex Networks and Their Applications (Complex Networks 2018) , Springer SCI, vol. 813, p. 54-66, 2018. [www]

Luca Castelli Aleardi, Gaspard Denis and Éric Fusy. Fast spherical drawing of planar triangulations: an experimental study of graph drawing tools. In Proc. of 17th Int. Symposium on Experimental Algorithms (SEA2018) , LIPIcs, volume 103, 24:1-24:14, 2018. [www]

Luca Castelli Aleardi, Maks Ovsjanikov and Alexandre Nolin. Efficient and practical tree preconditioning for solving Laplacian systems. In Proc. of 14th Int. Symposium on Experimental Algorithms (SEA 2015), Springer LNCS, vol. 9125, p. 219-231, 2015. [www]

Luca Castelli Aleardi, Éric Fusy and Anatolii Kostrygin. Periodic planar straight-frame drawings with polynomial resolution. In Proc. of 11th Latin American Theoretical INformatics Symposium (LATIN 2014), Springer LNCS, vol. 8392, p. 168-179, 2014.

Luca Castelli Aleardi, Olivier Devillers, and Éric Fusy. Canonical ordering for triangulations on the cylinder, with applications to periodic straight-line drawings. In Proc. of the 20th Int. Symposium on Graph Drawing (GD 2012), Springer LNCS, vol. 7704, p. 376-387, 2012. [WWW]

Luca Castelli Aleardi, Olivier Devillers, and Jarek Rossignac. ESQ: Editable SQuad representation for triangle meshes. XXV SIBGRAPI - Conference on Graphics, Patterns and Images (Sibgrapi 2012), IEEE Computer Society, p. 110-117, 2012. [WWW]

Luca Castelli Aleardi and Olivier Devillers. Explicit array-based compact data structures for triangulations. in Proc. of the 22th Int. Symposium on Algorithms and Computation (ISAAC 2011), Springer LNCS, vol. 7074, p. 312-323. [WWW]

Luca Castelli Aleardi, Éric Fusy and Thomas Lewiner. Optimal encoding of triangular and quadrangular meshes with fixed topology, in Proc. of the 22nd Canadian Conference on Computational Geometry (CCCG 2010), p. 95-98. (WWW)

Luca Castelli Aleardi, Éric Fusy and Thomas Lewiner. Schnyder woods for higher genus triangulated surfaces, in Proc. of the 24th ACM Symposium on Computational Geometry (SoCG 2008), p. 311-319. (pdf)

Jeremy Barbay, Luca Castelli Aleardi, Meng He and J. Ian Munro. Succinct Representation of Labeled Graphs. In Proc. of the 18th Int. Symposium on Algorithms and Computation (ISAAC 2007), Springer LNCS, vol. 4835, p. 316-328. (pdf)

Luca Castelli Aleardi, Olivier Devillers and Gilles Schaeffer. Optimal succinct representations of planar maps, in Proc. of the 22nd ACM Symposium on Computational Geometry (SoCG 2006), 309-318. [WWW] (abstract)

Luca Castelli Aleardi, Olivier Devillers and Abdelkrim Mebarki. 2D triangulation representation using stable catalogs, in Proc. of the 18th Canadian Conference on Computational Geometry (CCCG 2006), 71-74. [WWW] (pdf)

Luca Castelli Aleardi, Olivier Devillers and Gilles Schaeffer. Succinct representation of triangulations with a boundary, in Proc. of the 9th Workshop on Algorithms and Data Structures (WADS 2005), Springer LNCS, vol. 3608, p. 134-145. [WWW] (abstract

Luca Castelli Aleardi, Olivier Devillers and Gilles Schaeffer. Dynamic updates of succinct triangulations, in Proc. of the 17th Canadian Conference on Computational Geometry (CCCG 2005), p. 135-138. [WWW] (abstract)