Rice Univesrity Logo
    • FAQ
    • Deposit your work
    • Login
    View Item 
    •   Rice Scholarship Home
    • Faculty & Staff Research
    • George R. Brown School of Engineering
    • Computer Science
    • Computer Science Technical Reports
    • View Item
    •   Rice Scholarship Home
    • Faculty & Staff Research
    • George R. Brown School of Engineering
    • Computer Science
    • Computer Science Technical Reports
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Fast Approximating Triangulation of Large Scattered Datasets

    Thumbnail
    Name:
    TR97-288.pdf
    Size:
    11.50Mb
    Format:
    PDF
    View/Open
    Author
    Warren, Joe; Weimer, Henrik
    Date
    September 3, 1997
    Abstract
    This report describes algorithms and data-structures for the fast construction of three-dimensional triangulations from large sets of scattered data-points. The triangulations have a guaranteed error bound, i.e. all the data-points lie within a pre-specified distance from the triangulation. Three different methods for choosing triangulation vertices are presented, based on interpolation, and L2 and L_infinity-optimization of the error over subsets of the data-points. The main focus of this report will be on devising a simple and fast algorithm for constructing an approximating triangulation of a very large set of points. We propose the use of adapted dynamic data structures and excessive caching of information to speed up the computation and show how the method can be extended to approximate multiple dependent datasets in higher-dimensional approximation problems.
    Citation
    Warren, Joe and Weimer, Henrik. "Fast Approximating Triangulation of Large Scattered Datasets." (1997) https://hdl.handle.net/1911/96472.
    Type
    Technical report
    Citable link to this page
    https://hdl.handle.net/1911/96472
    Rights
    You are granted permission for the noncommercial reproduction, distribution, display, and performance of this technical report in any format, but this permission is only for a period of forty-five (45) days from the most recent time that you verified that this technical report is still available from the Computer Science Department of Rice University under terms that include this permission. All other rights are reserved by the author(s).
    Metadata
    Show full item record
    Collections
    • Computer Science Technical Reports [245]

    Home | FAQ | Contact Us | Privacy Notice | Accessibility Statement
    Managed by the Digital Scholarship Services at Fondren Library, Rice University
    Physical Address: 6100 Main Street, Houston, Texas 77005
    Mailing Address: MS-44, P.O.BOX 1892, Houston, Texas 77251-1892
    Site Map

     

    Searching scope

    Browse

    Entire ArchiveCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsTypeThis CollectionBy Issue DateAuthorsTitlesSubjectsType

    My Account

    Login

    Statistics

    View Usage Statistics

    Home | FAQ | Contact Us | Privacy Notice | Accessibility Statement
    Managed by the Digital Scholarship Services at Fondren Library, Rice University
    Physical Address: 6100 Main Street, Houston, Texas 77005
    Mailing Address: MS-44, P.O.BOX 1892, Houston, Texas 77251-1892
    Site Map