Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Faculty of Construction and Environment | en_US |
| dc.contributor.advisor | Shi, Wen-zhong John (LSGI) | - |
| dc.creator | Cunningham, Cory | - |
| dc.identifier.uri | https://theses.lib.polyu.edu.hk/handle/200/10560 | - |
| dc.language | English | en_US |
| dc.publisher | Hong Kong Polytechnic University | - |
| dc.rights | All rights reserved | en_US |
| dc.title | Modelling indoor 3D point clouds by establishing a linear frame of reference using virtual traverse lines | en_US |
| dcterms.abstract | Point clouds are very large datasets with no theoretical limit to their size or scale. This presents an often encountered problem of too much data. For the purpose of efficient visualization and analysis, it is beneficial to implement techniques to filter out only the useful points for the purposes of a particular application or desired visualization. One such method is extracting sharp edges from the point cloud data. These are line features that indicate significant differences in surfaces triangulated from the points, such as a Triangular Irregular Network approach (TIN). However, in the context of a very large-scale three dimensional mapping undertaking, such as developing a city-scale 3D geodatabase, the extracted lines will inevitably still amount to a very large amount of data, making efficient visualization and computations cumbersome. Additionally, by definition the edge points are highly clustered, which adversely affects performance of k-d tree based querying. A novel approach to model a point cloud of a building interior area will be presented using virtual traverse lines as a kind of linear-referencing. If this approach is feasible one general benefit is that the virtual traverse lines can be used for applications that are more typical of vector data, without the potential size burden that alternative models may require. In fact, the model obtained using a virtual traverse approach would be highly scalable. At its most simplistic level, a traverse-based model could be nothing more than a single line skeleton of the interior network, while still attaining topological information that could be used for routing and navigation. With minimal resolution there may also be possibilities for quickly obtaining area or volume estimates for a given network segment. | en_US |
| dcterms.extent | 57 pages : color illustrations | en_US |
| dcterms.isPartOf | PolyU Electronic Theses | en_US |
| dcterms.issued | 2018 | en_US |
| dcterms.educationalLevel | M.Sc. | en_US |
| dcterms.educationalLevel | All Master | en_US |
| dcterms.LCSH | Image processing -- Digital techniques | en_US |
| dcterms.LCSH | Three-dimensional imaging | en_US |
| dcterms.LCSH | Three-dimensional imaging in geology | en_US |
| dcterms.LCSH | Hong Kong Polytechnic University -- Dissertations | en_US |
| dcterms.accessRights | restricted access | en_US |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 991022385341603411.pdf | For All Users (off-campus access for PolyU Staff & Students only) | 1.36 MB | Adobe PDF | View/Open |
Copyright Undertaking
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
- I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.
Please use this identifier to cite or link to this item:
https://theses.lib.polyu.edu.hk/handle/200/10560