diff --git a/KETTriangulation.hs b/KETTriangulation.hs deleted file mode 100644 --- a/KETTriangulation.hs +++ /dev/null @@ -1,75 +0,0 @@ --------------------------------------------------------------------------------- --- Copyright (C) 1997, 1998, 2008 Joern Dinkla, www.dinkla.net --------------------------------------------------------------------------------- --- --- see --- Joern Dinkla, Geometrische Algorithmen in Haskell, Diploma Thesis, --- University of Bonn, Germany, 1998. --- --- triangulation of simple polygons after Kong, Everett, Toussaint 91 --- with some changes by T.Vogt: return indices instead of coordinates of triangles - -module KETTriangulation (ketTri) where -import List ( (\\) ) - -type XYI = (Float,Float,Int) - -ketTri :: [(Float,Float)] -> [(Int,Int,Int)] -ketTri poly = scan vs stack rs - where ps@(p1:p2:p3:qs) = vertices poly - vs = qs ++ [p1] - stack = [p3, p2, p1, last ps] - rs = reflexVertices ps - -scan :: [XYI] -> [XYI] -> [XYI] -> [(Int,Int,Int)] -scan [] _ _ = [] -scan [v] [x_p, x_i, _, _] rs = [(sel3_3 x_i, sel3_3 x_p, sel3_3 v)] -scan (v:vs) ss@[_,_,_] rs = scan vs (v:ss) rs -scan vs@(v:vs') ss@(x_p:x_i:ss'@(x_m:x_mm:xs)) rs - | isEar rs x_m x_i x_p = (sel3_3 x_m, sel3_3 x_i, sel3_3 x_p) : scan vs (x_p:ss') rs' - | otherwise = scan vs' (v:ss) rs - where rs' = rs \\ (isConvex x_m x_p v ++ isConvex x_mm x_m x_p) - isConvex im i ip = if isLeftTurn im i ip then [i] else [] - -isEar :: [XYI] -> XYI -> XYI -> XYI -> Bool -isEar [] _ _ _ = True -isEar rs m x p = isLeftTurn m x p && not (any ( (m,x,p) `containsBNV`) rs) - -reflexVertices :: [XYI] -> [XYI] -reflexVertices xs = [ x | (m,x,p) <- angles xs, isRightTurnOrOn m x p ] - -isRightTurnOrOn m x p = (area2 m x p) <= 0 -isLeftTurn m x p = (area2 m x p) > 0 -area2 (x2,y2,_) (x0,y0,_) (x1,y1,_) = (x1-x0)*(y2-y0)-(x2-x0)*(y1-y0) - -containsBNV (s,t,v) p = (a==b && b==c) - where a = isLeftTurn s t p - b = isLeftTurn t v p - c = isLeftTurn v s p - -angles :: [a] -> [(a,a,a)] -angles xs = zip3 (rotateR xs) xs (rotateL xs) - -rotateL xs = tail xs ++ [head xs] -rotateR xs = [last xs] ++ init xs -sel3_1 (x,y,z) = x -sel3_2 (x,y,z) = y -sel3_3 (x,y,z) = z - --- make vertices of polygon counterclockwise and add an index -vertices :: [(Float,Float)] -> [XYI] -vertices qs | polygon_direction ps = ps - | otherwise = reverse ps - where ps = zipWith (\(x,y) z -> (x,y,z) ) qs [0..] - --- the direction (clockwise or counterclockwise) of a polygon can be obtained by looking at a maximal point -polygon_direction :: [XYI] -> Bool -polygon_direction poly = isLeftTurn (p (l-1) poly) (p l poly) (p (l+1) poly) - where p l poly = head (drop (l `mod` lp) poly) - l = maxim poly 0 0 0 0 - lp = length poly - -- the index of the right-/upmost point - maxim [] l ml mx my = ml - maxim (x:xs) l ml mx my | ((sel3_1 x) > mx) && ((sel3_2 x) >= my) = maxim xs (l+1) l (sel3_1 x) (sel3_2 x) - | otherwise = maxim xs (l+1) ml mx my - diff --git a/LICENSE b/LICENSE --- a/LICENSE +++ b/LICENSE @@ -1,504 +1,504 @@ - GNU LESSER GENERAL PUBLIC LICENSE - Version 2.1, February 1999 - - Copyright (C) 1991, 1999 Free Software Foundation, Inc. - 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA - Everyone is permitted to copy and distribute verbatim copies - of this license document, but changing it is not allowed. - -[This is the first released version of the Lesser GPL. It also counts - as the successor of the GNU Library Public License, version 2, hence - the version number 2.1.] - - Preamble - - The licenses for most software are designed to take away your -freedom to share and change it. By contrast, the GNU General Public -Licenses are intended to guarantee your freedom to share and change -free software--to make sure the software is free for all its users. - - This license, the Lesser General Public License, applies to some -specially designated software packages--typically libraries--of the -Free Software Foundation and other authors who decide to use it. You -can use it too, but we suggest you first think carefully about whether -this license or the ordinary General Public License is the better -strategy to use in any particular case, based on the explanations below. - - When we speak of free software, we are referring to freedom of use, -not price. Our General Public Licenses are designed to make sure that -you have the freedom to distribute copies of free software (and charge -for this service if you wish); that you receive source code or can get -it if you want it; that you can change the software and use pieces of -it in new free programs; and that you are informed that you can do -these things. - - To protect your rights, we need to make restrictions that forbid -distributors to deny you these rights or to ask you to surrender these -rights. These restrictions translate to certain responsibilities for -you if you distribute copies of the library or if you modify it. - - For example, if you distribute copies of the library, whether gratis -or for a fee, you must give the recipients all the rights that we gave -you. You must make sure that they, too, receive or can get the source -code. If you link other code with the library, you must provide -complete object files to the recipients, so that they can relink them -with the library after making changes to the library and recompiling -it. And you must show them these terms so they know their rights. - - We protect your rights with a two-step method: (1) we copyright the -library, and (2) we offer you this license, which gives you legal -permission to copy, distribute and/or modify the library. - - To protect each distributor, we want to make it very clear that -there is no warranty for the free library. Also, if the library is -modified by someone else and passed on, the recipients should know -that what they have is not the original version, so that the original -author's reputation will not be affected by problems that might be -introduced by others. - - Finally, software patents pose a constant threat to the existence of -any free program. We wish to make sure that a company cannot -effectively restrict the users of a free program by obtaining a -restrictive license from a patent holder. Therefore, we insist that -any patent license obtained for a version of the library must be -consistent with the full freedom of use specified in this license. - - Most GNU software, including some libraries, is covered by the -ordinary GNU General Public License. This license, the GNU Lesser -General Public License, applies to certain designated libraries, and -is quite different from the ordinary General Public License. We use -this license for certain libraries in order to permit linking those -libraries into non-free programs. - - When a program is linked with a library, whether statically or using -a shared library, the combination of the two is legally speaking a -combined work, a derivative of the original library. The ordinary -General Public License therefore permits such linking only if the -entire combination fits its criteria of freedom. The Lesser General -Public License permits more lax criteria for linking other code with -the library. - - We call this license the "Lesser" General Public License because it -does Less to protect the user's freedom than the ordinary General -Public License. It also provides other free software developers Less -of an advantage over competing non-free programs. These disadvantages -are the reason we use the ordinary General Public License for many -libraries. However, the Lesser license provides advantages in certain -special circumstances. - - For example, on rare occasions, there may be a special need to -encourage the widest possible use of a certain library, so that it becomes -a de-facto standard. To achieve this, non-free programs must be -allowed to use the library. A more frequent case is that a free -library does the same job as widely used non-free libraries. In this -case, there is little to gain by limiting the free library to free -software only, so we use the Lesser General Public License. - - In other cases, permission to use a particular library in non-free -programs enables a greater number of people to use a large body of -free software. For example, permission to use the GNU C Library in -non-free programs enables many more people to use the whole GNU -operating system, as well as its variant, the GNU/Linux operating -system. - - Although the Lesser General Public License is Less protective of the -users' freedom, it does ensure that the user of a program that is -linked with the Library has the freedom and the wherewithal to run -that program using a modified version of the Library. - - The precise terms and conditions for copying, distribution and -modification follow. Pay close attention to the difference between a -"work based on the library" and a "work that uses the library". The -former contains code derived from the library, whereas the latter must -be combined with the library in order to run. - - GNU LESSER GENERAL PUBLIC LICENSE - TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION - - 0. This License Agreement applies to any software library or other -program which contains a notice placed by the copyright holder or -other authorized party saying it may be distributed under the terms of -this Lesser General Public License (also called "this License"). -Each licensee is addressed as "you". - - A "library" means a collection of software functions and/or data -prepared so as to be conveniently linked with application programs -(which use some of those functions and data) to form executables. - - The "Library", below, refers to any such software library or work -which has been distributed under these terms. A "work based on the -Library" means either the Library or any derivative work under -copyright law: that is to say, a work containing the Library or a -portion of it, either verbatim or with modifications and/or translated -straightforwardly into another language. (Hereinafter, translation is -included without limitation in the term "modification".) - - "Source code" for a work means the preferred form of the work for -making modifications to it. For a library, complete source code means -all the source code for all modules it contains, plus any associated -interface definition files, plus the scripts used to control compilation -and installation of the library. - - Activities other than copying, distribution and modification are not -covered by this License; they are outside its scope. The act of -running a program using the Library is not restricted, and output from -such a program is covered only if its contents constitute a work based -on the Library (independent of the use of the Library in a tool for -writing it). Whether that is true depends on what the Library does -and what the program that uses the Library does. - - 1. You may copy and distribute verbatim copies of the Library's -complete source code as you receive it, in any medium, provided that -you conspicuously and appropriately publish on each copy an -appropriate copyright notice and disclaimer of warranty; keep intact -all the notices that refer to this License and to the absence of any -warranty; and distribute a copy of this License along with the -Library. - - You may charge a fee for the physical act of transferring a copy, -and you may at your option offer warranty protection in exchange for a -fee. - - 2. You may modify your copy or copies of the Library or any portion -of it, thus forming a work based on the Library, and copy and -distribute such modifications or work under the terms of Section 1 -above, provided that you also meet all of these conditions: - - a) The modified work must itself be a software library. - - b) You must cause the files modified to carry prominent notices - stating that you changed the files and the date of any change. - - c) You must cause the whole of the work to be licensed at no - charge to all third parties under the terms of this License. - - d) If a facility in the modified Library refers to a function or a - table of data to be supplied by an application program that uses - the facility, other than as an argument passed when the facility - is invoked, then you must make a good faith effort to ensure that, - in the event an application does not supply such function or - table, the facility still operates, and performs whatever part of - its purpose remains meaningful. - - (For example, a function in a library to compute square roots has - a purpose that is entirely well-defined independent of the - application. Therefore, Subsection 2d requires that any - application-supplied function or table used by this function must - be optional: if the application does not supply it, the square - root function must still compute square roots.) - -These requirements apply to the modified work as a whole. If -identifiable sections of that work are not derived from the Library, -and can be reasonably considered independent and separate works in -themselves, then this License, and its terms, do not apply to those -sections when you distribute them as separate works. But when you -distribute the same sections as part of a whole which is a work based -on the Library, the distribution of the whole must be on the terms of -this License, whose permissions for other licensees extend to the -entire whole, and thus to each and every part regardless of who wrote -it. - -Thus, it is not the intent of this section to claim rights or contest -your rights to work written entirely by you; rather, the intent is to -exercise the right to control the distribution of derivative or -collective works based on the Library. - -In addition, mere aggregation of another work not based on the Library -with the Library (or with a work based on the Library) on a volume of -a storage or distribution medium does not bring the other work under -the scope of this License. - - 3. You may opt to apply the terms of the ordinary GNU General Public -License instead of this License to a given copy of the Library. To do -this, you must alter all the notices that refer to this License, so -that they refer to the ordinary GNU General Public License, version 2, -instead of to this License. (If a newer version than version 2 of the -ordinary GNU General Public License has appeared, then you can specify -that version instead if you wish.) Do not make any other change in -these notices. - - Once this change is made in a given copy, it is irreversible for -that copy, so the ordinary GNU General Public License applies to all -subsequent copies and derivative works made from that copy. - - This option is useful when you wish to copy part of the code of -the Library into a program that is not a library. - - 4. You may copy and distribute the Library (or a portion or -derivative of it, under Section 2) in object code or executable form -under the terms of Sections 1 and 2 above provided that you accompany -it with the complete corresponding machine-readable source code, which -must be distributed under the terms of Sections 1 and 2 above on a -medium customarily used for software interchange. - - If distribution of object code is made by offering access to copy -from a designated place, then offering equivalent access to copy the -source code from the same place satisfies the requirement to -distribute the source code, even though third parties are not -compelled to copy the source along with the object code. - - 5. A program that contains no derivative of any portion of the -Library, but is designed to work with the Library by being compiled or -linked with it, is called a "work that uses the Library". Such a -work, in isolation, is not a derivative work of the Library, and -therefore falls outside the scope of this License. - - However, linking a "work that uses the Library" with the Library -creates an executable that is a derivative of the Library (because it -contains portions of the Library), rather than a "work that uses the -library". The executable is therefore covered by this License. -Section 6 states terms for distribution of such executables. - - When a "work that uses the Library" uses material from a header file -that is part of the Library, the object code for the work may be a -derivative work of the Library even though the source code is not. -Whether this is true is especially significant if the work can be -linked without the Library, or if the work is itself a library. The -threshold for this to be true is not precisely defined by law. - - If such an object file uses only numerical parameters, data -structure layouts and accessors, and small macros and small inline -functions (ten lines or less in length), then the use of the object -file is unrestricted, regardless of whether it is legally a derivative -work. (Executables containing this object code plus portions of the -Library will still fall under Section 6.) - - Otherwise, if the work is a derivative of the Library, you may -distribute the object code for the work under the terms of Section 6. -Any executables containing that work also fall under Section 6, -whether or not they are linked directly with the Library itself. - - 6. As an exception to the Sections above, you may also combine or -link a "work that uses the Library" with the Library to produce a -work containing portions of the Library, and distribute that work -under terms of your choice, provided that the terms permit -modification of the work for the customer's own use and reverse -engineering for debugging such modifications. - - You must give prominent notice with each copy of the work that the -Library is used in it and that the Library and its use are covered by -this License. You must supply a copy of this License. If the work -during execution displays copyright notices, you must include the -copyright notice for the Library among them, as well as a reference -directing the user to the copy of this License. Also, you must do one -of these things: - - a) Accompany the work with the complete corresponding - machine-readable source code for the Library including whatever - changes were used in the work (which must be distributed under - Sections 1 and 2 above); and, if the work is an executable linked - with the Library, with the complete machine-readable "work that - uses the Library", as object code and/or source code, so that the - user can modify the Library and then relink to produce a modified - executable containing the modified Library. (It is understood - that the user who changes the contents of definitions files in the - Library will not necessarily be able to recompile the application - to use the modified definitions.) - - b) Use a suitable shared library mechanism for linking with the - Library. A suitable mechanism is one that (1) uses at run time a - copy of the library already present on the user's computer system, - rather than copying library functions into the executable, and (2) - will operate properly with a modified version of the library, if - the user installs one, as long as the modified version is - interface-compatible with the version that the work was made with. - - c) Accompany the work with a written offer, valid for at - least three years, to give the same user the materials - specified in Subsection 6a, above, for a charge no more - than the cost of performing this distribution. - - d) If distribution of the work is made by offering access to copy - from a designated place, offer equivalent access to copy the above - specified materials from the same place. - - e) Verify that the user has already received a copy of these - materials or that you have already sent this user a copy. - - For an executable, the required form of the "work that uses the -Library" must include any data and utility programs needed for -reproducing the executable from it. However, as a special exception, -the materials to be distributed need not include anything that is -normally distributed (in either source or binary form) with the major -components (compiler, kernel, and so on) of the operating system on -which the executable runs, unless that component itself accompanies -the executable. - - It may happen that this requirement contradicts the license -restrictions of other proprietary libraries that do not normally -accompany the operating system. Such a contradiction means you cannot -use both them and the Library together in an executable that you -distribute. - - 7. You may place library facilities that are a work based on the -Library side-by-side in a single library together with other library -facilities not covered by this License, and distribute such a combined -library, provided that the separate distribution of the work based on -the Library and of the other library facilities is otherwise -permitted, and provided that you do these two things: - - a) Accompany the combined library with a copy of the same work - based on the Library, uncombined with any other library - facilities. This must be distributed under the terms of the - Sections above. - - b) Give prominent notice with the combined library of the fact - that part of it is a work based on the Library, and explaining - where to find the accompanying uncombined form of the same work. - - 8. You may not copy, modify, sublicense, link with, or distribute -the Library except as expressly provided under this License. Any -attempt otherwise to copy, modify, sublicense, link with, or -distribute the Library is void, and will automatically terminate your -rights under this License. However, parties who have received copies, -or rights, from you under this License will not have their licenses -terminated so long as such parties remain in full compliance. - - 9. You are not required to accept this License, since you have not -signed it. However, nothing else grants you permission to modify or -distribute the Library or its derivative works. These actions are -prohibited by law if you do not accept this License. Therefore, by -modifying or distributing the Library (or any work based on the -Library), you indicate your acceptance of this License to do so, and -all its terms and conditions for copying, distributing or modifying -the Library or works based on it. - - 10. Each time you redistribute the Library (or any work based on the -Library), the recipient automatically receives a license from the -original licensor to copy, distribute, link with or modify the Library -subject to these terms and conditions. You may not impose any further -restrictions on the recipients' exercise of the rights granted herein. -You are not responsible for enforcing compliance by third parties with -this License. - - 11. If, as a consequence of a court judgment or allegation of patent -infringement or for any other reason (not limited to patent issues), -conditions are imposed on you (whether by court order, agreement or -otherwise) that contradict the conditions of this License, they do not -excuse you from the conditions of this License. If you cannot -distribute so as to satisfy simultaneously your obligations under this -License and any other pertinent obligations, then as a consequence you -may not distribute the Library at all. For example, if a patent -license would not permit royalty-free redistribution of the Library by -all those who receive copies directly or indirectly through you, then -the only way you could satisfy both it and this License would be to -refrain entirely from distribution of the Library. - -If any portion of this section is held invalid or unenforceable under any -particular circumstance, the balance of the section is intended to apply, -and the section as a whole is intended to apply in other circumstances. - -It is not the purpose of this section to induce you to infringe any -patents or other property right claims or to contest validity of any -such claims; this section has the sole purpose of protecting the -integrity of the free software distribution system which is -implemented by public license practices. Many people have made -generous contributions to the wide range of software distributed -through that system in reliance on consistent application of that -system; it is up to the author/donor to decide if he or she is willing -to distribute software through any other system and a licensee cannot -impose that choice. - -This section is intended to make thoroughly clear what is believed to -be a consequence of the rest of this License. - - 12. If the distribution and/or use of the Library is restricted in -certain countries either by patents or by copyrighted interfaces, the -original copyright holder who places the Library under this License may add -an explicit geographical distribution limitation excluding those countries, -so that distribution is permitted only in or among countries not thus -excluded. In such case, this License incorporates the limitation as if -written in the body of this License. - - 13. The Free Software Foundation may publish revised and/or new -versions of the Lesser General Public License from time to time. -Such new versions will be similar in spirit to the present version, -but may differ in detail to address new problems or concerns. - -Each version is given a distinguishing version number. If the Library -specifies a version number of this License which applies to it and -"any later version", you have the option of following the terms and -conditions either of that version or of any later version published by -the Free Software Foundation. If the Library does not specify a -license version number, you may choose any version ever published by -the Free Software Foundation. - - 14. If you wish to incorporate parts of the Library into other free -programs whose distribution conditions are incompatible with these, -write to the author to ask for permission. For software which is -copyrighted by the Free Software Foundation, write to the Free -Software Foundation; we sometimes make exceptions for this. Our -decision will be guided by the two goals of preserving the free status -of all derivatives of our free software and of promoting the sharing -and reuse of software generally. - - NO WARRANTY - - 15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO -WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW. -EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR -OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY -KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE -IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE -LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME -THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. - - 16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN -WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY -AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU -FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR -CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE -LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING -RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A -FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF -SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH -DAMAGES. - - END OF TERMS AND CONDITIONS - - How to Apply These Terms to Your New Libraries - - If you develop a new library, and you want it to be of the greatest -possible use to the public, we recommend making it free software that -everyone can redistribute and change. You can do so by permitting -redistribution under these terms (or, alternatively, under the terms of the -ordinary General Public License). - - To apply these terms, attach the following notices to the library. It is -safest to attach them to the start of each source file to most effectively -convey the exclusion of warranty; and each file should have at least the -"copyright" line and a pointer to where the full notice is found. - - - Copyright (C) - - This library is free software; you can redistribute it and/or - modify it under the terms of the GNU Lesser General Public - License as published by the Free Software Foundation; either - version 2.1 of the License, or (at your option) any later version. - - This library is distributed in the hope that it will be useful, - but WITHOUT ANY WARRANTY; without even the implied warranty of - MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU - Lesser General Public License for more details. - - You should have received a copy of the GNU Lesser General Public - License along with this library; if not, write to the Free Software - Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA - -Also add information on how to contact you by electronic and paper mail. - -You should also get your employer (if you work as a programmer) or your -school, if any, to sign a "copyright disclaimer" for the library, if -necessary. Here is a sample; alter the names: - - Yoyodyne, Inc., hereby disclaims all copyright interest in the - library `Frob' (a library for tweaking knobs) written by James Random Hacker. - - , 1 April 1990 - Ty Coon, President of Vice - -That's all there is to it! - - + GNU LESSER GENERAL PUBLIC LICENSE + Version 2.1, February 1999 + + Copyright (C) 1991, 1999 Free Software Foundation, Inc. + 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + +[This is the first released version of the Lesser GPL. It also counts + as the successor of the GNU Library Public License, version 2, hence + the version number 2.1.] + + Preamble + + The licenses for most software are designed to take away your +freedom to share and change it. By contrast, the GNU General Public +Licenses are intended to guarantee your freedom to share and change +free software--to make sure the software is free for all its users. + + This license, the Lesser General Public License, applies to some +specially designated software packages--typically libraries--of the +Free Software Foundation and other authors who decide to use it. You +can use it too, but we suggest you first think carefully about whether +this license or the ordinary General Public License is the better +strategy to use in any particular case, based on the explanations below. + + When we speak of free software, we are referring to freedom of use, +not price. Our General Public Licenses are designed to make sure that +you have the freedom to distribute copies of free software (and charge +for this service if you wish); that you receive source code or can get +it if you want it; that you can change the software and use pieces of +it in new free programs; and that you are informed that you can do +these things. + + To protect your rights, we need to make restrictions that forbid +distributors to deny you these rights or to ask you to surrender these +rights. These restrictions translate to certain responsibilities for +you if you distribute copies of the library or if you modify it. + + For example, if you distribute copies of the library, whether gratis +or for a fee, you must give the recipients all the rights that we gave +you. You must make sure that they, too, receive or can get the source +code. If you link other code with the library, you must provide +complete object files to the recipients, so that they can relink them +with the library after making changes to the library and recompiling +it. And you must show them these terms so they know their rights. + + We protect your rights with a two-step method: (1) we copyright the +library, and (2) we offer you this license, which gives you legal +permission to copy, distribute and/or modify the library. + + To protect each distributor, we want to make it very clear that +there is no warranty for the free library. Also, if the library is +modified by someone else and passed on, the recipients should know +that what they have is not the original version, so that the original +author's reputation will not be affected by problems that might be +introduced by others. + + Finally, software patents pose a constant threat to the existence of +any free program. We wish to make sure that a company cannot +effectively restrict the users of a free program by obtaining a +restrictive license from a patent holder. Therefore, we insist that +any patent license obtained for a version of the library must be +consistent with the full freedom of use specified in this license. + + Most GNU software, including some libraries, is covered by the +ordinary GNU General Public License. This license, the GNU Lesser +General Public License, applies to certain designated libraries, and +is quite different from the ordinary General Public License. We use +this license for certain libraries in order to permit linking those +libraries into non-free programs. + + When a program is linked with a library, whether statically or using +a shared library, the combination of the two is legally speaking a +combined work, a derivative of the original library. The ordinary +General Public License therefore permits such linking only if the +entire combination fits its criteria of freedom. The Lesser General +Public License permits more lax criteria for linking other code with +the library. + + We call this license the "Lesser" General Public License because it +does Less to protect the user's freedom than the ordinary General +Public License. It also provides other free software developers Less +of an advantage over competing non-free programs. These disadvantages +are the reason we use the ordinary General Public License for many +libraries. However, the Lesser license provides advantages in certain +special circumstances. + + For example, on rare occasions, there may be a special need to +encourage the widest possible use of a certain library, so that it becomes +a de-facto standard. To achieve this, non-free programs must be +allowed to use the library. A more frequent case is that a free +library does the same job as widely used non-free libraries. In this +case, there is little to gain by limiting the free library to free +software only, so we use the Lesser General Public License. + + In other cases, permission to use a particular library in non-free +programs enables a greater number of people to use a large body of +free software. For example, permission to use the GNU C Library in +non-free programs enables many more people to use the whole GNU +operating system, as well as its variant, the GNU/Linux operating +system. + + Although the Lesser General Public License is Less protective of the +users' freedom, it does ensure that the user of a program that is +linked with the Library has the freedom and the wherewithal to run +that program using a modified version of the Library. + + The precise terms and conditions for copying, distribution and +modification follow. Pay close attention to the difference between a +"work based on the library" and a "work that uses the library". The +former contains code derived from the library, whereas the latter must +be combined with the library in order to run. + + GNU LESSER GENERAL PUBLIC LICENSE + TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION + + 0. This License Agreement applies to any software library or other +program which contains a notice placed by the copyright holder or +other authorized party saying it may be distributed under the terms of +this Lesser General Public License (also called "this License"). +Each licensee is addressed as "you". + + A "library" means a collection of software functions and/or data +prepared so as to be conveniently linked with application programs +(which use some of those functions and data) to form executables. + + The "Library", below, refers to any such software library or work +which has been distributed under these terms. A "work based on the +Library" means either the Library or any derivative work under +copyright law: that is to say, a work containing the Library or a +portion of it, either verbatim or with modifications and/or translated +straightforwardly into another language. (Hereinafter, translation is +included without limitation in the term "modification".) + + "Source code" for a work means the preferred form of the work for +making modifications to it. For a library, complete source code means +all the source code for all modules it contains, plus any associated +interface definition files, plus the scripts used to control compilation +and installation of the library. + + Activities other than copying, distribution and modification are not +covered by this License; they are outside its scope. The act of +running a program using the Library is not restricted, and output from +such a program is covered only if its contents constitute a work based +on the Library (independent of the use of the Library in a tool for +writing it). Whether that is true depends on what the Library does +and what the program that uses the Library does. + + 1. You may copy and distribute verbatim copies of the Library's +complete source code as you receive it, in any medium, provided that +you conspicuously and appropriately publish on each copy an +appropriate copyright notice and disclaimer of warranty; keep intact +all the notices that refer to this License and to the absence of any +warranty; and distribute a copy of this License along with the +Library. + + You may charge a fee for the physical act of transferring a copy, +and you may at your option offer warranty protection in exchange for a +fee. + + 2. You may modify your copy or copies of the Library or any portion +of it, thus forming a work based on the Library, and copy and +distribute such modifications or work under the terms of Section 1 +above, provided that you also meet all of these conditions: + + a) The modified work must itself be a software library. + + b) You must cause the files modified to carry prominent notices + stating that you changed the files and the date of any change. + + c) You must cause the whole of the work to be licensed at no + charge to all third parties under the terms of this License. + + d) If a facility in the modified Library refers to a function or a + table of data to be supplied by an application program that uses + the facility, other than as an argument passed when the facility + is invoked, then you must make a good faith effort to ensure that, + in the event an application does not supply such function or + table, the facility still operates, and performs whatever part of + its purpose remains meaningful. + + (For example, a function in a library to compute square roots has + a purpose that is entirely well-defined independent of the + application. Therefore, Subsection 2d requires that any + application-supplied function or table used by this function must + be optional: if the application does not supply it, the square + root function must still compute square roots.) + +These requirements apply to the modified work as a whole. If +identifiable sections of that work are not derived from the Library, +and can be reasonably considered independent and separate works in +themselves, then this License, and its terms, do not apply to those +sections when you distribute them as separate works. But when you +distribute the same sections as part of a whole which is a work based +on the Library, the distribution of the whole must be on the terms of +this License, whose permissions for other licensees extend to the +entire whole, and thus to each and every part regardless of who wrote +it. + +Thus, it is not the intent of this section to claim rights or contest +your rights to work written entirely by you; rather, the intent is to +exercise the right to control the distribution of derivative or +collective works based on the Library. + +In addition, mere aggregation of another work not based on the Library +with the Library (or with a work based on the Library) on a volume of +a storage or distribution medium does not bring the other work under +the scope of this License. + + 3. You may opt to apply the terms of the ordinary GNU General Public +License instead of this License to a given copy of the Library. To do +this, you must alter all the notices that refer to this License, so +that they refer to the ordinary GNU General Public License, version 2, +instead of to this License. (If a newer version than version 2 of the +ordinary GNU General Public License has appeared, then you can specify +that version instead if you wish.) Do not make any other change in +these notices. + + Once this change is made in a given copy, it is irreversible for +that copy, so the ordinary GNU General Public License applies to all +subsequent copies and derivative works made from that copy. + + This option is useful when you wish to copy part of the code of +the Library into a program that is not a library. + + 4. You may copy and distribute the Library (or a portion or +derivative of it, under Section 2) in object code or executable form +under the terms of Sections 1 and 2 above provided that you accompany +it with the complete corresponding machine-readable source code, which +must be distributed under the terms of Sections 1 and 2 above on a +medium customarily used for software interchange. + + If distribution of object code is made by offering access to copy +from a designated place, then offering equivalent access to copy the +source code from the same place satisfies the requirement to +distribute the source code, even though third parties are not +compelled to copy the source along with the object code. + + 5. A program that contains no derivative of any portion of the +Library, but is designed to work with the Library by being compiled or +linked with it, is called a "work that uses the Library". Such a +work, in isolation, is not a derivative work of the Library, and +therefore falls outside the scope of this License. + + However, linking a "work that uses the Library" with the Library +creates an executable that is a derivative of the Library (because it +contains portions of the Library), rather than a "work that uses the +library". The executable is therefore covered by this License. +Section 6 states terms for distribution of such executables. + + When a "work that uses the Library" uses material from a header file +that is part of the Library, the object code for the work may be a +derivative work of the Library even though the source code is not. +Whether this is true is especially significant if the work can be +linked without the Library, or if the work is itself a library. The +threshold for this to be true is not precisely defined by law. + + If such an object file uses only numerical parameters, data +structure layouts and accessors, and small macros and small inline +functions (ten lines or less in length), then the use of the object +file is unrestricted, regardless of whether it is legally a derivative +work. (Executables containing this object code plus portions of the +Library will still fall under Section 6.) + + Otherwise, if the work is a derivative of the Library, you may +distribute the object code for the work under the terms of Section 6. +Any executables containing that work also fall under Section 6, +whether or not they are linked directly with the Library itself. + + 6. As an exception to the Sections above, you may also combine or +link a "work that uses the Library" with the Library to produce a +work containing portions of the Library, and distribute that work +under terms of your choice, provided that the terms permit +modification of the work for the customer's own use and reverse +engineering for debugging such modifications. + + You must give prominent notice with each copy of the work that the +Library is used in it and that the Library and its use are covered by +this License. You must supply a copy of this License. If the work +during execution displays copyright notices, you must include the +copyright notice for the Library among them, as well as a reference +directing the user to the copy of this License. Also, you must do one +of these things: + + a) Accompany the work with the complete corresponding + machine-readable source code for the Library including whatever + changes were used in the work (which must be distributed under + Sections 1 and 2 above); and, if the work is an executable linked + with the Library, with the complete machine-readable "work that + uses the Library", as object code and/or source code, so that the + user can modify the Library and then relink to produce a modified + executable containing the modified Library. (It is understood + that the user who changes the contents of definitions files in the + Library will not necessarily be able to recompile the application + to use the modified definitions.) + + b) Use a suitable shared library mechanism for linking with the + Library. A suitable mechanism is one that (1) uses at run time a + copy of the library already present on the user's computer system, + rather than copying library functions into the executable, and (2) + will operate properly with a modified version of the library, if + the user installs one, as long as the modified version is + interface-compatible with the version that the work was made with. + + c) Accompany the work with a written offer, valid for at + least three years, to give the same user the materials + specified in Subsection 6a, above, for a charge no more + than the cost of performing this distribution. + + d) If distribution of the work is made by offering access to copy + from a designated place, offer equivalent access to copy the above + specified materials from the same place. + + e) Verify that the user has already received a copy of these + materials or that you have already sent this user a copy. + + For an executable, the required form of the "work that uses the +Library" must include any data and utility programs needed for +reproducing the executable from it. However, as a special exception, +the materials to be distributed need not include anything that is +normally distributed (in either source or binary form) with the major +components (compiler, kernel, and so on) of the operating system on +which the executable runs, unless that component itself accompanies +the executable. + + It may happen that this requirement contradicts the license +restrictions of other proprietary libraries that do not normally +accompany the operating system. Such a contradiction means you cannot +use both them and the Library together in an executable that you +distribute. + + 7. You may place library facilities that are a work based on the +Library side-by-side in a single library together with other library +facilities not covered by this License, and distribute such a combined +library, provided that the separate distribution of the work based on +the Library and of the other library facilities is otherwise +permitted, and provided that you do these two things: + + a) Accompany the combined library with a copy of the same work + based on the Library, uncombined with any other library + facilities. This must be distributed under the terms of the + Sections above. + + b) Give prominent notice with the combined library of the fact + that part of it is a work based on the Library, and explaining + where to find the accompanying uncombined form of the same work. + + 8. You may not copy, modify, sublicense, link with, or distribute +the Library except as expressly provided under this License. Any +attempt otherwise to copy, modify, sublicense, link with, or +distribute the Library is void, and will automatically terminate your +rights under this License. However, parties who have received copies, +or rights, from you under this License will not have their licenses +terminated so long as such parties remain in full compliance. + + 9. You are not required to accept this License, since you have not +signed it. However, nothing else grants you permission to modify or +distribute the Library or its derivative works. These actions are +prohibited by law if you do not accept this License. Therefore, by +modifying or distributing the Library (or any work based on the +Library), you indicate your acceptance of this License to do so, and +all its terms and conditions for copying, distributing or modifying +the Library or works based on it. + + 10. Each time you redistribute the Library (or any work based on the +Library), the recipient automatically receives a license from the +original licensor to copy, distribute, link with or modify the Library +subject to these terms and conditions. You may not impose any further +restrictions on the recipients' exercise of the rights granted herein. +You are not responsible for enforcing compliance by third parties with +this License. + + 11. If, as a consequence of a court judgment or allegation of patent +infringement or for any other reason (not limited to patent issues), +conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot +distribute so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you +may not distribute the Library at all. For example, if a patent +license would not permit royalty-free redistribution of the Library by +all those who receive copies directly or indirectly through you, then +the only way you could satisfy both it and this License would be to +refrain entirely from distribution of the Library. + +If any portion of this section is held invalid or unenforceable under any +particular circumstance, the balance of the section is intended to apply, +and the section as a whole is intended to apply in other circumstances. + +It is not the purpose of this section to induce you to infringe any +patents or other property right claims or to contest validity of any +such claims; this section has the sole purpose of protecting the +integrity of the free software distribution system which is +implemented by public license practices. Many people have made +generous contributions to the wide range of software distributed +through that system in reliance on consistent application of that +system; it is up to the author/donor to decide if he or she is willing +to distribute software through any other system and a licensee cannot +impose that choice. + +This section is intended to make thoroughly clear what is believed to +be a consequence of the rest of this License. + + 12. If the distribution and/or use of the Library is restricted in +certain countries either by patents or by copyrighted interfaces, the +original copyright holder who places the Library under this License may add +an explicit geographical distribution limitation excluding those countries, +so that distribution is permitted only in or among countries not thus +excluded. In such case, this License incorporates the limitation as if +written in the body of this License. + + 13. The Free Software Foundation may publish revised and/or new +versions of the Lesser General Public License from time to time. +Such new versions will be similar in spirit to the present version, +but may differ in detail to address new problems or concerns. + +Each version is given a distinguishing version number. If the Library +specifies a version number of this License which applies to it and +"any later version", you have the option of following the terms and +conditions either of that version or of any later version published by +the Free Software Foundation. If the Library does not specify a +license version number, you may choose any version ever published by +the Free Software Foundation. + + 14. If you wish to incorporate parts of the Library into other free +programs whose distribution conditions are incompatible with these, +write to the author to ask for permission. For software which is +copyrighted by the Free Software Foundation, write to the Free +Software Foundation; we sometimes make exceptions for this. Our +decision will be guided by the two goals of preserving the free status +of all derivatives of our free software and of promoting the sharing +and reuse of software generally. + + NO WARRANTY + + 15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO +WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW. +EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR +OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY +KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE +IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR +PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE +LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME +THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. + + 16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN +WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY +AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU +FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR +CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE +LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING +RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A +FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF +SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH +DAMAGES. + + END OF TERMS AND CONDITIONS + + How to Apply These Terms to Your New Libraries + + If you develop a new library, and you want it to be of the greatest +possible use to the public, we recommend making it free software that +everyone can redistribute and change. You can do so by permitting +redistribution under these terms (or, alternatively, under the terms of the +ordinary General Public License). + + To apply these terms, attach the following notices to the library. It is +safest to attach them to the start of each source file to most effectively +convey the exclusion of warranty; and each file should have at least the +"copyright" line and a pointer to where the full notice is found. + + + Copyright (C) + + This library is free software; you can redistribute it and/or + modify it under the terms of the GNU Lesser General Public + License as published by the Free Software Foundation; either + version 2.1 of the License, or (at your option) any later version. + + This library is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + Lesser General Public License for more details. + + You should have received a copy of the GNU Lesser General Public + License along with this library; if not, write to the Free Software + Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + +Also add information on how to contact you by electronic and paper mail. + +You should also get your employer (if you work as a programmer) or your +school, if any, to sign a "copyright disclaimer" for the library, if +necessary. Here is a sample; alter the names: + + Yoyodyne, Inc., hereby disclaims all copyright interest in the + library `Frob' (a library for tweaking knobs) written by James Random Hacker. + + , 1 April 1990 + Ty Coon, President of Vice + +That's all there is to it! + + diff --git a/PointOfView.hs b/PointOfView.hs deleted file mode 100644 --- a/PointOfView.hs +++ /dev/null @@ -1,104 +0,0 @@ -module PointOfView where - -import Graphics.Rendering.OpenGL -import Graphics.UI.GLUT -import Data.IORef -import System(ExitCode(..), exitWith) -import Data.List (nub) --- import Graphics.UI.GLUT ( Key(SpecialKey, Char) ) - -setPointOfView :: IORef [Key] -> IORef (GLdouble,GLdouble,GLdouble, GLdouble,GLdouble,GLdouble, GLdouble,GLdouble,GLdouble) -> IO () -setPointOfView ks pPos = do - keystate <- get ks - if Char 'w' `elem` keystate then do move_vw pPos 0.01 -- vorward - postRedisplay Nothing - else return() - if Char 's' `elem` keystate then do move_vw pPos (negate 0.01) -- backward - postRedisplay Nothing - else return() - if Char 'a' `elem` keystate then do strafe pPos (0.01) -- left - postRedisplay Nothing - else return() - if Char 'd' `elem` keystate then do strafe pPos (negate 0.01) - postRedisplay Nothing -- right - else return() - if (SpecialKey KeyLeft) `elem` keystate then do rot pPos (0,negate 0.002) - postRedisplay Nothing - else return() - if (SpecialKey KeyRight) `elem` keystate then do rot pPos (0, 0.002) - postRedisplay Nothing - else return() - if (SpecialKey KeyUp) `elem` keystate then do rot pPos (0.002, 0) - postRedisplay Nothing - else return() - if (SpecialKey KeyDown) `elem` keystate then do rot pPos (negate 0.002,0) - postRedisplay Nothing - else return() - (x,y,z,lx,ly,lz,ux,uy,uz) <- get pPos - lookAt (Vertex3 x y z) (Vertex3 lx ly lz) (Vector3 ux uy uz) -- x y z: the point where the viewer is situated - -- lx ly lz: the point at which the viewer is looking - -- ux uy uz: a vector, which is up for the viewer - -keyboard :: IORef [Key] -> Key -> KeyState -> t -> t1 -> IO () -keyboard keystate key ks _ _ = do - case (key,ks) of - (Char '\27',_) -> do exitWith ExitSuccess - (Char 'q',_) -> do exitWith ExitSuccess - (_,Down) -> modifyIORef keystate $ nub . (++[key]) - (_,Up) -> modifyIORef keystate $ filter (/=key) - ---move_vw :: IORef (GLdouble,GLdouble,GLdouble,GLdouble,GLdouble,GLdouble,GLdouble,GLdouble,GLdouble) -> GLdouble -> IO () -move_vw pPos delta = do - (x,y,z,lx,ly,lz,ux,uy,uz) <- get pPos - let dx = (lx-x)*delta - dy = (ly-y)*delta - dz = (lz-z)*delta - pPos $= (x+dx, y+dy, z+dz, lx+dx, ly+dy, lz+dz, ux,uy,uz) - -kreuz (v0,v1,v2) (w0,w1,w2) = (v1*w2-v2*w1, v2*w0-v0*w2, v0*w1-v1*w0) -kreuz2 (v0,v1,v2,pr) (w0,w1,w2,_) = (v1*w2-v2*w1, v2*w0-v0*w2, v0*w1-v1*w0, pr) -set_len (x,y,z) l = (x*c*l, y*c*l, z*c*l) where c = 1 / v_len (x,y,z) -v_len (x,y,z) = sqrt (x*x+y*y+z*z) - -strafe pPos delta = do - (x,y,z,lx,ly,lz,ux,uy,uz) <- get pPos - let (dx, dy, dz) = set_len (kreuz (x-lx,y-ly,z-lz) (ux,uy,uz)) delta - pPos $= (x+dx, y+dy, z+dz, lx+dx, ly+dy, lz+dz, ux,uy,uz) - -divide (x,y,z) c = (x/c, y/c, z/c) -mul (x,y,z) c = (x*c, y*c, z*c) - -rot pPos (alpha, beta) = do - (px,py,pz,lx,ly,lz,ux,uy,uz) <- get pPos - return (set_len (ux,uy,uz) (v_len (lx-px,ly-py,lz-pz))) - let lx_alpha = px + (lx-px)*(cos alpha) + ux*(sin alpha) - ly_alpha = py + (ly-py)*(cos alpha) + uy*(sin alpha) - lz_alpha = pz + (lz-pz)*(cos alpha) + uz*(sin alpha) - ux_alpha = - (lx-px)*(sin alpha) + ux*(cos alpha) - uy_alpha = - (ly-py)*(sin alpha) + uy*(cos alpha) - uz_alpha = - (lz-pz)*(sin alpha) + uz*(cos alpha) - k = (kreuz (lx_alpha-px, ly_alpha-py, lz_alpha-pz) (ux_alpha, uy_alpha, uz_alpha)) - (kx,ky,kz) = (k `divide` (v_len k)) `mul` (v_len (ux, uy, uz)) - - pPos $= (px, py, pz, - px + (lx_alpha-px)*(cos beta) + kx*(sin beta), - py + (ly_alpha-py)*(cos beta) + ky*(sin beta), - pz + (lz_alpha-pz)*(cos beta) + kz*(sin beta), - ux_alpha, uy_alpha, uz_alpha) - -idle pPos = do - postRedisplay Nothing - -reshape screenSize@(Size w h) = do - viewport $= ((Position 0 0), screenSize) - matrixMode $= Projection - loadIdentity - let near = 0.001 - far = 40 - fov = 90 - ang = (fov*pi)/(360) -- equals 45 degree - top = near / ( cos(ang) / sin(ang) ) -- top/near has the same value as 1/(x/y) - aspect = fromIntegral(w)/fromIntegral(h) - right = top*aspect - frustum (-right) right (-top) top near far - matrixMode $= Modelview 0 diff --git a/README b/README --- a/README +++ b/README @@ -1,21 +1,21 @@ -SVGFonts - -This library parses the Font file format SVG fonts which is in XML, so it easy to manipulate by hand. -See http://www.w3.org/TR/SVG/fonts.html -You can convert your favourite font (i.e. .ttf) into a .svg file with fontforge (the menu item under -"Save All"). If a font converted on your own doesn't work, try the repair options, and if this still -doens't work edit the file by hand or even cooler: help me with a patch to make this library more robust. -Remember that a lot of fonts are not allowed to be distributed freely. - -usage: - -The main library file ReadFont.hs parses a .svg xml-file containing font data and returns the outline -of the font as a polygon (a list of Float-pairs). Hole outlines in a letter are inserted in the outer -outline. This enables an easy extrusion. But since extrusion is generally a handy operation it is only -in the example and should be part of another graphics library. To use this library in your code look -at the example which uses the functions read_font and get_glyph_polygon. - -example: - Fonts.hs is an OpenGL program that uses .svg-files in dist/resources to display a string - you can navigate around the 3d string with w,a,s,d, + arrows - +SVGFonts + +This library parses the Font file format SVG fonts which is in XML, so it easy to manipulate by hand. +See http://www.w3.org/TR/SVG/fonts.html +You can convert your favourite font (i.e. .ttf) into a .svg file with fontforge (the menu item under +"Save All"). If a font converted on your own doesn't work, try the repair options, and if this still +doens't work edit the file by hand or even cooler: help me with a patch to make this library more robust. +Remember that a lot of fonts are not allowed to be distributed freely. + +usage: + +The main library file ReadFont.hs parses a .svg xml-file containing font data and returns the outline +of the font as a polygon (a list of Float-pairs). Hole outlines in a letter are inserted in the outer +outline. This enables an easy extrusion. But since extrusion is generally a handy operation it is only +in the example and should be part of another graphics library. To use this library in your code look +at the example which uses the functions read_font and get_glyph_polygon. + +example: + Fonts.hs is an OpenGL program that uses .svg-files in src/Test to display a string + you can navigate around the 3d string with w,a,s,d, + arrows + diff --git a/ReadFont.hs b/ReadFont.hs deleted file mode 100644 --- a/ReadFont.hs +++ /dev/null @@ -1,401 +0,0 @@ -{- - The font data in the svg-file is stored in a glyph-tag, example: - - - d is the path data(lines, bezier-curves, ...). For the syntax of this data see http://www.w3.org/TR/SVG/paths.html#PathData --} -module ReadFont(read_font, get_glyph_polygon, horiz_sum, triang, cycle_neighbours) where - -import Text.XML.Light.Input (parseXML,parseXMLDoc) -import Text.XML.Light.Types -import Text.XML.Light.Proc -import System.IO.Unsafe (unsafePerformIO) -import Text.ParserCombinators.Parsec hiding (spaces) -import Text.ParserCombinators.Parsec.Expr -import qualified Text.ParserCombinators.Parsec.Token as P -import Text.ParserCombinators.Parsec.Language( javaStyle ) -import Data.Char -import Array -import KETTriangulation (ketTri) - -------------------------------------------- --- XML -------------------------------------------- - -read_font :: FilePath -> ([(String, String, String, String)],String) -read_font file = (sort sel4_2 (zip4 (glyph_names, unicodes, horiz, ds)), bbox) -- sort after unicode for binary search later - where xml = parseXML (unsafePerformIO (readFile file)) - select_fontface = concat $ map (findElements named_fontface) (onlyElems xml) - select_glyphs = concat $ map (findElements named_glyph) (onlyElems xml) - bbox = deJust $ head $ map (findAttr named_bbox) select_fontface - glyph_names = map (findAttr named_glyph_name) select_glyphs - unicodes = map (findAttr named_unicode) select_glyphs - horiz = map (findAttr named_horiz_adv) select_glyphs - ds = map (findAttr named_d) select_glyphs - - named_fontface = QName { qName = "font-face", qURI = Nothing, qPrefix = Nothing } - named_bbox = QName { qName = "bbox", qURI = Nothing, qPrefix = Nothing } - named_glyph = QName { qName = "glyph", qURI = Nothing, qPrefix = Nothing } - named_glyph_name = QName { qName = "glyph-name", qURI = Nothing, qPrefix = Nothing } - named_unicode = QName { qName = "unicode", qURI = Nothing, qPrefix = Nothing } - named_horiz_adv = QName { qName = "horiz-adv-x", qURI = Nothing, qPrefix = Nothing } - named_d = QName { qName = "d", qURI = Nothing, qPrefix = Nothing } - sort f [] = [] - sort f (x:xs) = (sort f [l | l <- xs, (compare (f l) (f x)) == LT ]) ++ [x] ++ - (sort f [r | r <- xs, (compare (f r) (f x)) == GT ]) - - zip4 ([],_,_,_) = [] - zip4 (_,[],_,_) = [] - zip4 (_,_,[],_) = [] - zip4 (_,_,_,[]) = [] - zip4 (a:as, b:bs, c:cs, d:ds) = (deJust a, deJust b, deJust c, deJust d) : (zip4 (as,bs,cs,ds)) - deJust Nothing = "" - deJust (Just x) = x - -sel3_1 (a,b,c) = a -sel3_2 (a,b,c) = b -sel3_3 (a,b,c) = c -sel4_1 (a,b,c,d) = a -sel4_2 (a,b,c,d) = b -sel4_3 (a,b,c,d) = c -sel4_4 (a,b,c,d) = d - -------------------------------------------- --- parsing of the path-field (d="") -------------------------------------------- -type X = Float -type Y = Float -type F2 = (X,Y) -type Svg_glyph = [(String, String, String, String)] -type Tup = (X,Y) -type X1 = X -type Y1 = Y -type X2 = X -type Y2 = Y -data GlyphCommand = M_abs Tup | M_rel Tup | -- establish a new current point (with absolute coords or rel. to the current point) - Z | -- Close current subpath by drawing a straight line from current point to current subpath's initial point - L_abs Tup | L_rel Tup | -- a line from the current point to Tup which becomes the new current point - H_abs X | H_rel X | -- a horizontal line from the current point (cpx, cpy) to (x, cpy) - V_abs Y | V_rel Y | -- a vertical line from the current point (cpx, cpy) to (cpx, y) - C_abs (X1,Y1,X2,Y2,X,Y) | -- Draws a cubic Bézier curve from the current point to (x,y) using (x1,y1) as the - -- control point at the beginning of the curve and (x2,y2) as the control point at the end of the curve. - C_rel (X1,Y1,X2,Y2,X,Y) | - S_abs (X2,Y2,X,Y) | -- Draws a cubic Bézier curve from the current point to (x,y). The first control point is --- assumed to be the reflection of the second control point on the previous command relative to the current point. (If there is --- no previous command or if the previous command was not an C, c, S or s, assume the first control point is coincident with the --- current point.) (x2,y2) is the second control point (i.e., the control point at the end of the curve). - S_rel (X2,Y2,X,Y) | - Q_abs (X1,Y1,X,Y) | -- a quadr. Bézier curve from the curr. point to (x,y) using (x1,y1) as the control point - Q_rel (X1,Y1,X,Y) | -- nearly the same as cubic, but with one point less - T_abs Tup | T_rel Tup | A_abs | A_rel -- T_Abs = Shorthand/smooth quadratic Bézier curveto, A = elliptic arc - -glyphFromString :: String -> IO [GlyphCommand] -glyphFromString str - = do{ case (parse glyph_path "" str) of - Left err -> do{ putStr "parse error at " - ; print err - ; return [] - } - Right x -> return x - } - -spaces = skipMany space - -glyph_path :: Parser [GlyphCommand] -glyph_path = do{ whiteSpace - ; l <- many1 glyph_element - ; eof - ; return (concat l) - } - -glyph_element :: Parser [GlyphCommand] -glyph_element = do{ whiteSpace; - do{ symbol "M"; l <- many1 tupel2; return (map (\x-> M_abs x) l) } <|> - do{ symbol "m"; l <- many1 tupel2; return (map (\x-> M_rel x) l) } <|> - do{ symbol "z"; return [Z]; } <|> - do{ symbol "L"; l <- many1 tupel2; return (map (\x-> L_abs x) l) } <|> - do{ symbol "l"; l <- many1 tupel2; return (map (\x-> L_rel x) l) } <|> - do{ symbol "H"; l <- many1 integer; return (map (\x-> H_abs (fromIntegral x)) l) } <|> - do{ symbol "h"; l <- many1 integer; return (map (\x-> H_rel (fromIntegral x)) l) } <|> - do{ symbol "V"; l <- many1 integer; return (map (\x-> V_abs (fromIntegral x)) l) } <|> - do{ symbol "v"; l <- many1 integer; return (map (\x-> V_rel (fromIntegral x)) l) } <|> - do{ symbol "C"; l <- many1 tupel6; return (map (\x-> C_abs x) l) } <|> - do{ symbol "c"; l <- many1 tupel6; return (map (\x-> C_rel x) l) } <|> - do{ symbol "S"; l <- many1 tupel4; return (map (\x-> S_abs x) l) } <|> - do{ symbol "s"; l <- many1 tupel4; return (map (\x-> S_rel x) l) } <|> - do{ symbol "Q"; l <- many1 tupel4; return (map (\x-> Q_abs x) l) } <|> - do{ symbol "q"; l <- many1 tupel4; return (map (\x-> Q_rel x) l) } <|> - do{ symbol "T"; l <- many1 tupel2; return (map (\x-> T_abs x) l) } <|> - do{ symbol "t"; l <- many1 tupel2; return (map (\x-> T_rel x) l) } <|> - do{ symbol "A"; l <- many1 tupel2; return (map (\x-> A_abs) l) } <|> -- not used - do{ symbol "a"; l <- many1 tupel2; return (map (\x-> A_rel) l) } -- not used - } - -tupel2 :: Parser (X,Y) -tupel2 = do{ x <- myfloat; spaces; y <- myfloat; spaces; - ; return (realToFrac x, realToFrac y) - } - -tupel4 :: Parser (X,Y,X,Y) -tupel4 = do{ x1 <- myfloat; spaces; y1 <- myfloat; spaces; x <- myfloat; spaces; y <- myfloat; spaces; - ; return (realToFrac x1, realToFrac y1, realToFrac x, realToFrac y) - } - -tupel6 :: Parser (X,Y,X,Y,X,Y) -tupel6 = do{ x1 <- myfloat; spaces; y1 <- myfloat; spaces; - x2 <- myfloat; spaces; y2 <- myfloat; spaces; x <- myfloat; spaces; y <- myfloat; spaces; - ; return (realToFrac x1, realToFrac y1, realToFrac x2, realToFrac y2, realToFrac x, realToFrac y) - } - -myfloat = try (do{ symbol "-"; n <- float; return (negate n) }) <|> - try float <|> -- 0 is not recognized as a float, so recognize it as an integer and then convert it to float - do { i<-integer; return(fromIntegral i) } ------------------------------------------------------------ -lexer = P.makeTokenParser oDef -oDef = javaStyle - { - P.commentLine = "#" - } - -whiteSpace = P.whiteSpace lexer -symbol = P.symbol lexer -integer = P.integer lexer -float = P.float lexer - -------------------------------------------- --- path-commands to points -------------------------------------------- --- to do: use a state monad to avoid recalculation -horiz_sum :: String -> Svg_glyph -> Int -horiz_sum str glyph = sum (map (\ch -> (ha ch) ) str) - where hlist = map sel4_3 glyph -- list of all advances - a = array (0,length hlist) [(i, head (drop i hlist)) | i <- [0..(length hlist)]] - ha_string ch = sel4_3 (binary_search [ch] sel4_2 glyph 0 (length glyph)) - ha ch | (length (ha_string ch))>0 = read (ha_string ch) - | otherwise = 0 -- advance in horiz.-direction for next glyph - -commands_to_points :: [GlyphCommand] -> [F2] -> F2 -> Int -> Float -> [[F2]] -commands_to_points [] _ _ _ _ = [] -commands_to_points (c:commands) points last_contr p max_h - | (length next_points) == 0 = [ tail points ] ++ (commands_to_points commands next_points (contr c) p max_h) - | otherwise = commands_to_points commands (points ++ next_points) (contr c) p max_h - where next_points = go c - contr ( C_abs (x1,y1,x2,y2,x,y) ) = ( x+x-x2, y+y-y2 ) -- control point of bezier curve - contr ( C_rel (x1,y1,x2,y2,x,y) ) = (x0+x+x-x2, y0+y+y-y2 ) - contr ( S_abs (x2,y2,x,y) ) = ( x+x-x2, y+y-y2 ) - contr ( S_rel (x2,y2,x,y) ) = (x0+x+x-x2, y0+y+y-y2 ) - contr ( Q_abs (x1,y1,x,y) ) = ( x+x-x1, y+y-y1 ) - contr ( Q_rel (x1,y1,x,y) ) = (x0+x+x-x1, y0+y+y-y1 ) - contr ( T_abs (x,y) ) = ( x+x-cx, y+y-cy ) - contr ( T_rel (x,y) ) = (x0+x+(x0+x)-cx, y0+y+(y0+y)-cy ) -- absolute coordinates - contr ( L_abs (x,y) ) = ( x, y) - contr ( L_rel (x,y) ) = (x0 + x, y0 + y) - contr ( M_abs (x,y) ) = ( x, y) - contr ( M_rel (x,y) ) = (x0 + x, y0 + y) - contr ( H_abs x ) = ( x, y0 ) - contr ( H_rel x ) = (x0 + x, y0 ) - contr ( V_abs y ) = (x0, y ) - contr ( V_rel y ) = (x0, y0 + y ) - go ( L_abs (x,y) ) = [(x,y)] - go ( L_rel (x,y) ) = [(x0+x, y0+y)] - go ( M_abs (x,y) ) = [(x, y)] - go ( M_rel (x,y) ) = [(x0+x, y0+y)] - go ( H_abs x) = [(x, y0)] - go ( H_rel x) = [(x0+x, y0)] - go ( V_abs y) = [(x0, y )] - go ( V_rel y) = [(x0, y0+y)] - go ( C_abs (x1,y1,x2,y2,x,y) ) = bCurve (bez x y) [(x0, y0), (x1, y1), (x2, y2), (x, y) ] - go ( C_rel (x1,y1,x2,y2,x,y) ) = bCurve (bez x y) [(x0, y0), (x0+x1,y0+y1), (x0+x2,y0+y2), (x0+x,y0+y)] - go ( S_abs ( x2,y2,x,y) ) = bCurve (bez x y) [(x0, y0), (cx, cy), (x2, y2), (x, y) ] - go ( S_rel ( x2,y2,x,y) ) = bCurve (bez x y) [(x0, y0), (cx, cy), (x0+x2,y0+y2), (x0+x,y0+y)] - go ( Q_abs (x1,y1,x,y) ) = bCurve (bez x y) [(x0, y0), (x1, y1), (x, y)] - go ( Q_rel (x1,y1,x,y) ) = bCurve (bez x y) [(x0, y0), (x0+x1, y0+y1), (x0+x, y0+y)] - go ( T_abs (x,y) ) = bCurve (bez x y) [(x0,y0), (cx, cy), (x, y) ] - go ( T_rel (x,y) ) = bCurve (bez x y) [(x0,y0), (cx, cy), (x0+x,y0+y)] - go ( Z ) = [] - bez xd yd = p -- round ((fromIntegral p) * (sqrt ((xd-x0)*(xd-x0) + (yd-y0)*(yd-y0))) / max_h) -- not better - x0 = fst (last points) - y0 = snd (last points) - cx = (fst last_contr) -- last control point is always in absolute coordinates - cy = (snd last_contr) - ---------------------------------------------------- --- bezier-curves (inspired by wikipedia article) ---------------------------------------------------- --- linearInterp:: Float -> F2 -> F2 -> F2 -linearInterp t (x0,y0) (x1,y1) = ( (1-t)*x0 + t*x1, (1-t)*y0 + t*y1) - --- eval:: Float -> [F2] -> [F2] -eval t (bi:bj:[]) = [linearInterp t bi bj] -eval t (bi:bj:bs) = (linearInterp t bi bj) : (eval t (bj:bs)) - --- deCas:: Float -> [F2] -> F2 -deCas t (bi:[]) = bi -deCas t bs = deCas t (eval t bs) - --- bCurve:: Int -> [F2] -> [F2] -bCurve n b = tail [deCas (fromIntegral x/fromIntegral n) b | x<- [0..n]] - ---------------------------------------------------- --- transform a polygon with (nested) holes into one outline --- i.e. the letters a,b,d,e,g,o,p,q contain holes tat have to be deleted ---------------------------------------------------- -data Tree = Node Int [F2] [Tree] | Nil -- c is the nesting counter and p a polygon - -instance Show Tree where - show (Node c p tree) = "Node" ++ (show c) ++ (show (length p)) ++ "[" ++ (concat(map show tree)) ++ "]" - show (Nil) = "Nil" - -delete_holes :: [GlyphCommand] -> Int -> Float -> [[F2]] -delete_holes commands bez max_h = flatten trees -- trace (show trees) - where trees = generate_trees inside_poly (commands_to_points commands [(0,0)] (0,0) bez max_h) - flatten [] = [] - flatten (Nil:ts) = flatten ts - flatten ((Node c poly [Nil]):ts) = (direction c (polygon_direction poly) poly) : (flatten ts) - flatten ((Node c poly ps) :ts) = ( embed (flatten ps) (direction c (polygon_direction poly) poly) ) : (flatten ts) - -embed :: [[F2]] -> [F2] -> [F2] -embed [] poly = poly -embed (s:sub_polys) poly = embed sub_polys ((take (n+1) poly) ++ s ++ (drop n poly)) - where n = fst (rotate_poly (head s) poly) - -direction :: Int -> Bool -> [F2] -> [F2] -direction c b poly | (b && (even c)) || (not b && (odd c)) = poly - | otherwise = reverse poly - --- f should be the funtion to test "contains" --- the trees then are the hierarchy of containedness of outlines -generate_trees :: ([F2]->[F2]->Bool) -> [[F2]] -> [Tree] -generate_trees f [] = [] -generate_trees f ps = merge_nodes f (map (\p -> Node 0 p []) ps) [] - -merge_nodes :: ([F2]->[F2]->Bool) -> [Tree] -> [Tree] -> [Tree] -merge_nodes f [] result = result -merge_nodes f (v:vs) result = merge_nodes f vs (insert_node f v result) - -insert_node :: ([F2]->[F2]->Bool) -> Tree -> [Tree] -> [Tree] -insert_node f (Node _ poly []) ((Node c p []):ts)|(f poly p)= (Node c p [Node (c+1) poly []]) : ts - |(f p poly)= (Node c poly [Node (c+1) p []]) : ts - |otherwise = (Node c p []) : ( insert_node f (Node (c+1) poly []) ts) -insert_node f (Node c poly []) [] = [(Node c poly [])] -insert_node f (Node _ poly []) ((Node c p ps):ts)|(f poly p) = (Node c p (insert_node f (Node (c+1) poly []) ps)) : ts - |(f p poly) = [Node (c-1) poly ((Node c p ps) : ts)] - |otherwise = (Node c p ps): ( insert_node f (Node c poly []) ts) - --- how many positions to rotate a polygon until the start point is nearest to some other point --- call i.e. with nearest (3,4) [(0,0),(1,2), ... ] 0 0 -rotate_poly :: F2 -> [F2] -> (Int,X) -rotate_poly p points = (fst tup, snd tup) - where tup = nearest p points (-1) 0 0 - -nearest :: F2 -> [F2] -> X -> Int -> Int -> (Int,X) -nearest _ [] dist l ml = (ml,dist) -nearest (x0,y0) ((x1,y1):ps) dist l ml | (new_dist < dist) || (dist < 0) = nearest (x0,y0) ps new_dist (l+1) l - | otherwise = nearest (x0,y0) ps dist (l+1) ml - where new_dist = (x0-x1)*(x0-x1)+(y0-y1)*(y0-y1) - ---------------------------------------------------- --- general algorithms for various applications ---------------------------------------------------- --- the direction of a polygon can be determined by taking the right-/upmost point and calculating the --- crossproduct of the two adjacent points -polygon_direction :: [F2] -> Bool -polygon_direction [] = False -polygon_direction poly | (crossp (p1 `sub` p0) (p1 `sub` p2) ) > 0 = True - | otherwise = False - where l = maxim poly 0 0 0 0 - lp = length poly - p0 = position (l-1) poly - p1 = position l poly - p2 = position (l+1) poly - position l poly = head (drop (l `mod` lp) poly) - sub (x0,y0) (x1,y1) = (x0-x1, y0-y1) - crossp (v0,v1) (w0,w1) = v0*w1-v1*w0 - -- the index of the right-/upmost point - maxim [] l ml mx my = ml - maxim (x:xs) l ml mx my | ((fst x) > mx) && ((snd x) >= my) = maxim xs (l+1) l (fst x) (snd x) - | otherwise = maxim xs (l+1) ml mx my - -inside_poly :: [F2] -> [F2] -> Bool -inside_poly [] _ = False -inside_poly _ [] = False -inside_poly poly1 poly2 = point_inside (head poly1) poly2 - --- point_inside: A point that is inside a polygon if it has an odd number of intersections with the boundary (Jordan Curve theorem) --- to do: find the error -point_inside :: F2 -> [F2] -> Bool -point_inside (x,y) poly = (length intersect_pairs) `mod` 2 == 1 -- trace (show intersect_pairs) - where intersect_pairs = [ p | p <- all_pairs, positive_x_axis p, above_below p] --, special_cases p] - all_pairs = cycle_neighbours poly - positive_x_axis p = (x0 p) > x || (x1 p) > x -- intersect with positive x-axis - -- only lines with one point above + one point below can intersect - above_below p = (((y0 p)> y && (y1 p)< y) || ((y0 p) < y && (y1 p) > y)) - special_cases p = (((dir1 p) > 0 && (dir2 p) <= 0) || ((dir1 p) <= 0 && (dir2 p) > 0)) -- cross product for special cases - dir1 p = cross ((x1 p)-(x0 p),(y1 p)-(y0 p)) (1,0) - dir2 p = cross ((x1 p)-(x0 p),(y1 p)-(y0 p)) (x-(x0 p),y-(y0 p)) - cross (a0,b0) (a1,b1) = a0*b1 - a1*b0 - x0 p = fst (head p) - x1 p = fst (last p) - y0 p = snd (head p) - y1 p = snd (last p) - --- return a list containing lists of every element with its neighbour --- i.e. [e1,e2,e3] -> [ [e1,e2], [e2,e3], [e3, e1] ] -cycle_neighbours :: [a] -> [[a]] -cycle_neighbours [] = [] -cycle_neighbours xs = cycle_n (head xs) xs - -cycle_n :: a -> [a] -> [[a]] -cycle_n f (x:y:xs) = [x,y] : (cycle_n f (y:xs)) -cycle_n f e = [[head e, f ]] -- if the upper doesn't match close cycle - -qsort f [] = [] -qsort f (x:xs) = (qsort f [l | l <- xs, (f l)<=(f x)]) ++ [x] ++ (qsort f [r | r <- xs, (f r) > (f x)]) - -triang :: [(X,Y)] -> [(Int,Int,Int)] -triang poly = ketTri poly -- to do: try O(n(1+t0)) from Toussaint (already implemented by Joern Dinkla) - --- The idea: the three sides of the triangle are represented by vectors in one direction around the triangle. --- For every vector the crossprodukt divides the plane into two regions. --- The intersection of the three regions is the inner area -inside_triangle :: Array Int (X,Y) -> Int -> Int -> Int -> (X,Y,Int,Int) -> Bool -inside_triangle parray a b c p = -- trace ("in" ++ show a ++ show b ++ show c ++ show (parray!a) ++ show (parray!b) ++ show (parray!c) ++ show p ++ show ((aCROSSbp <= 0) && (bCROSScp <= 0) && (cCROSSap <= 0))) - ((aCROSSbp <= 0) && (bCROSScp <= 0) && (cCROSSap <= 0)) - where (aax,aay) = parray!a - (bbx,bby) = parray!b - (ccx,ccy) = parray!c - (px,py) = parray!(sel4_3 p) - - (ax,ay) = (ccx-bbx, ccy-bby) - (bx,by) = (aax-ccx, aay-ccy) - (cx,cy) = (bbx-aax, bby-aay) - (apx,apy) = (px-aax, py-aay) - (bpx,bpy) = (px-bbx, py-bby) - (cpx,cpy) = (px-ccx, py-ccy) - aCROSSbp = ax*bpy - ay*bpx; - cCROSSap = cx*apy - cy*apx; - bCROSScp = bx*cpy - by*cpx; - --------------------------- --- main library function, together with read_font which produces the Svg_glyph-type needed for this function --------------------------- -get_glyph_polygon :: Char -> Svg_glyph -> Int -> Float -> ([[F2]], X,[[ (Int,Int,Int) ]]) -get_glyph_polygon ch glyph bez max_h = (outline, ha, map triang outline) -- the triangulation is a list of triangles(3 indices) - where d = sel4_4 array_element -- ie. a letter like 'i' consists of two lists of triangles - ha_string = sel4_3 array_element - ha | (length ha_string)>0 = read (sel4_3 array_element) -- how much to advance in the horiz.-direction for the next glyph - | otherwise = 0 - array_element = binary_search [ch] sel4_2 glyph 0 (length glyph) - outl = delete_holes commands bez max_h -- bez is the # of points in a bezier-curve - outline = map (\o -> direction 0 (polygon_direction o) o) outl - commands | (length d) == 0 = [] - | otherwise = unsafePerformIO ( glyphFromString d ) - -binary_search ch f glyph left right | compare ch s == EQ = head (drop ((left+right)`div`2) glyph ) - | compare ch s == LT = binary_search ch f glyph left ((left+right)`div`2) - | compare ch s == GT = binary_search ch f glyph ((left+right)`div`2) right - | otherwise = head glyph - where s = f (head (drop ((left+right)`div`2) glyph )) - diff --git a/SVGFonts.cabal b/SVGFonts.cabal --- a/SVGFonts.cabal +++ b/SVGFonts.cabal @@ -1,13 +1,27 @@ -Name: SVGFonts -Version: 0.1 +Name: SVGFonts +Version: 0.2 Description: parse svg-font files and generate outlines of letters and sentences -License: GPL -License-file: LICENSE -Author: Tillmann Vogt -Maintainer: Tillmann.Vogt@rwth-aachen.de -Build-Type: Simple -Cabal-Version: >=1.2 +category: graphics +License: GPL +License-file: LICENSE +Author: Tillmann Vogt +Maintainer: Tillmann.Vogt@rwth-aachen.de +Build-Type: Simple +Cabal-Version: >=1.2 +Library + hs-source-dirs: src + build-depends: + haskell98, + base, + OpenGL, + GLUT, + xml, + parsec + exposed-modules: + Graphics.SVGFonts.ReadFont Graphics.SVGFonts.KETTriangulation + Executable Fonts - Main-is: test/Fonts.hs - Build-Depends: haskell98, base, OpenGL, GLUT, xml, parsec + hs-source-dirs: src + Main-is: Test/Fonts.hs + other-modules: Test.PointOfView, Graphics.SVGFonts.ReadFont diff --git a/Setup.hs b/Setup.hs --- a/Setup.hs +++ b/Setup.hs @@ -1,3 +1,3 @@ -#!/usr/bin/env runhaskell -import Distribution.Simple +#!/usr/bin/env runhaskell +import Distribution.Simple main = defaultMain diff --git a/TODO b/TODO --- a/TODO +++ b/TODO @@ -1,6 +1,6 @@ -TO DO: - --- Faster triangulation O(n(1+t0)) instead of O(k*n) --- avoid recalculation (memoization? ) --- find error in point_inside --- bezier subdivision (faster), calculate length of curve-segments for better subdivision +TO DO: + +-- Faster triangulation O(n(1+t0)) instead of O(k*n) +-- avoid recalculation (memoization? ) +-- find error in point_inside +-- bezier subdivision (faster), calculate length of curve-segments for better subdivision diff --git a/src/Graphics/SVGFonts/KETTriangulation.hs b/src/Graphics/SVGFonts/KETTriangulation.hs new file mode 100644 --- /dev/null +++ b/src/Graphics/SVGFonts/KETTriangulation.hs @@ -0,0 +1,75 @@ +-------------------------------------------------------------------------------- +-- Copyright (C) 1997, 1998, 2008 Joern Dinkla, www.dinkla.net +-------------------------------------------------------------------------------- +-- +-- see +-- Joern Dinkla, Geometrische Algorithmen in Haskell, Diploma Thesis, +-- University of Bonn, Germany, 1998. +-- +-- triangulation of simple polygons after Kong, Everett, Toussaint 91 +-- with some changes by T.Vogt: return indices instead of coordinates of triangles + +module Graphics.SVGFonts.KETTriangulation (ketTri) where +import List ( (\\) ) + +type XYI = (Float,Float,Int) + +ketTri :: [(Float,Float)] -> [(Int,Int,Int)] +ketTri poly = scan vs stack rs + where ps@(p1:p2:p3:qs) = vertices poly + vs = qs ++ [p1] + stack = [p3, p2, p1, last ps] + rs = reflexVertices ps + +scan :: [XYI] -> [XYI] -> [XYI] -> [(Int,Int,Int)] +scan [] _ _ = [] +scan [v] [x_p, x_i, _, _] rs = [(sel3_3 x_i, sel3_3 x_p, sel3_3 v)] +scan (v:vs) ss@[_,_,_] rs = scan vs (v:ss) rs +scan vs@(v:vs') ss@(x_p:x_i:ss'@(x_m:x_mm:xs)) rs + | isEar rs x_m x_i x_p = (sel3_3 x_m, sel3_3 x_i, sel3_3 x_p) : scan vs (x_p:ss') rs' + | otherwise = scan vs' (v:ss) rs + where rs' = rs \\ (isConvex x_m x_p v ++ isConvex x_mm x_m x_p) + isConvex im i ip = if isLeftTurn im i ip then [i] else [] + +isEar :: [XYI] -> XYI -> XYI -> XYI -> Bool +isEar [] _ _ _ = True +isEar rs m x p = isLeftTurn m x p && not (any ( (m,x,p) `containsBNV`) rs) + +reflexVertices :: [XYI] -> [XYI] +reflexVertices xs = [ x | (m,x,p) <- angles xs, isRightTurnOrOn m x p ] + +isRightTurnOrOn m x p = (area2 m x p) <= 0 +isLeftTurn m x p = (area2 m x p) > 0 +area2 (x2,y2,_) (x0,y0,_) (x1,y1,_) = (x1-x0)*(y2-y0)-(x2-x0)*(y1-y0) + +containsBNV (s,t,v) p = (a==b && b==c) + where a = isLeftTurn s t p + b = isLeftTurn t v p + c = isLeftTurn v s p + +angles :: [a] -> [(a,a,a)] +angles xs = zip3 (rotateR xs) xs (rotateL xs) + +rotateL xs = tail xs ++ [head xs] +rotateR xs = [last xs] ++ init xs +sel3_1 (x,y,z) = x +sel3_2 (x,y,z) = y +sel3_3 (x,y,z) = z + +-- make vertices of polygon counterclockwise and add an index +vertices :: [(Float,Float)] -> [XYI] +vertices qs | polygon_direction ps = ps + | otherwise = reverse ps + where ps = zipWith (\(x,y) z -> (x,y,z) ) qs [0..] + +-- the direction (clockwise or counterclockwise) of a polygon can be obtained by looking at a maximal point +polygon_direction :: [XYI] -> Bool +polygon_direction poly = isLeftTurn (p (l-1) poly) (p l poly) (p (l+1) poly) + where p l poly = head (drop (l `mod` lp) poly) + l = maxim poly 0 0 0 0 + lp = length poly + -- the index of the right-/upmost point + maxim [] l ml mx my = ml + maxim (x:xs) l ml mx my | ((sel3_1 x) > mx) && ((sel3_2 x) >= my) = maxim xs (l+1) l (sel3_1 x) (sel3_2 x) + | otherwise = maxim xs (l+1) ml mx my + diff --git a/src/Graphics/SVGFonts/ReadFont.hs b/src/Graphics/SVGFonts/ReadFont.hs new file mode 100644 --- /dev/null +++ b/src/Graphics/SVGFonts/ReadFont.hs @@ -0,0 +1,401 @@ +{- + The font data in the svg-file is stored in a glyph-tag, example: + + + d is the path data(lines, bezier-curves, ...). For the syntax of this data see http://www.w3.org/TR/SVG/paths.html#PathData +-} +module Graphics.SVGFonts.ReadFont(read_font, get_glyph_polygon, horiz_sum, triang, cycle_neighbours) where + +import Text.XML.Light.Input (parseXML,parseXMLDoc) +import Text.XML.Light.Types +import Text.XML.Light.Proc +import System.IO.Unsafe (unsafePerformIO) +import Text.ParserCombinators.Parsec hiding (spaces) +import Text.ParserCombinators.Parsec.Expr +import qualified Text.ParserCombinators.Parsec.Token as P +import Text.ParserCombinators.Parsec.Language( javaStyle ) +import Data.Char +import Array +import Graphics.SVGFonts.KETTriangulation (ketTri) + +------------------------------------------- +-- XML +------------------------------------------- + +read_font :: FilePath -> ([(String, String, String, String)],String) +read_font file = (sort sel4_2 (zip4 (glyph_names, unicodes, horiz, ds)), bbox) -- sort after unicode for binary search later + where xml = parseXML (unsafePerformIO (readFile file)) + select_fontface = concat $ map (findElements named_fontface) (onlyElems xml) + select_glyphs = concat $ map (findElements named_glyph) (onlyElems xml) + bbox = deJust $ head $ map (findAttr named_bbox) select_fontface + glyph_names = map (findAttr named_glyph_name) select_glyphs + unicodes = map (findAttr named_unicode) select_glyphs + horiz = map (findAttr named_horiz_adv) select_glyphs + ds = map (findAttr named_d) select_glyphs + + named_fontface = QName { qName = "font-face", qURI = Nothing, qPrefix = Nothing } + named_bbox = QName { qName = "bbox", qURI = Nothing, qPrefix = Nothing } + named_glyph = QName { qName = "glyph", qURI = Nothing, qPrefix = Nothing } + named_glyph_name = QName { qName = "glyph-name", qURI = Nothing, qPrefix = Nothing } + named_unicode = QName { qName = "unicode", qURI = Nothing, qPrefix = Nothing } + named_horiz_adv = QName { qName = "horiz-adv-x", qURI = Nothing, qPrefix = Nothing } + named_d = QName { qName = "d", qURI = Nothing, qPrefix = Nothing } + sort f [] = [] + sort f (x:xs) = (sort f [l | l <- xs, (compare (f l) (f x)) == LT ]) ++ [x] ++ + (sort f [r | r <- xs, (compare (f r) (f x)) == GT ]) + + zip4 ([],_,_,_) = [] + zip4 (_,[],_,_) = [] + zip4 (_,_,[],_) = [] + zip4 (_,_,_,[]) = [] + zip4 (a:as, b:bs, c:cs, d:ds) = (deJust a, deJust b, deJust c, deJust d) : (zip4 (as,bs,cs,ds)) + deJust Nothing = "" + deJust (Just x) = x + +sel3_1 (a,b,c) = a +sel3_2 (a,b,c) = b +sel3_3 (a,b,c) = c +sel4_1 (a,b,c,d) = a +sel4_2 (a,b,c,d) = b +sel4_3 (a,b,c,d) = c +sel4_4 (a,b,c,d) = d + +------------------------------------------- +-- parsing of the path-field (d="") +------------------------------------------- +type X = Float +type Y = Float +type F2 = (X,Y) +type Svg_glyph = [(String, String, String, String)] +type Tup = (X,Y) +type X1 = X +type Y1 = Y +type X2 = X +type Y2 = Y +data GlyphCommand = M_abs Tup | M_rel Tup | -- establish a new current point (with absolute coords or rel. to the current point) + Z | -- Close current subpath by drawing a straight line from current point to current subpath's initial point + L_abs Tup | L_rel Tup | -- a line from the current point to Tup which becomes the new current point + H_abs X | H_rel X | -- a horizontal line from the current point (cpx, cpy) to (x, cpy) + V_abs Y | V_rel Y | -- a vertical line from the current point (cpx, cpy) to (cpx, y) + C_abs (X1,Y1,X2,Y2,X,Y) | -- Draws a cubic Bézier curve from the current point to (x,y) using (x1,y1) as the + -- control point at the beginning of the curve and (x2,y2) as the control point at the end of the curve. + C_rel (X1,Y1,X2,Y2,X,Y) | + S_abs (X2,Y2,X,Y) | -- Draws a cubic Bézier curve from the current point to (x,y). The first control point is +-- assumed to be the reflection of the second control point on the previous command relative to the current point. (If there is +-- no previous command or if the previous command was not an C, c, S or s, assume the first control point is coincident with the +-- current point.) (x2,y2) is the second control point (i.e., the control point at the end of the curve). + S_rel (X2,Y2,X,Y) | + Q_abs (X1,Y1,X,Y) | -- a quadr. Bézier curve from the curr. point to (x,y) using (x1,y1) as the control point + Q_rel (X1,Y1,X,Y) | -- nearly the same as cubic, but with one point less + T_abs Tup | T_rel Tup | A_abs | A_rel -- T_Abs = Shorthand/smooth quadratic Bézier curveto, A = elliptic arc + +glyphFromString :: String -> IO [GlyphCommand] +glyphFromString str + = do{ case (parse glyph_path "" str) of + Left err -> do{ putStr "parse error at " + ; print err + ; return [] + } + Right x -> return x + } + +spaces = skipMany space + +glyph_path :: Parser [GlyphCommand] +glyph_path = do{ whiteSpace + ; l <- many1 glyph_element + ; eof + ; return (concat l) + } + +glyph_element :: Parser [GlyphCommand] +glyph_element = do{ whiteSpace; + do{ symbol "M"; l <- many1 tupel2; return (map (\x-> M_abs x) l) } <|> + do{ symbol "m"; l <- many1 tupel2; return (map (\x-> M_rel x) l) } <|> + do{ symbol "z"; return [Z]; } <|> + do{ symbol "L"; l <- many1 tupel2; return (map (\x-> L_abs x) l) } <|> + do{ symbol "l"; l <- many1 tupel2; return (map (\x-> L_rel x) l) } <|> + do{ symbol "H"; l <- many1 integer; return (map (\x-> H_abs (fromIntegral x)) l) } <|> + do{ symbol "h"; l <- many1 integer; return (map (\x-> H_rel (fromIntegral x)) l) } <|> + do{ symbol "V"; l <- many1 integer; return (map (\x-> V_abs (fromIntegral x)) l) } <|> + do{ symbol "v"; l <- many1 integer; return (map (\x-> V_rel (fromIntegral x)) l) } <|> + do{ symbol "C"; l <- many1 tupel6; return (map (\x-> C_abs x) l) } <|> + do{ symbol "c"; l <- many1 tupel6; return (map (\x-> C_rel x) l) } <|> + do{ symbol "S"; l <- many1 tupel4; return (map (\x-> S_abs x) l) } <|> + do{ symbol "s"; l <- many1 tupel4; return (map (\x-> S_rel x) l) } <|> + do{ symbol "Q"; l <- many1 tupel4; return (map (\x-> Q_abs x) l) } <|> + do{ symbol "q"; l <- many1 tupel4; return (map (\x-> Q_rel x) l) } <|> + do{ symbol "T"; l <- many1 tupel2; return (map (\x-> T_abs x) l) } <|> + do{ symbol "t"; l <- many1 tupel2; return (map (\x-> T_rel x) l) } <|> + do{ symbol "A"; l <- many1 tupel2; return (map (\x-> A_abs) l) } <|> -- not used + do{ symbol "a"; l <- many1 tupel2; return (map (\x-> A_rel) l) } -- not used + } + +tupel2 :: Parser (X,Y) +tupel2 = do{ x <- myfloat; spaces; y <- myfloat; spaces; + ; return (realToFrac x, realToFrac y) + } + +tupel4 :: Parser (X,Y,X,Y) +tupel4 = do{ x1 <- myfloat; spaces; y1 <- myfloat; spaces; x <- myfloat; spaces; y <- myfloat; spaces; + ; return (realToFrac x1, realToFrac y1, realToFrac x, realToFrac y) + } + +tupel6 :: Parser (X,Y,X,Y,X,Y) +tupel6 = do{ x1 <- myfloat; spaces; y1 <- myfloat; spaces; + x2 <- myfloat; spaces; y2 <- myfloat; spaces; x <- myfloat; spaces; y <- myfloat; spaces; + ; return (realToFrac x1, realToFrac y1, realToFrac x2, realToFrac y2, realToFrac x, realToFrac y) + } + +myfloat = try (do{ symbol "-"; n <- float; return (negate n) }) <|> + try float <|> -- 0 is not recognized as a float, so recognize it as an integer and then convert it to float + do { i<-integer; return(fromIntegral i) } +----------------------------------------------------------- +lexer = P.makeTokenParser oDef +oDef = javaStyle + { + P.commentLine = "#" + } + +whiteSpace = P.whiteSpace lexer +symbol = P.symbol lexer +integer = P.integer lexer +float = P.float lexer + +------------------------------------------- +-- path-commands to points +------------------------------------------- +-- to do: use a state monad to avoid recalculation +horiz_sum :: String -> Svg_glyph -> Int +horiz_sum str glyph = sum (map (\ch -> (ha ch) ) str) + where hlist = map sel4_3 glyph -- list of all advances + a = array (0,length hlist) [(i, head (drop i hlist)) | i <- [0..(length hlist)]] + ha_string ch = sel4_3 (binary_search [ch] sel4_2 glyph 0 (length glyph)) + ha ch | (length (ha_string ch))>0 = read (ha_string ch) + | otherwise = 0 -- advance in horiz.-direction for next glyph + +commands_to_points :: [GlyphCommand] -> [F2] -> F2 -> Int -> Float -> [[F2]] +commands_to_points [] _ _ _ _ = [] +commands_to_points (c:commands) points last_contr p max_h + | (length next_points) == 0 = [ tail points ] ++ (commands_to_points commands next_points (contr c) p max_h) + | otherwise = commands_to_points commands (points ++ next_points) (contr c) p max_h + where next_points = go c + contr ( C_abs (x1,y1,x2,y2,x,y) ) = ( x+x-x2, y+y-y2 ) -- control point of bezier curve + contr ( C_rel (x1,y1,x2,y2,x,y) ) = (x0+x+x-x2, y0+y+y-y2 ) + contr ( S_abs (x2,y2,x,y) ) = ( x+x-x2, y+y-y2 ) + contr ( S_rel (x2,y2,x,y) ) = (x0+x+x-x2, y0+y+y-y2 ) + contr ( Q_abs (x1,y1,x,y) ) = ( x+x-x1, y+y-y1 ) + contr ( Q_rel (x1,y1,x,y) ) = (x0+x+x-x1, y0+y+y-y1 ) + contr ( T_abs (x,y) ) = ( x+x-cx, y+y-cy ) + contr ( T_rel (x,y) ) = (x0+x+(x0+x)-cx, y0+y+(y0+y)-cy ) -- absolute coordinates + contr ( L_abs (x,y) ) = ( x, y) + contr ( L_rel (x,y) ) = (x0 + x, y0 + y) + contr ( M_abs (x,y) ) = ( x, y) + contr ( M_rel (x,y) ) = (x0 + x, y0 + y) + contr ( H_abs x ) = ( x, y0 ) + contr ( H_rel x ) = (x0 + x, y0 ) + contr ( V_abs y ) = (x0, y ) + contr ( V_rel y ) = (x0, y0 + y ) + go ( L_abs (x,y) ) = [(x,y)] + go ( L_rel (x,y) ) = [(x0+x, y0+y)] + go ( M_abs (x,y) ) = [(x, y)] + go ( M_rel (x,y) ) = [(x0+x, y0+y)] + go ( H_abs x) = [(x, y0)] + go ( H_rel x) = [(x0+x, y0)] + go ( V_abs y) = [(x0, y )] + go ( V_rel y) = [(x0, y0+y)] + go ( C_abs (x1,y1,x2,y2,x,y) ) = bCurve (bez x y) [(x0, y0), (x1, y1), (x2, y2), (x, y) ] + go ( C_rel (x1,y1,x2,y2,x,y) ) = bCurve (bez x y) [(x0, y0), (x0+x1,y0+y1), (x0+x2,y0+y2), (x0+x,y0+y)] + go ( S_abs ( x2,y2,x,y) ) = bCurve (bez x y) [(x0, y0), (cx, cy), (x2, y2), (x, y) ] + go ( S_rel ( x2,y2,x,y) ) = bCurve (bez x y) [(x0, y0), (cx, cy), (x0+x2,y0+y2), (x0+x,y0+y)] + go ( Q_abs (x1,y1,x,y) ) = bCurve (bez x y) [(x0, y0), (x1, y1), (x, y)] + go ( Q_rel (x1,y1,x,y) ) = bCurve (bez x y) [(x0, y0), (x0+x1, y0+y1), (x0+x, y0+y)] + go ( T_abs (x,y) ) = bCurve (bez x y) [(x0,y0), (cx, cy), (x, y) ] + go ( T_rel (x,y) ) = bCurve (bez x y) [(x0,y0), (cx, cy), (x0+x,y0+y)] + go ( Z ) = [] + bez xd yd = p -- round ((fromIntegral p) * (sqrt ((xd-x0)*(xd-x0) + (yd-y0)*(yd-y0))) / max_h) -- not better + x0 = fst (last points) + y0 = snd (last points) + cx = (fst last_contr) -- last control point is always in absolute coordinates + cy = (snd last_contr) + +--------------------------------------------------- +-- bezier-curves (inspired by wikipedia article) +--------------------------------------------------- +-- linearInterp:: Float -> F2 -> F2 -> F2 +linearInterp t (x0,y0) (x1,y1) = ( (1-t)*x0 + t*x1, (1-t)*y0 + t*y1) + +-- eval:: Float -> [F2] -> [F2] +eval t (bi:bj:[]) = [linearInterp t bi bj] +eval t (bi:bj:bs) = (linearInterp t bi bj) : (eval t (bj:bs)) + +-- deCas:: Float -> [F2] -> F2 +deCas t (bi:[]) = bi +deCas t bs = deCas t (eval t bs) + +-- bCurve:: Int -> [F2] -> [F2] +bCurve n b = tail [deCas (fromIntegral x/fromIntegral n) b | x<- [0..n]] + +--------------------------------------------------- +-- transform a polygon with (nested) holes into one outline +-- i.e. the letters a,b,d,e,g,o,p,q contain holes tat have to be deleted +--------------------------------------------------- +data Tree = Node Int [F2] [Tree] | Nil -- c is the nesting counter and p a polygon + +instance Show Tree where + show (Node c p tree) = "Node" ++ (show c) ++ (show (length p)) ++ "[" ++ (concat(map show tree)) ++ "]" + show (Nil) = "Nil" + +delete_holes :: [GlyphCommand] -> Int -> Float -> [[F2]] +delete_holes commands bez max_h = flatten trees -- trace (show trees) + where trees = generate_trees inside_poly (commands_to_points commands [(0,0)] (0,0) bez max_h) + flatten [] = [] + flatten (Nil:ts) = flatten ts + flatten ((Node c poly [Nil]):ts) = (direction c (polygon_direction poly) poly) : (flatten ts) + flatten ((Node c poly ps) :ts) = ( embed (flatten ps) (direction c (polygon_direction poly) poly) ) : (flatten ts) + +embed :: [[F2]] -> [F2] -> [F2] +embed [] poly = poly +embed (s:sub_polys) poly = embed sub_polys ((take (n+1) poly) ++ s ++ (drop n poly)) + where n = fst (rotate_poly (head s) poly) + +direction :: Int -> Bool -> [F2] -> [F2] +direction c b poly | (b && (even c)) || (not b && (odd c)) = poly + | otherwise = reverse poly + +-- f should be the funtion to test "contains" +-- the trees then are the hierarchy of containedness of outlines +generate_trees :: ([F2]->[F2]->Bool) -> [[F2]] -> [Tree] +generate_trees f [] = [] +generate_trees f ps = merge_nodes f (map (\p -> Node 0 p []) ps) [] + +merge_nodes :: ([F2]->[F2]->Bool) -> [Tree] -> [Tree] -> [Tree] +merge_nodes f [] result = result +merge_nodes f (v:vs) result = merge_nodes f vs (insert_node f v result) + +insert_node :: ([F2]->[F2]->Bool) -> Tree -> [Tree] -> [Tree] +insert_node f (Node _ poly []) ((Node c p []):ts)|(f poly p)= (Node c p [Node (c+1) poly []]) : ts + |(f p poly)= (Node c poly [Node (c+1) p []]) : ts + |otherwise = (Node c p []) : ( insert_node f (Node (c+1) poly []) ts) +insert_node f (Node c poly []) [] = [(Node c poly [])] +insert_node f (Node _ poly []) ((Node c p ps):ts)|(f poly p) = (Node c p (insert_node f (Node (c+1) poly []) ps)) : ts + |(f p poly) = [Node (c-1) poly ((Node c p ps) : ts)] + |otherwise = (Node c p ps): ( insert_node f (Node c poly []) ts) + +-- how many positions to rotate a polygon until the start point is nearest to some other point +-- call i.e. with nearest (3,4) [(0,0),(1,2), ... ] 0 0 +rotate_poly :: F2 -> [F2] -> (Int,X) +rotate_poly p points = (fst tup, snd tup) + where tup = nearest p points (-1) 0 0 + +nearest :: F2 -> [F2] -> X -> Int -> Int -> (Int,X) +nearest _ [] dist l ml = (ml,dist) +nearest (x0,y0) ((x1,y1):ps) dist l ml | (new_dist < dist) || (dist < 0) = nearest (x0,y0) ps new_dist (l+1) l + | otherwise = nearest (x0,y0) ps dist (l+1) ml + where new_dist = (x0-x1)*(x0-x1)+(y0-y1)*(y0-y1) + +--------------------------------------------------- +-- general algorithms for various applications +--------------------------------------------------- +-- the direction of a polygon can be determined by taking the right-/upmost point and calculating the +-- crossproduct of the two adjacent points +polygon_direction :: [F2] -> Bool +polygon_direction [] = False +polygon_direction poly | (crossp (p1 `sub` p0) (p1 `sub` p2) ) > 0 = True + | otherwise = False + where l = maxim poly 0 0 0 0 + lp = length poly + p0 = position (l-1) poly + p1 = position l poly + p2 = position (l+1) poly + position l poly = head (drop (l `mod` lp) poly) + sub (x0,y0) (x1,y1) = (x0-x1, y0-y1) + crossp (v0,v1) (w0,w1) = v0*w1-v1*w0 + -- the index of the right-/upmost point + maxim [] l ml mx my = ml + maxim (x:xs) l ml mx my | ((fst x) > mx) && ((snd x) >= my) = maxim xs (l+1) l (fst x) (snd x) + | otherwise = maxim xs (l+1) ml mx my + +inside_poly :: [F2] -> [F2] -> Bool +inside_poly [] _ = False +inside_poly _ [] = False +inside_poly poly1 poly2 = point_inside (head poly1) poly2 + +-- point_inside: A point that is inside a polygon if it has an odd number of intersections with the boundary (Jordan Curve theorem) +-- to do: find the error +point_inside :: F2 -> [F2] -> Bool +point_inside (x,y) poly = (length intersect_pairs) `mod` 2 == 1 -- trace (show intersect_pairs) + where intersect_pairs = [ p | p <- all_pairs, positive_x_axis p, above_below p] --, special_cases p] + all_pairs = cycle_neighbours poly + positive_x_axis p = (x0 p) > x || (x1 p) > x -- intersect with positive x-axis + -- only lines with one point above + one point below can intersect + above_below p = (((y0 p)> y && (y1 p)< y) || ((y0 p) < y && (y1 p) > y)) + special_cases p = (((dir1 p) > 0 && (dir2 p) <= 0) || ((dir1 p) <= 0 && (dir2 p) > 0)) -- cross product for special cases + dir1 p = cross ((x1 p)-(x0 p),(y1 p)-(y0 p)) (1,0) + dir2 p = cross ((x1 p)-(x0 p),(y1 p)-(y0 p)) (x-(x0 p),y-(y0 p)) + cross (a0,b0) (a1,b1) = a0*b1 - a1*b0 + x0 p = fst (head p) + x1 p = fst (last p) + y0 p = snd (head p) + y1 p = snd (last p) + +-- return a list containing lists of every element with its neighbour +-- i.e. [e1,e2,e3] -> [ [e1,e2], [e2,e3], [e3, e1] ] +cycle_neighbours :: [a] -> [[a]] +cycle_neighbours [] = [] +cycle_neighbours xs = cycle_n (head xs) xs + +cycle_n :: a -> [a] -> [[a]] +cycle_n f (x:y:xs) = [x,y] : (cycle_n f (y:xs)) +cycle_n f e = [[head e, f ]] -- if the upper doesn't match close cycle + +qsort f [] = [] +qsort f (x:xs) = (qsort f [l | l <- xs, (f l)<=(f x)]) ++ [x] ++ (qsort f [r | r <- xs, (f r) > (f x)]) + +triang :: [(X,Y)] -> [(Int,Int,Int)] +triang poly = ketTri poly -- to do: try O(n(1+t0)) from Toussaint (already implemented by Joern Dinkla) + +-- The idea: the three sides of the triangle are represented by vectors in one direction around the triangle. +-- For every vector the crossprodukt divides the plane into two regions. +-- The intersection of the three regions is the inner area +inside_triangle :: Array Int (X,Y) -> Int -> Int -> Int -> (X,Y,Int,Int) -> Bool +inside_triangle parray a b c p = -- trace ("in" ++ show a ++ show b ++ show c ++ show (parray!a) ++ show (parray!b) ++ show (parray!c) ++ show p ++ show ((aCROSSbp <= 0) && (bCROSScp <= 0) && (cCROSSap <= 0))) + ((aCROSSbp <= 0) && (bCROSScp <= 0) && (cCROSSap <= 0)) + where (aax,aay) = parray!a + (bbx,bby) = parray!b + (ccx,ccy) = parray!c + (px,py) = parray!(sel4_3 p) + + (ax,ay) = (ccx-bbx, ccy-bby) + (bx,by) = (aax-ccx, aay-ccy) + (cx,cy) = (bbx-aax, bby-aay) + (apx,apy) = (px-aax, py-aay) + (bpx,bpy) = (px-bbx, py-bby) + (cpx,cpy) = (px-ccx, py-ccy) + aCROSSbp = ax*bpy - ay*bpx; + cCROSSap = cx*apy - cy*apx; + bCROSScp = bx*cpy - by*cpx; + +-------------------------- +-- main library function, together with read_font which produces the Svg_glyph-type needed for this function +-------------------------- +get_glyph_polygon :: Char -> Svg_glyph -> Int -> Float -> ([[F2]], X,[[ (Int,Int,Int) ]]) +get_glyph_polygon ch glyph bez max_h = (outline, ha, map triang outline) -- the triangulation is a list of triangles(3 indices) + where d = sel4_4 array_element -- ie. a letter like 'i' consists of two lists of triangles + ha_string = sel4_3 array_element + ha | (length ha_string)>0 = read (sel4_3 array_element) -- how much to advance in the horiz.-direction for the next glyph + | otherwise = 0 + array_element = binary_search [ch] sel4_2 glyph 0 (length glyph) + outl = delete_holes commands bez max_h -- bez is the # of points in a bezier-curve + outline = map (\o -> direction 0 (polygon_direction o) o) outl + commands | (length d) == 0 = [] + | otherwise = unsafePerformIO ( glyphFromString d ) + +binary_search ch f glyph left right | compare ch s == EQ = head (drop ((left+right)`div`2) glyph ) + | compare ch s == LT = binary_search ch f glyph left ((left+right)`div`2) + | compare ch s == GT = binary_search ch f glyph ((left+right)`div`2) right + | otherwise = head glyph + where s = f (head (drop ((left+right)`div`2) glyph )) + diff --git a/src/Test/Fonts.hs b/src/Test/Fonts.hs new file mode 100644 --- /dev/null +++ b/src/Test/Fonts.hs @@ -0,0 +1,231 @@ +module Main where + +import Graphics.Rendering.OpenGL +import Graphics.UI.GLUT as GLUT +import Data.IORef +import System.IO.Unsafe (unsafePerformIO) +import Test.PointOfView +import Graphics.SVGFonts.ReadFont(get_glyph_polygon, read_font, horiz_sum, cycle_neighbours, triang) +import Char + +main= do + (progName,_) <- getArgsAndInitialize + initialDisplayMode $= [WithDepthBuffer, DoubleBuffered, RGBAMode, WithAlphaComponent, WithAccumBuffer] + createWindow progName + windowSize $= Size 800 600 + myInit + + -- display_string uses 4 vectors and a mode: origin, v1 (direction of char-advance), v2(height direction), v3(extrusion), mode + -- mode 0: the string is inside v1 v2 v3 boundaries (height/length-relation not kept) + -- mode 1: stay inside v1 boundary, size of v2 adjusted to height/length-relation + -- mode 2: stay inside v2 boundary, size of v1 adjusted to height/length-relation + g <- return ( G (display_string "Haskell will be mainstream" + --"abcdefghijklmnopqrstuvwxyz ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789 +-~{}[]()=*/%" + "../../../src/Test/GirlsareWeird.svg" -- "LinLibertineO.svg" "Scriptin.svg" + 5 (0,0,0) (10,0,0) (0,0,-1) (0,0.2,0) 1) ) + + putStrLn "Font read" + l <- defineNewList Compile $ do display_g ( g ) + + pPos <- newIORef (0::GLdouble,1::GLdouble,0::GLdouble, 0::GLdouble,0::GLdouble,0::GLdouble, + 0::GLdouble,0::GLdouble,-1::GLdouble) + -- 0,1,0 : point of location in x,y,z then 0,0,0: where to look at + -- 0,0,-1: up direction + keystate <- newIORef [] + keyboardMouseCallback $= Just (keyboard keystate) + idleCallback$= Just (idle pPos) + displayCallback $= display keystate pPos l + reshapeCallback $= Just reshape + mainLoop + +-- Initialize lighting and other values. +myInit :: IO () +myInit = do + materialAmbient Front $= Color4 1 1 1 1 + materialSpecular Front $= Color4 1 1 1 1 + materialShininess Front $= 50 + position (Light 0) $= Vertex4 5 5 10 0 + lightModelAmbient $= Color4 0.2 0.2 0.2 1 + + -- cullFace $= Just Back + lighting $= Enabled + light (Light 0) $= Enabled + depthFunc $= Just Less + shadeModel $= Flat + normalize $= Enabled + + clearColor $= Color4 0 0 0 0 + clearAccum $= Color4 0 0 0 0 +-- spriteInit 800 600 + +display keystate pPos l = do + loadIdentity + setPointOfView keystate pPos + clear [ColorBuffer,DepthBuffer] + callList l + --deleteLists [l] + swapBuffers + + +type Rad = Val +type X = Val +type Y = Val +type Z = Val +type B = Bool +type T = Int -- times +type C = Float -- const +type O = V -- position vector +data Prop = RedGreenBlue (Float, Float, Float) | N | -- N = not visible + Textur (Maybe TextureObject) | --deriving (Show) -- from sprites.hs + Triangul [(Int,Int,Int)] -- list of triangles +data AObj = Annotate [V] Prop + +type V = (Float,Float,Float) -- x,y,z + +instance Show Prop where + show (RedGreenBlue (a,b,c)) = "RGB(" ++ show (floor a) ++ "," ++ show (floor b) ++ "," ++ + show (floor c) ++ ")" +type Val = GLfloat -- size in meters +type Tup = (O, V, V, C, C) +type Svg_glyph = [(String, String, String, String)] +nul = ( (0,0,0), (0,0,0), (0,0,0), 1, 1) + +data Obj = G [ AObj ] | -- extruded objects in coords (G for Geometry) + Nil + +red = RedGreenBlue (1,0,0) +green = RedGreenBlue (0,1,0) +blue = RedGreenBlue (0,0,1) +white = RedGreenBlue (1,1,1) +grey = RedGreenBlue (0.7,0.7,0.7) +turk = RedGreenBlue (0,1,1) + +-- extrude a 2d polygon to 3d, the same points are added again with extrusion direction v +add_points3d :: V -> Prop -> [AObj] -> [AObj] +add_points3d v pr [] = [] +add_points3d v pr poly = + poly ++ -- bottom polygon + ( map (add_points v pr) (map (\x -> Annotate x pr) (cycle_neighbours (de_ann(head poly)))) ) ++ --side polygons + [ Annotate (map (add v) (de_ann(head poly))) (property (head poly)) ] -- top polygon + +property (Annotate ps pr) = pr +de_ann (Annotate ps pr) = ps + +-- extrude a line to a construct a polygon +add_points :: V -> Prop -> AObj -> AObj +add_points v pr (Annotate p _) = Annotate (p ++ (map (add v) (reverse p))) pr +-- add_points v pr _ = Annotate [] pr + +-- ======================================================== +-- conversion into G [AObj] (mainly with eval3d) +-- meaning of G [AObj] by example: +-- G [Annotate pr [1], Annotate pr [2], Annotate pr [3], Annotate pr [4]] = four single points (0d) +-- G [Annotate pr [1,2], Annotate pr [2,3], Annotate pr [3,4], Annotate pr [4,1]] = four lines (1d) +-- G [Annotate pr [1,2,3,4]] a rectangle (2d) +-- G [Annotate pr [1,2,3,4], Annotate pr [3,4,5,6], Annotate pr [1,2,7,8]] = a 3d object, consisting of several rectangles +-- ======================================================== + + -- mode 0: the string is inside v1 v2 v3 boundaries (height/length-relation not kept) + -- mode 1: stay inside v1 boundary, size of v2 adjusted to height/length-relation + -- mode 2: stay inside v2 boundary, size of v1 adjusted to height/length-relation +display_string :: String -> FilePath -> Int -> O -> V -> V -> V -> Int -> [AObj] +display_string str file bez o v1 v2 v3 mode | mode == 0 = make_str str (fst glyph) h max_h bez o v1 v2 v3 + | mode == 1 = make_str str (fst glyph) h max_h bez o v1 new_v2 v3 + | mode == 2 = make_str str (fst glyph) h max_h bez o new_v1 v2 v3 + where + glyph = read_font file + h = fromIntegral (horiz_sum str (fst glyph)) + bbox = splitBy isSpace (snd glyph) + max_h = read (head (drop 3 bbox)) -- bbox) -- max height of glyph + new_v1 = set_len v1 ( (v_len v2) * (h/max_h) ) + new_v2 = set_len v2 ( (v_len v1) * (max_h/h) ) + +splitBy :: (a -> Bool) -> [a] -> [[a]] +splitBy _ [] = [] +splitBy f list = first : splitBy f (dropWhile f rest) where + (first, rest) = break f list + +make_str :: String -> Svg_glyph -> Float -> Float -> Int -> O -> V -> V -> V -> [AObj] +make_str [] g h mh bez o v1 v2 v3 = [] +make_str (ch:str) g h mh bez o v1 v2 v3 | (length outline) == 0 = (make_str str g h mh bez (o `add` v1_advance) v1 v2 v3) + | otherwise = glyph_faces ++ (make_str str g h mh bez (o `add` v1_advance) v1 v2 v3) + where + glyph_faces = glyph3d -- tail ( init glyph3d) -- with tail and init top and bottom polygon are deleted + glyph3d = concat ( map (\(o,t) -> add_points3d v3 blue [ Annotate (map resize o) t ] ) out_tri ) + out_tri = zip outline triangles -- list of tuples of outline with its triangulation: + -- i.e. a character like "j" has two outlines (one for the point). + resize (x,y) = o `add` (v1 `mul` (x/h)) `add` (v2 `mul` (y/mh)) + outline = sel3_1 glyph + triangles = map (\x -> Triangul x) (sel3_3 glyph) + v1_advance = v1 `mul` ((sel3_2 glyph) / h) + glyph = get_glyph_polygon ch g bez mh -- ([[F2]], X,[[ (Int,Int,Int) ]]) = (outline, ha, map triang outline) + +redG (G obj) = obj + +add (x0,y0,z0) (x1,y1,z1) = (x0+x1, y0+y1, z0+z1) +sub (x0,y0,z0) (x1,y1,z1) = (x0-x1, y0-y1, z0-z1) + +skalar (x,y,z) (a,b,c) = x*a + y*b + z*c + +sel3_1 (x,y,z) = x +sel3_2 (x,y,z) = y +sel3_3 (x,y,z) = z + +-- ==================================================================== +-- displaying +-- ==================================================================== +loc = preservingMatrix + +display_g :: Obj -> IO() +display_g (G []) = return () +display_g Nil = return() + +display_g (G (p:ps)) = disp p >> display_g (G ps) + +disp :: AObj -> IO() +disp (Annotate ps ( Triangul tris )) = do diplay_primitive (generate_from_index ps tris) blue Triangles +disp (Annotate ps pr) | (length ps) == 1 = do diplay_primitive ps pr Points + | (length ps) == 2 = do diplay_primitive ps pr Lines + | otherwise = do diplay_primitive ps pr Polygon + +generate_from_index :: [(Float,Float,Float)] -> [(Int,Int,Int)] -> [(Float,Float,Float)] +generate_from_index ps [] = [] +generate_from_index ps (t:tris) = [tp0, tp1, tp2] ++ (generate_from_index ps tris) + where tp0 = head(drop (sel3_1 t) ps) + tp1 = head(drop (sel3_2 t) ps) + tp2 = head(drop (sel3_3 t) ps) + +norm points = (set_len (kreuz (v0 `sub` v1) (v2 `sub` v1) ) 1) + where v0 = head points + v1 = head (drop 1 points) + v2 = head (drop 2 points) + +diplay_primitive p (RedGreenBlue(r,g,b)) primitiveShape + | (length p) >=3 = do + materialAmbientAndDiffuse Front $= Color4 r g b 1 + currentNormal $= Normal3 (sel3_1(norm p)) (sel3_2(norm p)) (sel3_3(norm p)) + displayPoints p primitiveShape + | otherwise = do + materialAmbientAndDiffuse Front $= Color4 r g b 1 + displayPoints p primitiveShape + +diplay_primitive points (Textur image) primitiveShape = do + textureBinding Texture2D $= image + let verts = makeV points + let texs = [(TexCoord2 0 1), (TexCoord2 0 0), (TexCoord2 1 0), (TexCoord2 1 1)] + renderPrimitive Polygon $ do mapVertices texs verts + flush + +displayPoints points primitiveShape = do + renderPrimitive primitiveShape$makeVertices points + flush + +makeVertices = mapM_ ( \(x,y,z) -> vertex$Vertex3 x y z ) +makeV = map ( \(x,y,z) -> (Vertex3 x y z) ) + +setVertex :: (TexCoord2 GLfloat, Vertex3 GLfloat) -> IO () +setVertex (texCoordinates, vertexCoordinates) = do texCoord texCoordinates; vertex vertexCoordinates; + +-- A routine used to draw a list of coordinates. +mapVertices :: [(TexCoord2 GLfloat)] -> [(Vertex3 GLfloat)] -> IO () +mapVertices texs verts = mapM_ setVertex (zip texs verts) diff --git a/src/Test/GirlsareWeird.svg b/src/Test/GirlsareWeird.svg new file mode 100644 --- /dev/null +++ b/src/Test/GirlsareWeird.svg @@ -0,0 +1,4069 @@ + + + + +Created by FontForge 20071110 at Thu Jul 24 13:11:19 2008 + By Tillmann Vogt,,, +Copyright © 1997 John Martz, Robotic Attack Fonts + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/src/Test/LinLibertineO.svg b/src/Test/LinLibertineO.svg new file mode 100644 --- /dev/null +++ b/src/Test/LinLibertineO.svg @@ -0,0 +1,8118 @@ + + + + +Created by FontForge 20071110 at Tue Jul 15 00:04:56 2008 + By Tillmann Vogt,,, +LinuxLibertine by Philipp H. Poll, Free Font under Terms of the GPL (General Public License - http://www.gnu.org/copyleft/gpl.html) and OFL (Open Font Licence). Created with FontForge 1.0 (http://fontforge.sf.net) Sept 2003, 2004, 2005, 2006, 2007 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/src/Test/PointOfView.hs b/src/Test/PointOfView.hs new file mode 100644 --- /dev/null +++ b/src/Test/PointOfView.hs @@ -0,0 +1,104 @@ +module Test.PointOfView where + +import Graphics.Rendering.OpenGL +import Graphics.UI.GLUT +import Data.IORef +import System(ExitCode(..), exitWith) +import Data.List (nub) +-- import Graphics.UI.GLUT ( Key(SpecialKey, Char) ) + +setPointOfView :: IORef [Key] -> IORef (GLdouble,GLdouble,GLdouble, GLdouble,GLdouble,GLdouble, GLdouble,GLdouble,GLdouble) -> IO () +setPointOfView ks pPos = do + keystate <- get ks + if Char 'w' `elem` keystate then do move_vw pPos 0.01 -- vorward + postRedisplay Nothing + else return() + if Char 's' `elem` keystate then do move_vw pPos (negate 0.01) -- backward + postRedisplay Nothing + else return() + if Char 'a' `elem` keystate then do strafe pPos (0.01) -- left + postRedisplay Nothing + else return() + if Char 'd' `elem` keystate then do strafe pPos (negate 0.01) + postRedisplay Nothing -- right + else return() + if (SpecialKey KeyLeft) `elem` keystate then do rot pPos (0,negate 0.002) + postRedisplay Nothing + else return() + if (SpecialKey KeyRight) `elem` keystate then do rot pPos (0, 0.002) + postRedisplay Nothing + else return() + if (SpecialKey KeyUp) `elem` keystate then do rot pPos (0.002, 0) + postRedisplay Nothing + else return() + if (SpecialKey KeyDown) `elem` keystate then do rot pPos (negate 0.002,0) + postRedisplay Nothing + else return() + (x,y,z,lx,ly,lz,ux,uy,uz) <- get pPos + lookAt (Vertex3 x y z) (Vertex3 lx ly lz) (Vector3 ux uy uz) -- x y z: the point where the viewer is situated + -- lx ly lz: the point at which the viewer is looking + -- ux uy uz: a vector, which is up for the viewer + +keyboard :: IORef [Key] -> Key -> KeyState -> t -> t1 -> IO () +keyboard keystate key ks _ _ = do + case (key,ks) of + (Char '\27',_) -> do exitWith ExitSuccess + (Char 'q',_) -> do exitWith ExitSuccess + (_,Down) -> modifyIORef keystate $ nub . (++[key]) + (_,Up) -> modifyIORef keystate $ filter (/=key) + +--move_vw :: IORef (GLdouble,GLdouble,GLdouble,GLdouble,GLdouble,GLdouble,GLdouble,GLdouble,GLdouble) -> GLdouble -> IO () +move_vw pPos delta = do + (x,y,z,lx,ly,lz,ux,uy,uz) <- get pPos + let dx = (lx-x)*delta + dy = (ly-y)*delta + dz = (lz-z)*delta + pPos $= (x+dx, y+dy, z+dz, lx+dx, ly+dy, lz+dz, ux,uy,uz) + +kreuz (v0,v1,v2) (w0,w1,w2) = (v1*w2-v2*w1, v2*w0-v0*w2, v0*w1-v1*w0) +kreuz2 (v0,v1,v2,pr) (w0,w1,w2,_) = (v1*w2-v2*w1, v2*w0-v0*w2, v0*w1-v1*w0, pr) +set_len (x,y,z) l = (x*c*l, y*c*l, z*c*l) where c = 1 / v_len (x,y,z) +v_len (x,y,z) = sqrt (x*x+y*y+z*z) + +strafe pPos delta = do + (x,y,z,lx,ly,lz,ux,uy,uz) <- get pPos + let (dx, dy, dz) = set_len (kreuz (x-lx,y-ly,z-lz) (ux,uy,uz)) delta + pPos $= (x+dx, y+dy, z+dz, lx+dx, ly+dy, lz+dz, ux,uy,uz) + +divide (x,y,z) c = (x/c, y/c, z/c) +mul (x,y,z) c = (x*c, y*c, z*c) + +rot pPos (alpha, beta) = do + (px,py,pz,lx,ly,lz,ux,uy,uz) <- get pPos + return (set_len (ux,uy,uz) (v_len (lx-px,ly-py,lz-pz))) + let lx_alpha = px + (lx-px)*(cos alpha) + ux*(sin alpha) + ly_alpha = py + (ly-py)*(cos alpha) + uy*(sin alpha) + lz_alpha = pz + (lz-pz)*(cos alpha) + uz*(sin alpha) + ux_alpha = - (lx-px)*(sin alpha) + ux*(cos alpha) + uy_alpha = - (ly-py)*(sin alpha) + uy*(cos alpha) + uz_alpha = - (lz-pz)*(sin alpha) + uz*(cos alpha) + k = (kreuz (lx_alpha-px, ly_alpha-py, lz_alpha-pz) (ux_alpha, uy_alpha, uz_alpha)) + (kx,ky,kz) = (k `divide` (v_len k)) `mul` (v_len (ux, uy, uz)) + + pPos $= (px, py, pz, + px + (lx_alpha-px)*(cos beta) + kx*(sin beta), + py + (ly_alpha-py)*(cos beta) + ky*(sin beta), + pz + (lz_alpha-pz)*(cos beta) + kz*(sin beta), + ux_alpha, uy_alpha, uz_alpha) + +idle pPos = do + postRedisplay Nothing + +reshape screenSize@(Size w h) = do + viewport $= ((Position 0 0), screenSize) + matrixMode $= Projection + loadIdentity + let near = 0.001 + far = 40 + fov = 90 + ang = (fov*pi)/(360) -- equals 45 degree + top = near / ( cos(ang) / sin(ang) ) -- top/near has the same value as 1/(x/y) + aspect = fromIntegral(w)/fromIntegral(h) + right = top*aspect + frustum (-right) right (-top) top near far + matrixMode $= Modelview 0 diff --git a/src/Test/Scriptin.svg b/src/Test/Scriptin.svg new file mode 100644 --- /dev/null +++ b/src/Test/Scriptin.svg @@ -0,0 +1,3332 @@ + + + + +Created by FontForge 20071110 at Sun Jul 20 00:07:04 2008 + By Tillmann Vogt,,, +© 1999-2001 Apostrophic Labs. All rights reserved. For more works by the designer visit www.apostrophiclab.com + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/test/Fonts.hs b/test/Fonts.hs deleted file mode 100644 --- a/test/Fonts.hs +++ /dev/null @@ -1,232 +0,0 @@ -module Main where - -import Graphics.Rendering.OpenGL -import Graphics.UI.GLUT as GLUT -import Data.IORef -import System.IO.Unsafe (unsafePerformIO) --- import Sprites -import PointOfView -import ReadFont(get_glyph_polygon, read_font, horiz_sum, cycle_neighbours, triang) -import Char - -main= do - (progName,_) <- getArgsAndInitialize - initialDisplayMode $= [WithDepthBuffer, DoubleBuffered, RGBAMode, WithAlphaComponent, WithAccumBuffer] - createWindow progName - windowSize $= Size 800 600 - myInit - - -- display_string uses 4 vectors and a mode: origin, v1 (direction of char-advance), v2(height direction), v3(extrusion), mode - -- mode 0: the string is inside v1 v2 v3 boundaries (height/length-relation not kept) - -- mode 1: stay inside v1 boundary, size of v2 adjusted to height/length-relation - -- mode 2: stay inside v2 boundary, size of v1 adjusted to height/length-relation - g <- return ( G (display_string "Haskell will be mainstream" - --"abcdefghijklmnopqrstuvwxyz ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789 +-~{}[]()=*/%" - "../../../test/GirlsareWeird.svg" -- "LinLibertineO.svg" "Scriptin.svg" - 5 (0,0,0) (10,0,0) (0,0,-1) (0,0.2,0) 1) ) - - putStrLn "Font read" - l <- defineNewList Compile $ do display_g ( g ) - - pPos <- newIORef (0::GLdouble,1::GLdouble,0::GLdouble, 0::GLdouble,0::GLdouble,0::GLdouble, - 0::GLdouble,0::GLdouble,-1::GLdouble) - -- 0,1,0 : point of location in x,y,z then 0,0,0: where to look at - -- 0,0,-1: up direction - keystate <- newIORef [] - keyboardMouseCallback $= Just (keyboard keystate) - idleCallback$= Just (idle pPos) - displayCallback $= display keystate pPos l - reshapeCallback $= Just reshape - mainLoop - --- Initialize lighting and other values. -myInit :: IO () -myInit = do - materialAmbient Front $= Color4 1 1 1 1 - materialSpecular Front $= Color4 1 1 1 1 - materialShininess Front $= 50 - position (Light 0) $= Vertex4 5 5 10 0 - lightModelAmbient $= Color4 0.2 0.2 0.2 1 - - -- cullFace $= Just Back - lighting $= Enabled - light (Light 0) $= Enabled - depthFunc $= Just Less - shadeModel $= Flat - normalize $= Enabled - - clearColor $= Color4 0 0 0 0 - clearAccum $= Color4 0 0 0 0 --- spriteInit 800 600 - -display keystate pPos l = do - loadIdentity - setPointOfView keystate pPos - clear [ColorBuffer,DepthBuffer] - callList l - --deleteLists [l] - swapBuffers - - -type Rad = Val -type X = Val -type Y = Val -type Z = Val -type B = Bool -type T = Int -- times -type C = Float -- const -type O = V -- position vector -data Prop = RedGreenBlue (Float, Float, Float) | N | -- N = not visible - Textur (Maybe TextureObject) | --deriving (Show) -- from sprites.hs - Triangul [(Int,Int,Int)] -- list of triangles -data AObj = Annotate [V] Prop - -type V = (Float,Float,Float) -- x,y,z - -instance Show Prop where - show (RedGreenBlue (a,b,c)) = "RGB(" ++ show (floor a) ++ "," ++ show (floor b) ++ "," ++ - show (floor c) ++ ")" -type Val = GLfloat -- size in meters -type Tup = (O, V, V, C, C) -type Svg_glyph = [(String, String, String, String)] -nul = ( (0,0,0), (0,0,0), (0,0,0), 1, 1) - -data Obj = G [ AObj ] | -- extruded objects in coords (G for Geometry) - Nil - -red = RedGreenBlue (1,0,0) -green = RedGreenBlue (0,1,0) -blue = RedGreenBlue (0,0,1) -white = RedGreenBlue (1,1,1) -grey = RedGreenBlue (0.7,0.7,0.7) -turk = RedGreenBlue (0,1,1) - --- extrude a 2d polygon to 3d, the same points are added again with extrusion direction v -add_points3d :: V -> Prop -> [AObj] -> [AObj] -add_points3d v pr [] = [] -add_points3d v pr poly = - poly ++ -- bottom polygon - ( map (add_points v pr) (map (\x -> Annotate x pr) (cycle_neighbours (de_ann(head poly)))) ) ++ --side polygons - [ Annotate (map (add v) (de_ann(head poly))) (property (head poly)) ] -- top polygon - -property (Annotate ps pr) = pr -de_ann (Annotate ps pr) = ps - --- extrude a line to a construct a polygon -add_points :: V -> Prop -> AObj -> AObj -add_points v pr (Annotate p _) = Annotate (p ++ (map (add v) (reverse p))) pr --- add_points v pr _ = Annotate [] pr - --- ======================================================== --- conversion into G [AObj] (mainly with eval3d) --- meaning of G [AObj] by example: --- G [Annotate pr [1], Annotate pr [2], Annotate pr [3], Annotate pr [4]] = four single points (0d) --- G [Annotate pr [1,2], Annotate pr [2,3], Annotate pr [3,4], Annotate pr [4,1]] = four lines (1d) --- G [Annotate pr [1,2,3,4]] a rectangle (2d) --- G [Annotate pr [1,2,3,4], Annotate pr [3,4,5,6], Annotate pr [1,2,7,8]] = a 3d object, consisting of several rectangles --- ======================================================== - - -- mode 0: the string is inside v1 v2 v3 boundaries (height/length-relation not kept) - -- mode 1: stay inside v1 boundary, size of v2 adjusted to height/length-relation - -- mode 2: stay inside v2 boundary, size of v1 adjusted to height/length-relation -display_string :: String -> FilePath -> Int -> O -> V -> V -> V -> Int -> [AObj] -display_string str file bez o v1 v2 v3 mode | mode == 0 = make_str str (fst glyph) h max_h bez o v1 v2 v3 - | mode == 1 = make_str str (fst glyph) h max_h bez o v1 new_v2 v3 - | mode == 2 = make_str str (fst glyph) h max_h bez o new_v1 v2 v3 - where - glyph = read_font file - h = fromIntegral (horiz_sum str (fst glyph)) - bbox = splitBy isSpace (snd glyph) - max_h = read (head (drop 3 bbox)) -- bbox) -- max height of glyph - new_v1 = set_len v1 ( (v_len v2) * (h/max_h) ) - new_v2 = set_len v2 ( (v_len v1) * (max_h/h) ) - -splitBy :: (a -> Bool) -> [a] -> [[a]] -splitBy _ [] = [] -splitBy f list = first : splitBy f (dropWhile f rest) where - (first, rest) = break f list - -make_str :: String -> Svg_glyph -> Float -> Float -> Int -> O -> V -> V -> V -> [AObj] -make_str [] g h mh bez o v1 v2 v3 = [] -make_str (ch:str) g h mh bez o v1 v2 v3 | (length outline) == 0 = (make_str str g h mh bez (o `add` v1_advance) v1 v2 v3) - | otherwise = glyph_faces ++ (make_str str g h mh bez (o `add` v1_advance) v1 v2 v3) - where - glyph_faces = glyph3d -- tail ( init glyph3d) -- with tail and init top and bottom polygon are deleted - glyph3d = concat ( map (\(o,t) -> add_points3d v3 blue [ Annotate (map resize o) t ] ) out_tri ) - out_tri = zip outline triangles -- list of tuples of outline with its triangulation: - -- i.e. a character like "j" has two outlines (one for the point). - resize (x,y) = o `add` (v1 `mul` (x/h)) `add` (v2 `mul` (y/mh)) - outline = sel3_1 glyph - triangles = map (\x -> Triangul x) (sel3_3 glyph) - v1_advance = v1 `mul` ((sel3_2 glyph) / h) - glyph = get_glyph_polygon ch g bez mh -- ([[F2]], X,[[ (Int,Int,Int) ]]) = (outline, ha, map triang outline) - -redG (G obj) = obj - -add (x0,y0,z0) (x1,y1,z1) = (x0+x1, y0+y1, z0+z1) -sub (x0,y0,z0) (x1,y1,z1) = (x0-x1, y0-y1, z0-z1) - -skalar (x,y,z) (a,b,c) = x*a + y*b + z*c - -sel3_1 (x,y,z) = x -sel3_2 (x,y,z) = y -sel3_3 (x,y,z) = z - --- ==================================================================== --- displaying --- ==================================================================== -loc = preservingMatrix - -display_g :: Obj -> IO() -display_g (G []) = return () -display_g Nil = return() - -display_g (G (p:ps)) = disp p >> display_g (G ps) - -disp :: AObj -> IO() -disp (Annotate ps ( Triangul tris )) = do diplay_primitive (generate_from_index ps tris) blue Triangles -disp (Annotate ps pr) | (length ps) == 1 = do diplay_primitive ps pr Points - | (length ps) == 2 = do diplay_primitive ps pr Lines - | otherwise = do diplay_primitive ps pr Polygon - -generate_from_index :: [(Float,Float,Float)] -> [(Int,Int,Int)] -> [(Float,Float,Float)] -generate_from_index ps [] = [] -generate_from_index ps (t:tris) = [tp0, tp1, tp2] ++ (generate_from_index ps tris) - where tp0 = head(drop (sel3_1 t) ps) - tp1 = head(drop (sel3_2 t) ps) - tp2 = head(drop (sel3_3 t) ps) - -norm points = (set_len (kreuz (v0 `sub` v1) (v2 `sub` v1) ) 1) - where v0 = head points - v1 = head (drop 1 points) - v2 = head (drop 2 points) - -diplay_primitive p (RedGreenBlue(r,g,b)) primitiveShape - | (length p) >=3 = do - materialAmbientAndDiffuse Front $= Color4 r g b 1 - currentNormal $= Normal3 (sel3_1(norm p)) (sel3_2(norm p)) (sel3_3(norm p)) - displayPoints p primitiveShape - | otherwise = do - materialAmbientAndDiffuse Front $= Color4 r g b 1 - displayPoints p primitiveShape - -diplay_primitive points (Textur image) primitiveShape = do - textureBinding Texture2D $= image - let verts = makeV points - let texs = [(TexCoord2 0 1), (TexCoord2 0 0), (TexCoord2 1 0), (TexCoord2 1 1)] - renderPrimitive Polygon $ do mapVertices texs verts - flush - -displayPoints points primitiveShape = do - renderPrimitive primitiveShape$makeVertices points - flush - -makeVertices = mapM_ ( \(x,y,z) -> vertex$Vertex3 x y z ) -makeV = map ( \(x,y,z) -> (Vertex3 x y z) ) - -setVertex :: (TexCoord2 GLfloat, Vertex3 GLfloat) -> IO () -setVertex (texCoordinates, vertexCoordinates) = do texCoord texCoordinates; vertex vertexCoordinates; - --- A routine used to draw a list of coordinates. -mapVertices :: [(TexCoord2 GLfloat)] -> [(Vertex3 GLfloat)] -> IO () -mapVertices texs verts = mapM_ setVertex (zip texs verts) diff --git a/test/GirlsareWeird.svg b/test/GirlsareWeird.svg deleted file mode 100644 --- a/test/GirlsareWeird.svg +++ /dev/null @@ -1,4069 +0,0 @@ - - - - -Created by FontForge 20071110 at Thu Jul 24 13:11:19 2008 - By Tillmann Vogt,,, -Copyright © 1997 John Martz, Robotic Attack Fonts - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - diff --git a/test/LinLibertineO.svg b/test/LinLibertineO.svg deleted file mode 100644 --- a/test/LinLibertineO.svg +++ /dev/null @@ -1,8118 +0,0 @@ - - - - -Created by FontForge 20071110 at Tue Jul 15 00:04:56 2008 - By Tillmann Vogt,,, -LinuxLibertine by Philipp H. Poll, Free Font under Terms of the GPL (General Public License - http://www.gnu.org/copyleft/gpl.html) and OFL (Open Font Licence). Created with FontForge 1.0 (http://fontforge.sf.net) Sept 2003, 2004, 2005, 2006, 2007 - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - diff --git a/test/Scriptin.svg b/test/Scriptin.svg deleted file mode 100644 --- a/test/Scriptin.svg +++ /dev/null @@ -1,3332 +0,0 @@ - - - - -Created by FontForge 20071110 at Sun Jul 20 00:07:04 2008 - By Tillmann Vogt,,, -© 1999-2001 Apostrophic Labs. All rights reserved. For more works by the designer visit www.apostrophiclab.com - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -