Mengyun Zhou

China University of Geosciences

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Trends

Author Order

Document Type

Co-Authors

Jing Chen

Wuhan University

Xiaoyu Chen

China University of Geosciences

Jianya Gong

Wuhan University

Guangming Dai

China University of Geosciences

Weichao Gu

China University of Geosciences

Tian Tian

Xi'an Siyuan University

Yonghua Pang

Weatherford College

Qingfeng Guan

China University of Geosciences

Yiming Shao

Hangzhou Dianzi University

Rongyu Tang

State Key Laboratory on Integrated Optoelectronics

Cooperative Institutions

China University of Geosciences

Wuhan University

State Key Laboratory of Information Engineering in Surveying Mapping and Remote Sensing

China University of Geosciences (Beijing)

Chinese Academy of Sciences

Huazhong University of Science and Technology

Tsinghua University

Northwestern Polytechnical University

Anhui Medical University

China University of Petroleum, Beijing

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Field

A 25-Intersection Model for Representing Topological Relations between Simple Spatial Objects in 3-D Space

ISPRS International Journal of Geo-Information (2019)

Mengyun Zhou Qingfeng Guan

With the rapid development of the economy, urgent needs for 3-D Geographical Information System (GIS) have sprung up in many application fields. The precise expression of three-dimensional topological relations is the foundation of spatial analysis, topological query, and spatial reasoning in three-dimensional space. In this paper, we subdivide the topological part “boundary” into face, edge, and vertex and propose a 25-intersection model (25IM) to represent topological relations between two simple spatial objects (point, line, region, and body) in 3-D space. An object in the 25IM has five topological parts: vertex, edge, face, interior, and exterior. The classification of topological relations is simplified by merging contain/inside and cover/coveredby. The 25IM describes ten groups of topological relations: body/body, body/region, body/line, body/point, region/region, region/line, region/point, line/line, line/point, and point/point. The 25IM is demonstrated to be more expressive than the 9IM and the DE-9IM, especially in distinguishing the detail situations when one object meets/covers another object (e.g., two bodies meet/cover at vertex, edge, or face).

Line (geometry)

10.3390/ijgi8040182

Cite

Citations (9)

Development of space virtual laboratory and simulation system

cosp (2006)

Rui Yang Xiangwei Deng Rongyu Tang Yiming Shao Yuan Ma

Virtual Laboratory

Source

Cite

Citations (0)

Tile‐based polygon overlay of vector data in a virtual globe

Transactions in GIS (2020)

Mengyun Zhou Lizhe Wang Xiaoyu Chen Si Wu Huawei Li

Abstract The demand for analysis of large‐scale data has increased with increased access to spatial vector data. Polygon overlay of vector data in a virtual globe requires proprietary data structures and proprietary analysis algorithms. A vector data structure is designed for rapid polygon overlay in a virtual globe by recording the metadata of the triangles (TriMeta) that constitute polygons. A polygon overlay algorithm is proposed based on this data structure. The overlay of two complex GIS polygons is transformed into the intersection computation of their 3D triangular presentations. The intersection computation of two sets of triangles is reduced considerably by utilizing TriMeta to filter out the disjoint triangle pairs and rapidly identify the contained triangle. The new method improves the overlay efficiency in a virtual globe because the amount of computation required to calculate the intersections of two large polygons and drape the intersections onto a terrain surface is reduced.

Polygon (computer graphics)

Visibility polygon

10.1111/tgis.12618

Cite

Citations (1)

Rendering interior-filled polygonal vector data in a virtual globe

International Journal of Geographical Information Science (2016)

Mengyun Zhou Jing Chen Jianya Gong

Polygonal vector data are important for representing countries, lakes, residential settlements, and other polygonal features. The proper representation of polygonal vector data is the basis of efficient rendering and picking and quick access and display of the analysis results based on polygons (e.g., 3D overlaying and surface area measurement in mountainous areas) in a virtual globe. However, polygonal vector data are displayed using texture-based or boundary-based approaches in most existing virtual globes. The texture-based approach cannot easily support interactive operations (e.g., picking) and spatial analysis (e.g., adjacency analysis and spatial measurement). The boundary-based approach treats the holes as independent features; however, it is difficult to recognize which boundaries constitute a polygon. Further research is needed on how to better organize the polygons to support efficient rendering, picking, and analysis in a virtual globe. In this article, we propose two methods to drape interior filled 2D polygons onto a multi-resolution 3D terrain. Both proposed methods combine polygon clipping and polygon triangulation. The difference between the two methods is in the way holes are eliminated. Method 1 recursively subdivides a terrain triangle until the child-triangles contain no holes; every resulting clipped polygon, which is then triangulated, contains no holes. Method 2 directly clips a polygon against a terrain triangle and creates bridge edges to transform the resulting polygons with holes to degenerate polygons that are further triangulated. The experimental results demonstrate that both proposed methods can efficiently process polygons with holes resulting in appropriate numbers of triangles. The processed interior-filled polygons remain close to the terrain surface in a virtual globe. Both proposed methods support real-time rendering of polygonal vector data in a virtual globe.

