to share – to copy, distribute and transmit the work
to remix – to adapt the work
Under the following conditions:
attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
share alike – If you remix, transform, or build upon the material, you must distribute your contributions under the same or compatible license as the original.
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the section entitled GNU Free Documentation License.http://www.gnu.org/copyleft/fdl.htmlGFDLGNU Free Documentation Licensetruetrue
You may select the license of your choice.
Captions
Add a one-line explanation of what this file represents
{{Information |description ={{en|1=Use of SVGs clip paths to shade regions between curves in File:The_Boat_Race_cumulative_results_shading.svg: # Simplified graphs of Cambridge and Oxford cumulative results. # The region beneath each graph. # The region above each graph. # Applying the opposing region above as a clip path to the region beneath, resulting in... # The appropriate intersections. # Putting it all together.}} |date = |source ={{own}} |author =[[User:...
This file contains additional information, probably added from the digital camera or scanner used to create or digitize it.
If the file has been modified from its original state, some details may not fully reflect the modified file.
Short title
The Boat Race cumulative results shading
Image title
Use of SVGs clip paths to shade regions between curves in The_Boat_Race_cumulative_results_shading.svg by CMG Lee. 1. Simplified graphs of Cambridge and Oxford cumulative results. 2. The region beneath each graph. 3. The region above each graph. 4. Applying the opposing region above as a clip path to the region beneath, resulting in 5. The appropriate intersections. 6. Putting it all together.