(3-Dimensional, i.e. project onto a 2D plane): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

10 April 2023

15 February 2023

  • curprev 11:2111:21, 15 February 2023‎ Admin talk contribs‎ 2,119 bytes +2,119‎ Created page with "{{DISPLAYTITLE:(3-Dimensional, i.e. project onto a 2D plane) (Shown Surface Determination)}} == Description == This is the process of identifying what surfaces and parts of surfaces can be seen from a particular viewing angle. Given a set of obstacles in the Euclidean space, two points in the space are said to be visible to each other, if the line segment that joins them does not intersect any obstacles. == Parameters == <pre>n: number of polygons p: number of pixel..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/(3-Dimensional,_i.e._project_onto_a_2D_plane)"