<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T17:08:53Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/1135" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/1135</identifier><datestamp>2017-03-21T19:23:54Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9930</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en" authority="29469a64-83a9-425a-b00f-cfe03221a73c" confidence="600">Hasan, Masud</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2006-08-22T14:26:45Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2006-08-22T14:26:45Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en">2005</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted" lang="en">2005</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/1135</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">Two types of problems are studied in this thesis:  reconstruction and visualization of polygons and polyhedra.    &amp;lt;br /&amp;gt;&amp;lt;br /&amp;gt;  Three problems are considered in reconstruction of polygons and polyhedra,  given a set of projection characteristics.     The first problem is to reconstruct a closed convex polygon (polyhedron)  given the number of visible edges (faces) from each of a set of   directions &amp;lt;em&amp;gt;S&amp;lt;/em&amp;gt;.    The main results for this problem include the necessary and sufficient   conditions for the existence of a polygon that realizes the projections.    This characterization gives an algorithm to construct a feasible  polygon when it exists.    The other main result is an algorithm to find the   maximum and minimum size of a feasible polygon for the given set &amp;lt;em&amp;gt;S&amp;lt;/em&amp;gt;.    Some special cases for non-convex polygons and for perspective projections  are also studied.    &amp;lt;br /&amp;gt;&amp;lt;br /&amp;gt;  For reconstruction of polyhedra, it is shown that when the projection  directions are co-planar, a feasible polyhedron (i.  e.   a polyhedron  satisfying the projection properties) can be constructed from a  feasible polygon and vice versa.    When the directions are covered by two planes,  if the number of visible faces from each of the directions  is at least four, then an algorithm is presented to decide   the existence of a feasible polyhedron and to construct one,  when it exists.    When the directions see arbitrary number of faces,  the same algorithm works, except for a particular sub-case.    &amp;lt;br /&amp;gt;&amp;lt;br /&amp;gt;  A polyhedron is, in general, called equiprojective, if from any  direction the size of the projection or the projection boundary is  fixed, where the &amp;quot;size&amp;quot; means the number of vertices, edge, or faces.    A special problem on reconstruction of polyhedra is to find all  equiprojective polyhedra.      For the case when the size is the number of vertices in the   projection boundary, main results include the characterization   of all equiprojective polyhedra and an algorithm to recognize them,  and finding the minimum equiprojective polyhedra.    Other measures of equiprojectivity are also studied.    &amp;lt;br /&amp;gt;&amp;lt;br /&amp;gt;  Finally, the problem of efficient visualization of polyhedra   under given constraints is considered.    A user might wish to find a projection that highlights certain  properties of a polyhedron.    In particular, the problem considered is given a set of vertices, edges,  and/or faces of a convex polyhedron, how to determine all projections   of the polyhedron such that the elements of   the given set are on the projection boundary.    The results include efficient algorithms for both perspective   and orthogonal projections, and improved adaptive algorithm when  only edges are given and they form disjoint paths.    A related problem of finding all projections where the given edges,  faces, and/or vertices are not on the projection boundary is also studied.</dim:field>
   <dim:field mdschema="dc" element="format" lang="en">application/pdf</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">1437980 bytes</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="rights" lang="en">Copyright: 2005, 
  Hasan, Masud. All rights reserved.</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Computer Science</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Algorithm</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">polyhedra</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">projection</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">reconstruction</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">silhouette</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">visualization</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Reconstruction and Visualization of Polyhedra Using Projections</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Doctoral Thesis</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">School of Computer Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Doctor of Philosophy</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>