Wen-Yong Gong
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Wen-Yong Gong has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Baoquan Chen
Peking University, Beijing, China
1 shared publication - Daniel Cohen-Or
Shenzhen University, Shenzhen, China
1 shared publication - Kai Tang
Smart Manufacturing Thrust, The Hong Kong University of Science and Technology (Guangzhou), Guangzhou, China
1 shared publication - Kai Xu
Institute of AI for Industries, Chinese Academy of Sciences, Nanjing, China
1 shared publication - Niloy J. Mitra
University College London
1 shared publication - Qi Su
Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences
1 shared publication
Latest Publications
- 26 February 2014
- Published by Wiley in Journal of Computing and Information Science in Engineering
- Vol. 14 (2) , 021002
Variational Discrete Developable Surface Interpolation
Modeling using developable surfaces plays an important role in computer graphics and computer aided design. In this paper, we investigate a new problem called variational developable surface interpolation (VDSI). For a polyline boundary P, different from previous work on interpolation or approximation of discrete developable surfaces from P, the VDSI interpolates a subset of the vertices of P and approximates the rest. Exactly speaking, the VDSI allows to modify a subset of vertices within a prescribed bound such that a better discrete developable surface interpolates the modified polyline boundary. Therefore, VDSI could be viewed as a hybrid of interpolation and approximation. Generally, obtaining discrete developable surfaces for given polyline boundaries are always a time-consuming task. In this paper, we introduce a dynamic programming method to quickly construct a developable surface for any boundary curves. Based on the complexity of VDSI, we also propose an efficient optimization scheme to solve the variational problem inherent in VDSI. Finally, we present an adding point condition, and construct a G1 continuous quasi-Coons surface to approximate a quadrilateral strip which is converted from a triangle strip of maximum developability. Diverse examples given in this paper demonstrate the efficiency and practicability of the proposed methods.
- 26 February 2014
- Published by Wiley in Journal of Computing and Information Science in Engineering
- Vol. 14 (2) , 021002
Variational Discrete Developable Surface Interpolation
Modeling using developable surfaces plays an important role in computer graphics and computer aided design. In this paper, we investigate a new problem called variational developable surface interpolation (VDSI). For a polyline boundary P, different from previous work on interpolation or approximation of discrete developable surfaces from P, the VDSI interpolates a subset of the vertices of P and approximates the rest. Exactly speaking, the VDSI allows to modify a subset of vertices within a prescribed bound such that a better discrete developable surface interpolates the modified polyline boundary. Therefore, VDSI could be viewed as a hybrid of interpolation and approximation. Generally, obtaining discrete developable surfaces for given polyline boundaries are always a time-consuming task. In this paper, we introduce a dynamic programming method to quickly construct a developable surface for any boundary curves. Based on the complexity of VDSI, we also propose an efficient optimization scheme to solve the variational problem inherent in VDSI. Finally, we present an adding point condition, and construct a G1 continuous quasi-Coons surface to approximate a quadrilateral strip which is converted from a triangle strip of maximum developability. Diverse examples given in this paper demonstrate the efficiency and practicability of the proposed methods.
- 16 October 2013
- Published by Wiley in Computer Graphics Forum
- Vol. 32 (8) , 233-245
Sketch‐to‐Design: Context‐Based Part Assembly
Designing 3D objects from scratch is difficult, especially when the user intent is fuzzy and lacks a clear target form. We facilitate design by providing reference and inspiration from existing model contexts. We rethink model design as navigating through different possible combinations of part assemblies based on a large collection of pre‐segmented 3D models. We propose an interactive sketch‐to‐design system, where the user sketches prominent features of parts to combine. The sketched strokes are analysed individually, and more importantly, in context with the other parts to generate relevant shape suggestions via adesign galleryinterface. As a modelling session progresses and more parts get selected, contextual cues become increasingly dominant, and the model quickly converges to a final form. As a key enabler, we use pre‐learned part‐based contextual information to allow the user to quickly explore different combinations of parts. Our experiments demonstrate the effectiveness of our approach for efficiently designing new variations from existing shape collections.
- 16 October 2013
- Published by Wiley in Computer Graphics Forum
- Vol. 32 (8) , 233-245
Sketch‐to‐Design: Context‐Based Part Assembly
Designing 3D objects from scratch is difficult, especially when the user intent is fuzzy and lacks a clear target form. We facilitate design by providing reference and inspiration from existing model contexts. We rethink model design as navigating through different possible combinations of part assemblies based on a large collection of pre‐segmented 3D models. We propose an interactive sketch‐to‐design system, where the user sketches prominent features of parts to combine. The sketched strokes are analysed individually, and more importantly, in context with the other parts to generate relevant shape suggestions via adesign galleryinterface. As a modelling session progresses and more parts get selected, contextual cues become increasingly dominant, and the model quickly converges to a final form. As a key enabler, we use pre‐learned part‐based contextual information to allow the user to quickly explore different combinations of parts. Our experiments demonstrate the effectiveness of our approach for efficiently designing new variations from existing shape collections.