Demo Data from EDBT 2026 / reviewers in the wild / expert
Zhengdong Huang
dblp:45/6043
· DBLP profile ↗
14ranked-venue papers
3as first author
4since 2021 · last 2025
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 9 · 3 first-author · 1 since 2021Databases, data management, data science and information retrieval · 2 · 2 since 2021Artificial intelligence and machine learning · 1Computer networks · 1Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Computational science and engineering · 100% | |
| Computer graphics and multimedia
4 papers |
Geometric modeling and processing · 100% | |
| Theoretical computer science
1 paper |
Computational geometry · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Information retrieval · 100% |
Topics — the 7 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational science and engineering
structural optimization |
0.9 | 1 | 2025 | Extracting fiber paths from the optimized lamination parameters of variable-stiffness laminated shells based on physic-informed neural network · Comput. Aided Des. 2025 |
Computational geometry
geometric modeling and processing |
0.2 | 1 | 2013 | Partial retrieval of CAD models based on local surface region decomposition · Comput. Aided Des. 2013 |
Geometric modeling and processing › solid modeling
swept volume |
0.1 | 1 | 2006 | Feature conversion based on decomposition and combination of swept volumes · Comput. Aided Des. 2006 |
Information retrieval › multimedia analysis and retrieval
3d model retrieval |
0.0 | 1 | 2013 | Partial retrieval of CAD models based on local surface region decomposition · Comput. Aided Des. 2013 |
Information retrieval
multimedia analysis and retrieval |
0.0 | 1 | 2013 | Partial retrieval of CAD models based on local surface region decomposition · Comput. Aided Des. 2013 |
Geometric modeling and processing
feature recognition |
0.0 | 1 | 2002 | High-level feature recognition using feature relationship graphs · Comput. Aided Des. 2002 |
Geometric modeling and processing › computer-aided design
CAD model |
0.0 | 1 | 2009 | Extracting common design patterns from a set of solid models · Comput. Aided Des. 2009 |
Methods — techniques the papers use, named apart from their topics
physics-informed neural networks · 0.9surface decomposition · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Extracting fiber paths from the optimized lamination parameters of variable-stiffness laminated shells based on physic-informed neural network
Lujie Ma, Kuan Fan, Zhengdong Huang |
Comput. Aided Des. | 5 |
| 2024 | Spatial cooperative simulation of land use-population-economy in the Greater Bay Area, ChinaabstractFast urbanization brings great challenges to sustainable development goals, such as excessive exploitation and population explosion. Classical cellular automata (CA) have been widely used to independently simulate the change of spatial features, i.e. land use, population, economic production, etc. However, most CA models rely on historical data as static driving factors to simulate future scenarios while ignoring the inter-wined influences among multiple features in the development process. To address this issue, this study proposes a spatial cooperative simulation (SCS) approach to simulate the land use, population, and economy changes. The SCS approach starts with a separate CA model to obtain the initial scenes of each feature. Then, the simulation results of each other two features are used as dynamically updated driving factors, rather than the static historical data, to capture the inter-wined influence of multiple features during the development process. This step is iteratively performed until the changes of each feature converge and the final simulation results will be reported. The simulation experiment in Greater Bay Area demonstrates that the SCS approach can well capture the simultaneous development process and outperforms baseline approaches. The SCS approach is capable of forecasting future development scenarios and facilitates spatial planning and infrastructure synergies. Wei Tu 0001, Wei Gao 0048, Mingxiao Li 0001, Yao Yao 0004, Biao He 0007, Zhengdong Huang, Jie Zhang 0123, Renzhong Guo |
Int. J. Geogr. Inf. Sci. | 6 |
| 2023 | Developing a multiview spatiotemporal model based on deep graph neural networks to predict the travel demand by busabstractThe accurate prediction of travel demand by bus is crucial for effective urban mobility demand management. However, most models of travel demand prediction by bus tend to focus on the bus’s spatiotemporal dependencies, while ignoring the interactions between buses and other transportation modes, such as metros and taxis. We propose a Multiview Spatiotemporal Graph Neural Network (MSTGNN) model to predict short-term travel demand by bus. It emphasizes the ability to capture the interaction dependencies among the travel demand of buses, metros, and taxis. Firstly, a multiview graph consisting of bus, metro, and taxi views is constructed, with each view containing both a local and global graph. Secondly, a multiview attention-based temporal graph convolution module is developed to capture spatiotemporal and cross-view interaction dependencies among different transport modes. Especially, to address the uneven spatial distributions of features in multiview learning, the cross-view spatial feature consistency loss is introduced as an auxiliary loss. Finally, we conduct intensive experiments using a real-world dataset from Shenzhen, China. The results demonstrate that our proposed MSTGNN model performs better than the existing models. Ablation experiments validate the contributions of various modes of transportation to the improvement of the model’s performance. Tianhong Zhao, Zhengdong Huang, Wei Tu 0001, Filip Biljecki, Long Chen 0005 |
Int. J. Geogr. Inf. Sci. | 2 |
| 2022 | Optimizing Living Material Delivery During the COVID-19 OutbreakabstractThe coronavirus disease 2019 (COVID-19) epidemic has spread worldwide, posing a great threat to human beings. The stay-home quarantine is an effective way to reduce physical contacts and the associated COVID-19 transmission risk, which requires the support of efficient living materials (such as meats, vegetables, grain, and oil) delivery. Notably, the presence of potential infected individuals increases the COVID-19 transmission risk during the delivery. The deliveryman may be the medium through which the virus spreads among urban residents. However, traditional delivery route optimization methods don't take the virus transmission risk into account. Here, we propose a novel living material delivery route approach considering the possible COVID-19 transmission during the delivery. A complex network-based virus transmission model is developed to simulate the possible COVID-19 infection between urban residents and the deliverymen. A bi-objective model considering the COVID-19 transmission risk and the total route length is proposed and solved by the hybrid meta-heuristics integrating the adaptive large neighborhood search and simulated annealing. The experiment was conducted in Wuhan, China to assess the performance of the proposed approach. The results demonstrate that 935 vehicles will totally travel 56,424.55 km to deliver necessary living materials to 3,154 neighborhoods, with total risk [Formula: see text]. The presented approach reduces the risk of COVID-19 transmission by 67.55% compared to traditional distance-based optimization methods. The presented approach can facilitate a well response to the COVID-19 in the transportation sector. Tianhong Zhao, Wei Tu 0001, Zhixiang Fang, Zhengdong Huang, Shengwu Xiong 0001 |
IEEE Trans. Intell. Transp. Syst. | 5 |
| 2020 | Location and 3-D Visual Awareness-Based Dynamic Texture Updating for Indoor 3-D Modelabstract3-D visualization of location-based services (LBSs) in a geographic information system (GIS) and the Internet-of-Things (IoT) applications could enhance the user experience. Texture is generally the most noticeable visual element in a 3-D indoor model. However, it usually tends to be outdated and becomes inaccurate in complex and dynamic environments. The applications of such 3-D visualizations, especially in indoor environments, are further impeded by a limited capacity to represent frequently changing scenes due to object displacements. To overcome this problem, a novel location and 3-D visual awareness-based method is proposed to automatically register and update a live image onto a 3-D indoor model. In this method, a multisensor fusion-based indoor localization algorithm employs an indoor map to integrate multisource data, including activity detection information, pedestrian dead reckoning (PDR), and 3-D vision-based localization data. Based on the positioning results, we locate the region of the photograph capture within a scene and identify the triangular meshes of the facing wall. The texture is extracted from real-time images through a 3-D indoor understanding technique and automatically fused with the indoor 3-D model. The geometric relationship between texture and the 3-D indoor model is established by calculating the UV coordinates. The experimental results demonstrate that our approach can accurately update the dynamic indoor model textures regardless of the scene. Based on this texture updating technique, users experience an enhanced presentation of LBS information on our 3-D visualization platform. Wei Ma 0013, Qingquan Li 0001, Baoding Zhou, Weixing Xue, Zhengdong Huang |
IEEE Internet Things J. | 5 |
| 2019 | An effective approach for color video recovery based on balanced tensor
Chengfei Shi, Zhengdong Huang, Li Wan 0005, Tifan Xiong |
Signal Process. Image Commun. | 2 |
| 2013 | Partial retrieval of CAD models based on local surface region decomposition
Songqiao Tao, Zhengdong Huang, Lujie Ma, Shunsheng Guo, Youbai Xie |
Comput. Aided Des. | 2 |
| 2012 | Partial retrieval of CAD models based on the gradient flows in Lie group
Songqiao Tao, Zhengdong Huang, Bingquan Zuo, Yangping Peng, Weirui Kang |
Pattern Recognit. | 2 |
| 2010 | Automatic discovery of common design structures in CAD models
Lujie Ma, Zhengdong Huang |
Comput. Graph. | 2 |
| 2009 | Common design structure discovery from CAD modelsabstractThis paper presents a method to solve the problem of common design structure discovery from a large number of CAD models. First, a CAD model is transformed into a face adjacency graph (FAG) and each node of FAG is mapped to a point in two-dimensional plane after representing face shape information with two coordinates. So the shapes of models are directly compared through the point coordinates of FAGs' nodes. Thus, the common design structures are just the frequent appearing subgraphs of FAGs. Second, we develop an algorithm to discovery frequent subgraphs of FAGs. The main steps of the algorithm include: (1) frequent candidate subgraph generation based on merging of last discovered frequent subgraphs; (2)subgraph matching with graph descriptive code. The experiment shows a reasonable result of the discovered common design structures with our approach. Lujie Ma, Zhengdong Huang |
CAD/Graphics | 2 |
| 2009 | Extracting common design patterns from a set of solid models
Lujie Ma, Zhengdong Huang, Qingsong Wu |
Comput. Aided Des. | 2 |
| 2006 | Feature conversion based on decomposition and combination of swept volumes
Zhengdong Huang, Lujie Ma |
Comput. Aided Des. | 1 |
| 2004 | Solving CSG equations for checking equivalency between two different geometric models
Zhengdong Huang, Shaopeng Tian Ji Zhou |
Comput. Aided Des. | 1 |
| 2002 | High-level feature recognition using feature relationship graphs
Zhengdong Huang, Derek Yip-Hoi |
Comput. Aided Des. | 1 |