|
|
|
|
|
Kegong Shi, Jinjin Yan and Jinquan Yang
Reasonable semantic partition of indoor areas can improve space utilization, optimize property management, and enhance safety and convenience. Existing algorithms for such partitions have drawbacks, such as the inability to consider semantics, slow conve...
ver más
|
|
|
|
|
|
|
|
|
|
|
Bi Yu Chen, Huihuang Huang, Hui-Ping Chen, Wenxuan Liu, Xuan-Yan Chen and Tao Jia
The order k Voronoi diagram (OkVD) is an effective geometric construction to partition the geographical space into a set of Voronoi regions such that all locations within a Voronoi region share the same k nearest points of interest (POIs). Despite the br...
ver más
|
|
|
|
|
|
|
|
|
|
|
Fan Yang, You Li, Mingliang Che, Shihua Wang, Yingli Wang, Jiyi Zhang, Xinliang Cao and Chi Zhang
An increasing number of applications require the accurate 3D layout reconstruction of indoor environments. Various devices including laser scanners and color and depth (RGB-D) cameras can be used for this purpose and provide abundant and highly precise d...
ver más
|
|
|
|
|
|
|
|
|
|
|
Lei Yang, Jue Huang, Qi Gao, Yi Zhou, Minghua Hu and Hua Xie
Free Route Airspace (FRA) permits users to freely plan routes between defined entry and exit waypoints with the possibility of routing via intermediate waypoints, which is beneficial to improve flight efficiency. Dynamic management of sectors is essentia...
ver más
|
|
|
|
|
|
|
|
|
|
|
Dang-Viet-Anh Nguyen, Jérôme Szewczyk and Kanty Rabenorosoa
We propose a novel algorithm to determine the Euclidean shortest path (ESP) from a given point (source) to another point (destination) inside a tubular space. The method is based on the observation data of a virtual particle (VP) assumed to move along th...
ver más
|
|
|
|
|
|
|
|
|
|
|
Aurelien Bloch, Simone Casale-Brunet and Marco Mattavelli
The performance of programs executed on heterogeneous parallel platforms largely depends on the design choices regarding how to partition the processing on the various different processing units. In other words, it depends on the assumptions and paramete...
ver más
|
|
|
|
|
|
|
|
|
|
|
Yinan Chen, Chuanpeng Wang and Dong Li
Complex networks usually consist of dense-connected cliques, which are defined as communities. A community structure is a reflection of the local characteristics existing in the network topology, this makes community detection become an important researc...
ver más
|
|
|
|
|
|
|
|
|
|
|
Yan Yan, Zichao Sun, Adnan Mahmood, Fei Xu, Zhuoyue Dong and Quan Z. Sheng
Statistical partitioning and publishing is commonly used in location-based big data services to address queries such as the number of points of interest, available vehicles, traffic flows, infected patients, etc., within a certain range. Adding noise per...
ver más
|
|
|
|
|
|
|
|
|
|
|
Xiangqiang Min, Dieter Pfoser, Andreas Züfle and Yehua Sheng
The range query is one of the most important query types in spatial data processing. Geographic information systems use it to find spatial objects within a user-specified range, and it supports data mining tasks, such as density-based clustering. In many...
ver más
|
|
|
|
|
|
|
|
|
|
|
Enrico Romanschek, Christian Clemen and Wolfgang Huhnt
A novel approach for a robust computation of positional relations of two-dimensional geometric features is presented which guarantees reliable results, provided that the initial data is valid. The method is based on the use of integer coordinates and a m...
ver más
|
|
|
|
|
|