• Login
    View Item 
    •   Home
    • University of Alaska Fairbanks
    • UAF Graduate School
    • Computer Science
    • View Item
    •   Home
    • University of Alaska Fairbanks
    • UAF Graduate School
    • Computer Science
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of Scholarworks@UACommunitiesPublication DateAuthorsTitlesSubjectsTypeThis CollectionPublication DateAuthorsTitlesSubjectsType

    My Account

    Login

    First Time Submitters, Register Here

    Register

    Statistics

    Display statistics

    Closest pair optimization on modern hardware

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    Bright_J_2019.pdf
    Size:
    2.080Mb
    Format:
    PDF
    Download
    Author
    Bright, Jason
    Chair
    Chappell, Glenn G.
    Committee
    Lawlor, Orion
    Hartman, Chris
    Metadata
    Show full item record
    URI
    http://hdl.handle.net/11122/10940
    Abstract
    In this project we examine the performance of several algorithms for finding the closest pair of points out of a given set of points in a plane. We look at four algorithms, including brute force, recursive, non-recursive, and a random expected linear time for numbers of points ranging from one hundred to one billion. In our examination, we find that on average the non-recursive is the fastest, except for limited cases of 100 points for the brute force, and 32 bit spaces for the random expected linear.
    Description
    Master's Project (M.S.) University of Alaska Fairbanks, 2019
    Date
    2019-05
    Type
    Master's Project
    Collections
    Computer Science

    entitlement

     
    ABOUT US|HELP|BROWSE|ADVANCED SEARCH

    The University of Alaska Fairbanks is an affirmative action/equal opportunity employer and educational institution and is a part of the University of Alaska system.

    ©UAF 2013 - 2023 | Questions? ua-scholarworks@alaska.edu | Last modified: September 25, 2019

    Open Repository is a service operated by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.