Polygon (computer graphics)

Point in polygon

Rectilinear polygon

10.1080/13658816.2016.1165819

Cite

Citations (5)

A virtual globe-based vector data model: quaternary quadrangle vector tile model

International Journal of Digital Earth (2015)

Mengyun Zhou Jing Chen Jianya Gong

This study proposes a virtual globe-based vector data model named the quaternary quadrangle vector tile model (QQVTM) in order to better manage, visualize, and analyze massive amounts of global multi-scale vector data. The model integrates the quaternary quadrangle mesh (a discrete global grid system) and global image, terrain, and vector data. A QQVTM-based organization method is presented to organize global multi-scale vector data, including linear and polygonal vector data. In addition, tile-based reconstruction algorithms are designed to search and stitch the vector fragments scattered in tiles to reconstruct and store the entire vector geometries to support vector query and 3D analysis of global datasets. These organized vector data are in turn visualized and queried using a geometry-based approach. Our experimental results demonstrate that the QQVTM can satisfy the requirements for global vector data organization, visualization, and querying. Moreover, the QQVTM performs better than unorganized 2D vectors regarding rendering efficiency and better than the latitude–longitude-based approach regarding data redundancy.

Vector map

Quadrangle

Vector graphics

Curl (programming language)

Direction vector

Euclidean vector

10.1080/17538947.2015.1016558

Cite

Citations (24)

A binocular parallel rendering method for VR globes

International Journal of Digital Earth (2019)

Wumeng Huang Jing Chen Mengyun Zhou

The scene-rendering mechanism based on binocular vision is one of the key techniques for the VR globe to achieve immersion-type visualization of global 3D scenes. However, this special rendering mechanism also requires that the 3D scene is continuously drawn twice within one frame, which significantly affects the rendering efficiency of VR globes. Therefore, we propose a binocular parallel rendering method. This method first improves the current rendering process of VR globes by assigning the rendering tasks for the left and right camera of VR to be processed on different CPU cores, thereby achieving parallel rendering of binocular scenes. Second, due to the problem of inconsistent resolution of binocular scenes caused by different viewpoints for the left and right cameras, we propose a resolution synchronize algorithm. this algorithm conducts real-time synchronization on the resolution of scene in the rendering process and thus avoids the problem of erroneous binocular stereo matching. Finally, we validate the effectiveness of the method in this paper through experiments. The results of experiments indicate that while the method in this paper can ensure the consistency of binocular scene resolution, it can decrease the frame time of VR globes by approximately 27% on average.

Frame rate

Parallel rendering

Binocular disparity

10.1080/17538947.2019.1620883

Cite

Citations (6)

A pole-oriented discrete global grid system: Quaternary quadrangle mesh

Computers & Geosciences (2013)

Mengyun Zhou Jing Chen Jianya Gong

10.1016/j.cageo.2013.08.012

Cite

Citations (13)

Characteristic area-based method for continuous coverage analysis of satellites constellation

IEEE Transactions on Aerospace and Electronic Systems (2023)

Mengyun Zhou Zhiming Song Guangming Dai Maocai Wang Xiaoyu Chen

Coverage capacity analysis of satellites constellation is the basis of satellite system design and performance evaluation, which is essential in the application of satellite technology. A characteristic area based method for continuous coverage analysis is proposed in this paper. The trajectory characteristics of the Walker constellation are first analyzed. The Earth's surface is partitioned into a group of characteristic areas, and the characteristic distance theory is defined and proposed accordingly. On this basis, the formulations of the characteristic point of each characteristic area and the corresponding characteristic distance with all different situations can be analytically obtained. Additionally, sufficient and necessary conditions for continuous coverage are given accordingly. The complex continuous coverage problem can be converted to the analysis of the relations between the critical geocentric angle of the satellite coverage range and the characteristic distance. Computational results indicate the effectiveness of the proposed method and reveal the feasibility in instructing the constellation design.

Satellite constellation

Basis (linear algebra)

10.1109/taes.2023.3287155

Cite

Citations (2)

Data-Driven Collaborative Scheduling Method for Multi-Satellite Data-Transmission

Tsinghua Science & Technology (2024)

Xiaoyu Chen Weichao Gu Guangming Dai Lining Xing Tian Tian

10.26599/tst.2023.9010131

Cite

Citations (4)