Research code and data

• Efficient and practical tree preconditioning for solving Laplacian systems
  (Symp. on Exp. Algorithms, SEA 2015, developed by L. Castelli Aleardi, M. Ovsjanikov and A. Nolin)
• ARRAY-BASED COMPACT DATA STRUCTURES FOR TRIANGULATIONS
  (Symp. on Algorithms and Computation (ISAAC 2011) and JoCG2018, code developed by L. Castelli Aleardi)
• Fast spherical drawing of triangulations
  (Symp. on Exp. Algorithms, SEA 2018, code developed by L. Castelli Aleardi and G. Denis)
• Balanced Schnyder woods with applications to graph drawing and graph separators
  (27th Symp. on Graph Drawing and network visualization, GD2019, code developed by L. Castelli Aleardi)
• SCARST: Schnyder Compact And Regularity Sensitive Triangulation Data Structure
  (40th Symp. on Comp. Geometry, SoCG2024, code developed by L. Castelli Aleardi)
• Jcg (java library for Computational Geometry, developed by L. Castelli Aleardi and S. Oudot)
  
• Datasets: graphs and 3d models (real-world 3d models and synthetic graphs)
  

Some old Java implementations (1999-2003)

• Curve razionali di Bézier (with some Java implementations)
• Colorability, resolution and Davis-Putnam procedure (Java implementation)
• Partial orders and hypergraphs (java implementation)
• Traitement d'images