<?xml version="1.0" encoding="UTF-8"?>
<record
    xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
    xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd"
    xmlns="http://www.loc.gov/MARC21/slim">

  <leader>03272nam a22003737a 4500</leader>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="2">lcc</subfield>
    <subfield code="4">0</subfield>
    <subfield code="7">0</subfield>
    <subfield code="8">REF</subfield>
    <subfield code="a">20000</subfield>
    <subfield code="b">20000</subfield>
    <subfield code="c">REF</subfield>
    <subfield code="d">2019-11-21</subfield>
    <subfield code="l">0</subfield>
    <subfield code="o">FKMP .F34 2019 r Thesis</subfield>
    <subfield code="p">T000000391</subfield>
    <subfield code="r">2021-01-07 00:00:00</subfield>
    <subfield code="w">2019-11-21</subfield>
    <subfield code="y">THESIS</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="2">lcc</subfield>
    <subfield code="4">0</subfield>
    <subfield code="7">1</subfield>
    <subfield code="8">REF</subfield>
    <subfield code="a">20000</subfield>
    <subfield code="b">20000</subfield>
    <subfield code="c">REF</subfield>
    <subfield code="d">2019-11-21</subfield>
    <subfield code="l">0</subfield>
    <subfield code="o">CD12365</subfield>
    <subfield code="p">T000000392</subfield>
    <subfield code="r">2021-02-16 00:00:00</subfield>
    <subfield code="w">2019-11-21</subfield>
    <subfield code="y">THESIS</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">91270</subfield>
    <subfield code="d">91276</subfield>
  </datafield>
  <controlfield tag="003">MY-KuUP</controlfield>
  <controlfield tag="005">20251125105434.0</controlfield>
  <controlfield tag="006">a||||fr|||| 000 0 </controlfield>
  <controlfield tag="007">ta</controlfield>
  <controlfield tag="008">191121t20192019my a|||fram|| 000 0 eng d</controlfield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="a">THE0008507(Local)</subfield>
  </datafield>
  <datafield tag="040" ind1=" " ind2=" ">
    <subfield code="a">UMP</subfield>
    <subfield code="b">eng</subfield>
    <subfield code="c">UMP</subfield>
    <subfield code="e">rda</subfield>
  </datafield>
  <datafield tag="090" ind1=" " ind2=" ">
    <subfield code="a">FKMP .F34 2019 r Thesis</subfield>
  </datafield>
  <datafield tag="100" ind1="0" ind2=" ">
    <subfield code="a">Faeiz Azizi Adnan,</subfield>
    <subfield code="e">author.</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
    <subfield code="a">Contour generation for mask projection stereolithography 3d printing /</subfield>
    <subfield code="c">Faeiz Azizi Adnan</subfield>
  </datafield>
  <datafield tag="264" ind1=" " ind2="1">
    <subfield code="a">Kuantan, Pahang :</subfield>
    <subfield code="b">UMP,</subfield>
    <subfield code="c">2019</subfield>
  </datafield>
  <datafield tag="264" ind1=" " ind2="4">
    <subfield code="a">&#xA9; 2019</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">xii, 101 pages :</subfield>
    <subfield code="b">illustrations (some color) ;</subfield>
    <subfield code="c">30 cm. +</subfield>
    <subfield code="e">1 CD-ROM</subfield>
  </datafield>
  <datafield tag="336" ind1=" " ind2=" ">
    <subfield code="a">text</subfield>
    <subfield code="2">rdacontent</subfield>
  </datafield>
  <datafield tag="336" ind1=" " ind2=" ">
    <subfield code="a">text</subfield>
    <subfield code="2">rdacontent</subfield>
  </datafield>
  <datafield tag="337" ind1=" " ind2=" ">
    <subfield code="a">unmediated</subfield>
    <subfield code="2">rdamedia</subfield>
  </datafield>
  <datafield tag="337" ind1=" " ind2=" ">
    <subfield code="a">computer</subfield>
    <subfield code="2">rdamedia</subfield>
  </datafield>
  <datafield tag="338" ind1=" " ind2=" ">
    <subfield code="a">volume</subfield>
    <subfield code="2">rdacarrier</subfield>
  </datafield>
  <datafield tag="338" ind1=" " ind2=" ">
    <subfield code="a">computer disc</subfield>
    <subfield code="2">rdacarrier</subfield>
  </datafield>
  <datafield tag="347" ind1=" " ind2=" ">
    <subfield code="2">rda</subfield>
    <subfield code="a">text file</subfield>
    <subfield code="b">PDF</subfield>
  </datafield>
  <datafield tag="500" ind1=" " ind2=" ">
    <subfield code="a">Faculty of Mechanical &amp; Manufacturing Engineering</subfield>
  </datafield>
  <datafield tag="502" ind1=" " ind2=" ">
    <subfield code="a">Thesis (Master of Science) -- Universiti Malaysia Pahang &#x2013; 2019</subfield>
  </datafield>
  <datafield tag="504" ind1=" " ind2=" ">
    <subfield code="a">Includes bibliographical references</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
    <subfield code="a">Recent advancement in 3D printing technology has led to the development of projection mask stereolithography 3D printing process. This process harnesses the power of UV light contour projection to cure photocurable resin. The contour projection is generated by slicing STL CAD model into layers of 2D contours which is then fed into the UV projection device layer-by-layer with respect to the build height. Generation of the layers are computationally intensive. Existing contour generation algorithm requires long computational time to generate the contour layers especially for high polygon models. This is because the existing approach has to slice and compute every single layer of the STL model before the printing process starts. In an effort to reduce the computational time, a new and faster algorithm is required. Thus, a real-time contour generation algorithm is presented in this research. The real-time contour generation approach instantly generates single layer of contour whenever the build height parameter is fed into the algorithm. The algorithm composes of multiple algorithms such as slicing algorithm, pixel line mapping algorithm, and the contour loop algorithm. The proposed slicing algorithm uses line-plane intersection model to generate arbitrary line segment when it receives an STL facet. These line segments are mapped based on the projection device display resolution by the pixel-line mapping algorithm. Then, the pixelated line segments are connected to form single/multiple contour loops using contour loop algorithm. The results of each algorithms are thoroughly evaluated. Computation time measurement is taken using &lt;QElapsedTimer&gt; object in Qt Creator and measured in milliseconds. It is later found that the algorithms able to correctly generates the contour projection layers. Even with the high polygon STL model, the contour generation algorithm able to perform on average 960.15% faster than Park algorithm and 169.18% faster than commercial software Slic3r.</subfield>
  </datafield>
  <datafield tag="610" ind1="2" ind2="0">
    <subfield code="a">Faculty of Mechanical &amp; Manufacturing Engineering</subfield>
    <subfield code="x">Dissertations</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Universities and colleges</subfield>
    <subfield code="x">Dissertations</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Theses</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="2">lcc</subfield>
    <subfield code="c">THESIS</subfield>
  </datafield>
</record>
