default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShuangming Chai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j14]Rui-Zeng Li
, Jia-Peng Guo, Qi Wang, Shuangming Chai, Ligang Liu, Xiao-Ming Fu:
Interactive Editing of Discrete Chebyshev Nets. Comput. Graph. Forum 41(2): 111-120 (2022)- [j13]Wen-Xiang Zhang, Qi Wang, Jia-Peng Guo, Shuangming Chai, Ligang Liu, Xiao-Ming Fu:
Constrained Remeshing Using Evolutionary Vertex Optimization. Comput. Graph. Forum 41(2): 237-247 (2022) - [j12]Jinlin Yang, Shibo Liu, Shuangming Chai, Ligang Liu, Xiao-Ming Fu:
Precise High-order Meshing of 2D Domains with Rational Bézier Curves. Comput. Graph. Forum 41(5): 79-88 (2022) - [j11]Peng Wang, Yan Tian, Nali Liu, Jialei Wang, Shuangming Chai, Xun Wang, Ruili Wang:
A tooth surface design method combining semantic guidance, confidence, and structural coherence. IET Comput. Vis. 16(8): 727-735 (2022) - 2021
- [j10]Chi Zhang, Shuangming Chai, Ligang Liu, Xiao-Ming Fu:
Quad Meshing with Coarse Layouts for Planar Domains. Comput. Aided Des. 140: 103084 (2021) - [j9]Shuangming Chai, Xiao-Ming Fu, Ligang Liu:
Voting for Distortion Points in Geometric Processing. IEEE Trans. Vis. Comput. Graph. 27(4): 2469-2480 (2021) - 2020
- [j8]Chi Zhang, Mao-Feng Xu, Shuangming Chai, Xiao-Ming Fu:
Robust atlas generation via angle-based segmentation. Comput. Aided Geom. Des. 79: 101854 (2020) - [j7]Tianyu Zhu, Chunyang Ye, Shuangming Chai, Xiao-Ming Fu:
Greedy Cut Construction for Parameterizations. Comput. Graph. Forum 39(2): 191-202 (2020) - 2019
- [j6]Xiao-Xiang Cheng, Xiao-Ming Fu, Chi Zhang, Shuangming Chai:
Practical error-bounded remeshing by adaptive refinement. Comput. Graph. 82: 163-173 (2019) - [j5]Hao-Yu Liu, Xiao-Ming Fu, Chunyang Ye, Shuangming Chai, Ligang Liu:
Atlas refinement with bounded packing efficiency. ACM Trans. Graph. 38(4): 33:1-33:13 (2019) - [j4]Yang Yang, Xiao-Ming Fu, Shuangming Chai, Shiwei Xiao, Ligang Liu:
Volume-Enhanced Compatible Remeshing of 3D Models. IEEE Trans. Vis. Comput. Graph. 25(10): 2999-3010 (2019) - 2018
- [j3]Yang Yang, Shuangming Chai, Xiao-Ming Fu:
Computing interior support-free structure via hollow-to-fill construction. Comput. Graph. 70: 148-156 (2018) - [j2]Shuangming Chai, Xiao-Ming Fu, Xin Hu, Yang Yang, Ligang Liu:
Sphere-based cut construction for planar parameterizations. Comput. Graph. 74: 66-75 (2018) - [j1]Shuangming Chai, Baiyu Chen, Mengyu Ji, Zhouwang Yang, Manfred Lau, Xiao-Ming Fu, Ligang Liu:
Stress-oriented structural optimization for frame structures. Graph. Model. 97: 80-88 (2018)
Informal and Other Publications
- 2019
- [i1]Shuangming Chai, Xiao-Ming Fu, Ligang Liu:
Voting for Distortion Points in Geometric Processing. CoRR abs/1909.13066 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
