File:Binary space partition.svg
Jump to navigation
Jump to search
Size of this PNG preview of this SVG file: 642 × 303 pixels. Other resolutions: 320 × 151 pixels | 640 × 302 pixels | 1,024 × 483 pixels | 1,280 × 604 pixels | 2,560 × 1,208 pixels.
Original file (SVG file, nominally 642 × 303 pixels, file size: 75 KB)
Captions
Captions
Add a one-line explanation of what this file represents
Summary
[edit]
| Description |
English: This diagram llustrates the process of partitioning an irregular polygon into a series of convex ones by binary space partitioning. Notice how each step produces polygons with fewer segments until arriving at G and F, which are convex and require no further partitioning. In this particular case, the partitioning line was picked between existing vertices of the polygon and intersected none of its segments. |
| Date | |
| Source | Own work |
| Author | Jkwchui |
Licensing
[edit]
I, the copyright holder of this work, hereby publish it under the following licenses:
This file is licensed under the Creative Commons Attribution-Share Alike 3.0 Unported license.
- You are free:
- 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. |
You may select the license of your choice.
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Thumbnail | Dimensions | User | Comment | |
|---|---|---|---|---|---|
| current | 21:59, 16 January 2011 | | 642 × 303 (75 KB) | Jkwchui (talk | contribs) | {{Information |Description={{en|1=This diagram llustrates the process of partitioning an irregular polygon into a series of convex ones by [http://en.wikipedia.org/wiki/Binary_space_partitioning '''binary space partitioning''']. Notice how each step produ |
You cannot overwrite this file.
File usage on Commons
The following page uses this file:
File usage on other wikis
The following other wikis use this file:
- Usage on cs.wikipedia.org
- Usage on en.wikipedia.org
- Usage on es.wikipedia.org
- Usage on fi.wikipedia.org
- Usage on it.wikipedia.org
- Usage on ja.wikipedia.org
- Usage on ko.wikipedia.org
- Usage on ru.wikipedia.org
- Usage on uk.wikipedia.org
