#### Filter Results:

- Full text PDF available (11)

#### Publication Year

2005

2018

- This year (2)
- Last 5 years (5)
- Last 10 years (16)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- JÃ©rÃ©my Barbay, Luca Castelli Aleardi, Meng He, J. Ian Munro
- ISAAC
- 2007

We consider the problem of designing succinct geometric data structures while maintaining efficient navigation operations. A data structure is said succinct if the asymptotic amount of space it usesâ€¦ (More)

- Luca Castelli Aleardi, Olivier Devillers, Gilles Schaeffer
- Symposium on Computational Geometry
- 2006

This paper addresses the problem of representing the connectivity information of geometric objects using as little memory as possible. As opposed to raw compression issues, the focus is here onâ€¦ (More)

- Luca Castelli Aleardi, Ã‰ric Fusy, Thomas Lewiner
- CCCG
- 2010

Extending a bijection recently introduced by Poulalhon and Schaeffer [15] for triangulations of the sphere we design an efficient algorithm for encoding (topological) triangulations and bipartiteâ€¦ (More)

- Luca Castelli Aleardi, Olivier Devillers, Gilles Schaeffer
- Theor. Comput. Sci.
- 2008

This paper addresses the problem of representing the connectivity information of geometric objects using as little memory as possible. As opposed to raw compression issues, the focus is here onâ€¦ (More)

- Luca Castelli Aleardi, Ã‰ric Fusy, Thomas Lewiner
- Symposium on Computational Geometry
- 2008

Schnyder woods are a well known combinatorial structure for planar graphs, which yields a decomposition into 3 vertex-spanning trees. Our goal is to extend definitions and algorithms for Schnyderâ€¦ (More)

- Luca Castelli Aleardi, Ã‰ric Fusy, Anatolii Kostrygin
- LATIN
- 2014

We present a new algorithm to compute periodic (planar) straight-line drawings of toroidal graphs. Our algorithm is the rst to achieve two important aesthetic criteria: the drawing ts in a straightâ€¦ (More)

- Luca Castelli Aleardi, Olivier Devillers, Jarek Rossignac
- 2012 25th SIBGRAPI Conference on Graphicsâ€¦
- 2012

We consider the problem of designing space efficient solutions for representing the connectivity information of manifold triangle meshes. Most mesh data structures are quite redundant, storing aâ€¦ (More)

The problem of representing triangulations has been widely studied to obtain convenient encodings and space efficient data structures. In this paper we propose a new practical approach to reduce theâ€¦ (More)

- JÃ©rÃ©my Barbay, Luca Castelli Aleardi, Meng He, J. Ian Munro
- Algorithmica
- 2010

In many applications, the properties of an object being modeled are stored as labels on vertices or edges of a graph. In this paper, we consider succinct representation of labeled graphs. Our mainâ€¦ (More)