File:Binary space partition.svg

Page contents not supported in other languages.
This is a file from the Wikimedia Commons
From Wikipedia, the free encyclopedia

Original file(SVG file, nominally 642 × 303 pixels, file size: 75 KB)

Summary

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

I, the copyright holder of this work, hereby publish it under the following licenses:
w:en:Creative Commons
attribution share alike
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.
GNU head 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.

Captions

Add a one-line explanation of what this file represents

Items portrayed in this file

depicts

11 January 2011

image/svg+xml

e193e65ecf3e34fe2db488051daeeb208d904744

76,958 byte

303 pixel

642 pixel

File history

Click on a date/time to view the file as it appeared at that time.

Date/TimeThumbnailDimensionsUserComment
current21:59, 16 January 2011Thumbnail for version as of 21:59, 16 January 2011642 × 303 (75 KB)Jkwchui{{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
The following pages on the English Wikipedia use this file (pages on other projects are not listed):

Global file usage

The following other wikis use this file: