Luca Castelli Aleardi LIX, Alan Turing building 91120 Palaiseau, France Curriculum Vitae Tél.: 06 63 66 01 54 E-mail: amturing@lix.polytechnique.fr Web site: http://www.lix.polytechnique.fr/~amturing/ Italian citizen, one daughter (7 years old) Academic positions since 2008 : Maître de Conférences (tenured assistant professor) at the Computer Science Department (LIX), Ecole Polytechnique, Combinatorial models team. 2007 2008 : post-doc researcher at the CS Department, Université Libre de Bruxelles (ULB, Belgium), Algorithms research group. 2006 2007 : full time Assistant Lecturer ("ATER"), at CS Departement, University of "Marne-la-Vallée" (France). Education 2003 2006 : PhD in Computer Science, CS Departement ("Laboratoire d Informatique" LIX), École Polytechnique (France). Supervisors: Olivier Devillers (Inria Sophia-Antipolis) and Gilles Schaeffer (CNRS, LIX). Thesis subject: Compact representations of geometric data structures. 2002 2003 : DEA "Algorithmique" (master degree in Theoretical Computer Science), University "Pierre et Marie Curie" (Paris VI), "mention Bien". 1995 2002 : "Laurea in Matematica" (Master degree in Mathematics), Univ. of Milan (Italy), 110/110 cum laude. Advisor: Prof. Daniele Mundici. Internships Spring 2003 : 6 months DEA internship at the Inria Geometrica project (formerly Prisme), Inria Sophia-Antipolis, advisor Olivier Devillers. Title: "Optimal compression of maximal planar graphs and extension to the 3- connected case". 1999 : 6 months Erasmus internship, at the Depart. fo Mathematics of the University of "Versailles St-Quentin" (France).
Research grants 2012 2015 : involved in the french ANR project "Egos" (Embedded Graphs and their Oriented Structures), scientific collaboration with LIRMM (Montpellier) and Labri (Bordeaux). Teaching at Polytechnique (since september 2008) since 2010 instructor of the course Computational Geometry: from theory to applications (INF562) (graduate course, master program in CS). This course has been created in 2010, in collaboration with S. Oudot. The course material includes lecture notes (about 140 pages) on computational geometry, covering basic results, as well as recent advances and applications in the field; we also developed a java library (Jcg) designed for implementing geometric algorithms, including main data structures and geometric algorithms and predicates. The course is attended in average by 15 students. since 2012 instructor of the course Geometric modeling: Digital representation and analysis of shapes (INF555) (graduate course, master program in CS). This course has been created in 2012, in collaboration with M. Ovsjanikov, and is attended in average by 15 students. The course offers an overview of fundamentals representations of 3D shapes (Bézier curves and surfaces, BSplines, Nurbs, subdivision surfaces), as well as an introduction to the recent advances in the field of geometric processing. since 2014 chargé de TD (teaching assistant) for the course Smartphone programming (INF471), 2nd year undergraduate (32 hours). 2008-13 chargé de TD (teaching assistant) for the course Fundamentals of programming and algorithms (INF421), 2nd year undergraduate (36 hours). This is a standard basic course on algorithms and data structures. since 2009 chargé de TD (teaching assistant) for the course Introduction to computer science (INF311), 1st year undergraduate (40 hours). This is an introductory course to (Java) programming. Previous teaching experience (before 2008) 2006 2007: Assistant Lecturer in CS (full time), "Institut Gaspard Monge", University of Marne-la-Vallée. Programming in C, first year undergraduate. Data structures, second year undergraduate. Advanced programming in Java, second year undergraduate. 2005-2006 teaching assistant at the CS Departement École Polytechnique. 2006 teaching assistant at EFREI (Villejuif).
Academic advisory Anatolii Kostrygin : master s thesis in computer science, Ecole Polytechnique (co-advisor), 2013. Dissertation: "Periodic planar straight-frame drawings with polynomial resolution". Alexandre Nolin Willy Quach : master s thesis in computer science, Ecole Polytechnique (co-advisor), 2014. Dissertation: "Spectral tools for the analysis of complex networks". : diploma s thesis in computer science, Ecole Polytechnique (co-advisor), 2014. Dissertation: "Geometric analysis of social networks". Administrative duties since sept. 2012 : co-responsible (with G. Schaeffer) of the Algorithmics and Efficiency theme, part of the graduate program offered by the CS Department. since jan. 2011 : co-responsible (with R. Keriven) of the Image-Vision-Machine Learning theme, bi-disciplinary graduate curriculum between mathematics and computer science. since jan. 2012 : member of the committee of the CS Department (DIX). spring 2012 spring 2011 : president of the recruiting committee for the CS Departement (DIX). : member of the recruiting committee for the X-CNRS (chair d excellence) position at LIX. Professional activity Consulting : design and implementation of algorithmic solutions for Volkswagen Coaching GMBH (Wolfsbourg, Germany), june 2005. I provided an approximate solution for an optimization problem concerning the design of car prototypes. The approach made use of approximation algorithms and the final solution was extremely close to the optimal one.
Reviewer for international conferences and journals Conferences : ACM-SIAM Symposium on Discrete Algorithms (SODA 2009, 2006), ACM Symposium on Computational Geometry (SoCG 2008, 2011, 2012, 2014), ANALCO (2011), Canadian Conference on Computational Geometry (CCCG 2008), European Symposium on Algorithms (ESA 2014), Eurographics 2011, Graph Drawing (GD 2011), Graphics Interface 2006, Int. Colloquium on Automata, Languages, and Programming (ICALP 2015), Int. Symposium on Algorithms and Computation (ISAAC 2011, 2012), Latin American Theoretical INformatics Symposium (LATIN 2014), Pacific Graphics 2005, Sibgrapi 2011, Workshop on Algorithms and Computation (WALCOM 2009), Workshop on Algorithms and Data Structures (WADS 2011, 2013). Journals : Algorithmica, Discrete Applied Mathematics, Discrete and Computational Geometry, Journal on Discrete Algorithms, Journal of Graph Algorithms and Applications, Theoretical Computer Science, The Visual Computer. Honors and awards 2005-06 : french gouvernment fellowship (Ministère des Affaires Étrangères), accorded by the Embassy of France in Rome. 2003-05 : fellowship of the University de Milan (CS Dept.). 2003-04 : french gouvernment fellowship (MAEF), accorded by the Embassy of France in Rome (declined because of administrative incompatibility). 1999 : 6 months Erasmus internship. Languages French fluent English good familiarity Spanish good comprehension Italian native
Skills programming: long and extensive experience of Java (since 1999, >50K lines of code), good familiarity with C/C++; familiarity with HTML/CSS and Javascript; basic notions of PHP, MySql, Pascal, Fortran, Basic. other: Windows 9x/2000/XP/..., Linux, Cordova/PhoneGap, Latex. Talks Talks (international audience) Periodic planar straight-frame drawings with polynomial resolution. 11th Latin American Theoretical INformatics Symposium, Montevideo (Uruguay), march 31 - april 4, 2014 ESQ: editable SQuad representation for triangle meshes. SIBGRAPI 2012 - Conference on Graphics, Patterns and Images, Ouro Preto (Brazil), august 22-25 2012 Explicit array-based compact data structures for triangulations. 22nd International Symposium on Algorithms and Computation (ISAAC), Yokohama (Japan), december 5-8, 2011 Explicit array-based compact data structures for planar and surface meshes. XIV Spanish Meeting on Computational Geometry, Universidad de Alcalá, in Alcalá de Henares (Spain), june 27-30, 2011 Graph Encoding: an Overview. Algorithmics and combinatorics of (planar) graphs. Adaptive, Output Sensitive, Online and Parameterized Algorithms, Schloss Dagstuhl - Leibniz Center for Informatics (april 2009). Schnyder woods for higher genus triangulated surfaces, ACM Symposium on Computational Geometry (SoCG08), University of Maryland, College Park (Maryland), (june 2008). Schnyder woods for higher genus triangulated surfaces, Topological and Geometric Graph Theory (TGGT08), Ecole Normale Supérieure, Paris, (2008). Schnyder woods for higher genus triangulated surfaces, 24th European Workshop on Comp. Geometry (EuroCG08), Nancy, France (march 2008)
Succinct representations of labeled graphs, Journées en l honneur de D. Knuth, Bordeaux, France (october 29-31 2007) Optimal succinct representations of planar maps, 22nd ACM Symposium on Computational Geometry (SoCG06), Sedona USA (june 2006) Succinct Representation of Triangulations with a Boundary, Workshop on Algorithms and Data Structures (WADS), University of Waterloo, ON. Canada (august 15-17 2005) Dynamic Updates of Succinct Triangulations, Canadian Conference on Computational Geometry (CCCG), University of Windsor, ON. Canada (august 10-12 2005) Canonical Triangulation of a Graph, with a Coding Application, Franco-Canadian Workshop on Combinatorial Algorithms (COMAL), Mc Master University, Hamilton, ON. Canada (august 18-20 2005) Other talks (national audience) Forêts de Schnyder en genre supérieur: du codage au dessin de graphes. Journées de Combinatoire de Bordeaux (JCB 2014), Labri (France), february 2014. Explicit array-based compact data structures for triangulations. Journées de Géométrie Algorithmique (JGA 2012), Centre Arts et Métiers Paris Tech Cluny (France), april 2012. Schnyder woods and graph encoding. december 2010. Journées GRATOS, LIRMM, Montpellier, Succinct representation of labeled graphs, Journées Géométrie et Informatique (JGI07), INRIA Sophia Antipolis (june 2007). GEOCOMP : Structures de données compactes et représentation des maillages de surface, Journées Paristic, LORIA, Nancy (november 2006) Représentations succinctes optimales pour les maillages, Journée Compression d objets 3D, ENST, Paris (october 2006) Représentation succincte optimale de cartes planaires, Journées de Géométrie Algorithmique (JGA06), Le Bessat (feb 2006) Représentation succincte de triangulations, Journées de Géométrie Algorithmique et Discrète (JGAD05), Institut Henri Poincaré, Paris (september 2005)
Représentation succincte de triangulations avec un bord, Journées ALEA 2005, CIRM Luminy, Marseille (march 2005) Représentation compacte de triangulations, Journées de Géométrie Algorithmique (JGA05), St. Pierre de Chartreuse (24-28 january 2005) Triangulation Canonique d un graphe 3-connexe, Journées de Géométrie Algorithmique et Discrète (JGAD04), Marne la Vallée (september 2004) Canonical Triangulation of a Graph, with a Coding Application, Workshop Telegeo, Sophia-Antipolis (november 2003) Seminars Schnyder woods for higher genus surfaces: from graph encoding to graph drawing. Dep of Computer Science (DCC), Universidad de Chile, Santiago, 22th august 2014. Schnyder woods for higher genus triangulated surfaces, séminaire Geometrica, IN- RIA, Sophia-Antipolis (10 mars 2008) Compact representations of geometric data structures, IGM, Université Marne la Vallée (22 mai 2007). Compact representations of geometric data structures, séminaire Algorithmique et Complexité, LRI, Université Paris 11, Orsay (12 avril 2007). Compact representations of geometric data structures,computer Science Seminar, Université Libre de Bruxelles (ULB), Bruxelles (27 mars 2007). Compact representations of geometric data structures, University of Toronto, ON. Canada (26 janvier 2007). Compact representations of geometric data structures, Algorithms and Complexity Seminar, University of Waterloo, ON. Canada (24 janvier 2007) Succinct representations of triangulations with a boundary, séminaire GeCoal, Ecole Normale Supérieure, Paris (juin 2005)
Publications International journals Jérémy Barbay, Luca Castelli Aleardi, Meng He and J. Ian Munro, Succinct Representation of Labeled Graphs, Algorithmica 62(1-2): 224-257 (2012). (extended version of the paper appeared at ISAAC 2007) Luca Castelli Aleardi, Olivier Devillers and Abdelkrim Mebarki. Catalog Based Representation of 2D triangulations. Internat. J. Comput. Geom. Appl., 21(4): 393-402, 2011. (extended version of the paper appeared at CCCG 2006]) Luca Castelli Aleardi, Eric Fusy and Thomas Lewiner. Schnyder woods for higher genus triangulated surfaces, with applications to encoding, Discrete and Computational Geometry (special issue of SoCG 2008), 32(3): 489-516, 2009. Luca Castelli Aleardi, Olivier Devillers et Gilles Schaeffer. Succinct representations of planar maps, to appear in Theoretical Computer Science (special issue in honor of F. Preparata), 408:174-187, 2008. (extended version of the paper appeared at SoCG 2006) Book chapters Luca Castelli Aleardi, Olivier Devillers, and Jarek Rossignac. Triangulation Data Structures. In Encyclopedia of Algorithms, Springer, 2015. International conferences (with refereed proceedings) Luca Castelli Aleardi, Alexandre Nolin and Maks Ovsjanikov. Efficient and practical tree preconditioning for solving Laplacian systems. In Proc. of 14th Int. Symposium on Experimental Algorithms (SEA 2015), to appear, 2015. Luca Castelli Aleardi, Éric Fusy and Anatolii Kostrygin. Periodic planar straightframe drawingswith 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. 20th Int Symp. on Graph Drawing (GD 2012), Springer LNCS, vol. 7704, p. 376-387, 2012. Luca Castelli Aleardi, Olivier Devillers, and Jarek Rossignac. ESQ: Editable SQuad representation for triangle meshes. In Proc. of XXV SIBGRAPI - Conference on Graphics, Patterns and Images (Sibgrapi 2012), IEEE Computer Society, p. 110-117, 2012. 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. Luca Castelli Aleardi, Eric 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. Luca Castelli Aleardi, Eric Fusy et Thomas Lewiner. Schnyder woods for higher genus triangulated surfaces, in Proc. of the 24th annual ACM Symp. on Computational Geometry (SoCG 2008), p. 311-319. J. Barbay, L. Castelli Aleardi, M. He et I. J. Munro. Succinct representations of labeled graphs, in Proc. of the 18th Int. Symposium on Algorithms and Computation (ISAAC 2007), Springer LNCS, vol. 4835, p. 316-328. Luca Castelli Aleardi, Olivier Devillers et Gilles Schaeffer. Optimal succinct representations of planar maps, in Proc. of the 22nd annual ACM Symposium on Computational Geometry (SoCG 2006), p. 309-318. Luca Castelli Aleardi, Olivier Devillers et Abdelkrim Mebarki. 2D Triangulation Representation using Stable Catalogs, in Proc. of the 18th Canadian Conference on Computational Geometry (CCCG 2006), p. 71-74. Luca Castelli Aleardi, Olivier Devillers et 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. Luca Castelli Aleardi, Olivier Devillers et Gilles Schaeffer. Dynamic updates of succinct triangulations, in Proc. of the 17th Canadian Conference on Computational Geometry (CCCG 2005), p. 135-138. Workshops
Luca Castelli Aleardi, Olivier Devillers, and Éric Fusy. Crossing-free straight-line drawing of graphs on the flat torus. In Workshop on Geometric Structures with Symmetry and Periodicity, Computational Geometry Week,, Kyoto, 2014. Luca Castelli Aleardi and Eric Fusy. Canonical ordering for triangulations on the cylinder, with applications to periodic straight-line drawings, 28th European Workshop on Computational Geometry (EuroCG 2012). Luca Castelli Aleardi and Olivier Devillers. Explicit array-based compact data structures for planar and surface meshes. In Abstracts XIV Spanish Meeting on Computational Geometry, 2011. Luca Castelli Aleardi, Eric Fusy et Thomas Lewiner. Schnyder woods for higher genus triangulated surfaces, abstract (4 pages), présenté au European Workshop on Computational Geometry (EuroCG 2008), Nancy, 18-20 mars 2008. L. Castelli Aleardi et O. Devillers. Canonical Triangulation of a Graph, with a Coding Application, Franco-Canadian Workshop on Combinatorial Algorithms (COMAL), McMaster University, Hamilton, ON. Canada, 18-20 août 2005, p. 23. Technical reports Luca Castelli Aleardi and Olivier Devillers. Canonical Triangulation of a Graph, with a Coding Application. Rapport de recherche 5231, INRIA, 24 pages, 2004. Luca Castelli Aleardi, Olivier Devillers, and Gilles Schaeffer. Compact representation of triangulations. Rapport de recherche 5433, INRIA, 20 pages, 2004. Luca Castelli Aleardi, Olivier Devillers and Gilles Schaeffer. Dynamic updates of succinct triangulations. Rapport de recherche 5709, INRIA, 23 pages, 2005. Luca Castelli Aleardi, Olivier Devillers and Gilles Schaeffer. Optimal succinct representations of planar maps. Rapport de recherche 5803, INRIA, 26 pages, 2006. Jeremy Barbay, Luca Castelli Aleardi, Meng He and J. Ian Munro. Succinct Representation of Labeled Graphs. Technical Report CS-2007-11, University of Waterloo, Ontario, Canada,16 pages, 2007. Luca Castelli Aleardi and Olivier Devillers. Explicit array-based compact data structures for triangulations. Research Report 7736, INRIA, 2011. Luca Castelli Aleardi, Olivier Devillers, and Éric Fusy. Canonical ordering for triangulations on the cylinder, with applications to periodic straight-line drawings. Research Report 7989, INRIA, 2012.
Miscellanea Luca Castelli Aleardi. Représentations compactes de structures de données géométriques. PhD thesis, Ecole Polytechnique, december 2006. Luca Castelli Aleardi. Compression optimale de graphes planaires maximaux et extension au cas 3-connexe. Master thesis (DEA Algorithmique), University "Pierre et Marie Curie" (Paris 6), France, september 2003. Luca Castelli Aleardi. Unimodalità, unimodularità e strategie greedy nall approssimazione lineare a tratti di minima complessità. Master thesis (Tesi di Laurea), Departement of mathematics, "Università degli Studi di Milano", july 2002.