<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="/oai-pmh.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-09-25T12:00:09Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/46588" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/46588</identifier>
        <datestamp>2023-07-11</datestamp>
        <setSpec>col_2142_5131</setSpec>
        <setSpec>col_2142_10761</setSpec>
        <setSpec>com_2142_5130</setSpec>
        <setSpec>com_2142_10755</setSpec>
        <setSpec>com_2142_234</setSpec>
      </header>
      <metadata>
        <thesis xmlns="http://www.ndltd.org/standards/metadata/etdms/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/" xsi:schemaLocation="http://www.ndltd.org/standards/metadata/etdms/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdms11.xsd http://purl.org/dc/elements/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdmsdc.xsd">
          <dc:subject>vision</dc:subject>
          <dc:contributor>Hart, John C.</dc:contributor>
          <dc:contributor>Hart, John C.</dc:contributor>
          <dc:contributor>Forsyth, David A.</dc:contributor>
          <dc:contributor>Hoiem, Derek W.</dc:contributor>
          <dc:contributor>Stroila, Matei</dc:contributor>
          <dc:creator>Lu, Victor</dc:creator>
          <dc:date>2014-01-16T17:55:16Z</dc:date>
          <dc:date>2014-01-16T17:55:16Z</dc:date>
          <dc:date>2013-12</dc:date>
          <dc:date>2014-01-16T17:55:16Z</dc:date>
          <dc:date>2013-12</dc:date>
          <dc:description>The k-d tree is widely used in graphics and vision applications for accelerating retrieval from large sets of geometric entities in R^k. Despite speeding up an otherwise brute force search, the time to construct and traverse the k-d tree remain a bottleneck in many applications. Increasing parallelism in modern processors offers hope for further speedups. But while traversal is easily parallelized over a large number of queries, construction is not as easily parallelized and will become a serial bottleneck if left unparallelized. This thesis studies parallel k-d tree construction and its applications. The results are new multicore parallelizations of SAH k-d tree and FLANN k-d tree variants, and new ways of utilizing these parallelizations for accelerating object detection and scripting point algorithms.</dc:description>
          <dc:description>Item withdrawn by Laura Spradlin (lspradl2@illinois.edu) on 2013-11-21T17:23:05Z
Item was in collections:
University of Illinois Theses &amp; Dissertations (ID: 1)
No. of bitstreams: 1
Lu_Victor.pdf: 4681223 bytes, checksum: 28512effd9a0cb023c991ef48f5577d6 (MD5)</dc:description>
          <dc:description>Made available in DSpace on 2014-01-16T17:55:16Z (GMT). No. of bitstreams: 2
Victor_Lu.pdf: 4680955 bytes, checksum: 368b0f882a3da85d8446a0edf6b8b352 (MD5)
license.txt: 4059 bytes, checksum: f1efa4724423d20fef5fbf8964232842 (MD5)</dc:description>
          <dc:identifier>http://hdl.handle.net/2142/46588</dc:identifier>
          <dc:language>en</dc:language>
          <dc:rights>Copyright 2013 Victor Lu</dc:rights>
          <dc:subject>computer graphics</dc:subject>
          <dc:subject>spatial data structures</dc:subject>
          <dc:subject>k-d trees</dc:subject>
          <dc:subject>multicore</dc:subject>
          <dc:subject>parallel algorithms</dc:subject>
          <dc:subject>ray-tracing</dc:subject>
          <dc:subject>nearest neighbor search</dc:subject>
          <dc:subject>image search</dc:subject>
          <dc:subject>object detection</dc:subject>
          <dc:subject>point cloud processing</dc:subject>
          <dc:title>Multicore construction of k-d trees with applications in graphics and vision</dc:title>
          <dc:type>text</dc:type>
          <degree>
            <department>Computer Science</department>
            <departmentCode>1434</departmentCode>
            <discipline>Computer Science</discipline>
            <disciplineCode>0112</disciplineCode>
            <grantor>University of Illinois at Urbana-Champaign</grantor>
            <level>Dissertation</level>
            <name>Ph.D.</name>
            <program>PHD:Computer Science -UIUC</program>
            <programCode>10KS0112PHD</programCode>
          </degree>
        </thesis>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
