Executing convex polytope queries on nD point clouds

•Efficient intersection algorithms for polytope querying on nD point clouds.•Easy-to-use polytope formulation for querying.•Illustrated by nD-simplex and nD-prism model for querying tests from 2D to 10D.•Solve perspective view selection and flood risk query efficiently using the polytope. Efficient...

Full description

Saved in:
Bibliographic Details
Published in:International journal of applied earth observation and geoinformation Vol. 105; p. 102625
Main Authors: Liu, Haicheng, Thompson, Rodney, van Oosterom, Peter, Meijers, Martijn
Format: Journal Article
Language:English
Published: Elsevier B.V 25.12.2021
Elsevier
Subjects:
algorithms
CPLEX
geometry
nD point clouds
Perspective view selection
Polytope query
risk
spatial data
Spatial data structures
nD point clouds
Spatial data structures
Perspective view selection
Polytope query
CPLEX
ISSN:1569-8432, 1872-826X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:•Efficient intersection algorithms for polytope querying on nD point clouds.•Easy-to-use polytope formulation for querying.•Illustrated by nD-simplex and nD-prism model for querying tests from 2D to 10D.•Solve perspective view selection and flood risk query efficiently using the polytope. Efficient spatial queries are frequently needed to extract useful information from massive nD point clouds. Most previous studies focus on developing solutions for orthogonal window queries, while rarely considering the polytope query. The latter query, which includes the widely adopted polygonal query in 2D, also plays a critical role in many nD spatial applications such as the perspective view selection. Aiming for an nD solution, this paper first formulates a convex nD-polytope for querying. Then, the paper integrates three approximate geometric algorithms – SWEEP, SPHERE, VERTEX, and a linear programming method CPLEX, developing a solution based on an Index-Organized Table (IOT) approach. IOT is applied with space filling curve based clustering and advanced querying mechanism which recursively refines hypercubic nD spaces to approach the query geometry for primary filtering. Results from experiments based on both synthetic and real data have confirmed the superior performance of SWEEP. However, the algorithm may lag behind CPLEX due to pessimistic intersection computation in high dimensional spaces. In a real application, by properly transforming a perspective view selection into a polytope query, the solution achieves a sub-second querying performance using SWEEP. In another flood risk query, SWEEP also leads the others. In general, the robust and efficient solution can be immediately used to address different polytope queries, including those abstract ones whose constraints on combinations of different dimensions are formed into a polytope model. Besides, the knowledge of high-dimensional computations acquired also provides significant guidance for handling more nD GIS issues.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1569-8432
1872-826X
DOI:10.1016/j.jag.2021.102625