[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [ft-devel] Getting the kerning pairs in under O(n*n)
|
From: |
Werner LEMBERG |
|
Subject: |
Re: [ft-devel] Getting the kerning pairs in under O(n*n) |
|
Date: |
Thu, 04 Oct 2012 07:52:06 +0200 (CEST) |
> The makers of m17n developed libotf which at a time provide some,
> although rather spotty, support for complex-script rendering.
Is it really `spotty'? I've never tested it, but it seems that its
Lisp framework should easily handle all aspects, and in case errors
are found, m17n gets patched accordingly.
Werner
- [ft-devel] Getting the kerning pairs in under O(n*n), Vinnie Falco, 2012/10/03
- Re: [ft-devel] Getting the kerning pairs in under O(n*n), Werner LEMBERG, 2012/10/03
- Re: [ft-devel] Getting the kerning pairs in under O(n*n), Vinnie Falco, 2012/10/03
- Re: [ft-devel] Getting the kerning pairs in under O(n*n), Emile van Bergen, 2012/10/04
- Re: [ft-devel] Getting the kerning pairs in under O(n*n), emile-ft, 2012/10/03
- Re: [ft-devel] Getting the kerning pairs in under O(n*n), Adam Twardoch (List), 2012/10/03
- Re: [ft-devel] Getting the kerning pairs in under O(n*n),
Werner LEMBERG <=
- Re: [ft-devel] Getting the kerning pairs in under O(n*n), James Cloos, 2012/10/04
- Re: [ft-devel] Getting the kerning pairs in under O(n*n), Werner LEMBERG, 2012/10/05
- Re: [ft-devel] Getting the kerning pairs in under O(n*n), Werner LEMBERG, 2012/10/04
- Re: [ft-devel] Getting the kerning pairs in under O(n*n), Werner LEMBERG, 2012/10/04
- Re: [ft-devel] Getting the kerning pairs in under O(n*n), suzuki toshiya, 2012/10/04
Re: [ft-devel] Getting the kerning pairs in under O(n*n), Adam Twardoch (List), 2012/10/03