default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMin Tang 0004
Person information
- affiliation: Ewha Womans University, Seoul, Republic of Korea
Other persons with the same name
- Min Tang — disambiguation page
- Min Tang 0001 — Zhejiang University, College of Computer Science and Technology, China
- Min Tang 0002
![[0000-0002-1275-6185]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-1275-6185")
— Shanghai Jiao Tong University, Institute of Natural Sciences and Department of Mathematics, China - Min Tang 0003 — Hohai University, Nanjing, China
- Min Tang 0005 — Massachusetts Institute of Technology, Cambridge, MA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[i1]Changsoo Je, Min Tang, Youngeun Lee, Minkyoung Lee, Young J. Kim:
PolyDepth: Real-time Penetration Depth Computation using Iterative Contact-Space Projection. CoRR abs/1508.06181 (2015)- 2014
- [j4]Min Tang, Young J. Kim:
Interactive generalized penetration depth computation for rigid and articulated models using object norm. ACM Trans. Graph. 33(1): 1:1-1:15 (2014) - [j3]Min Tang, Dinesh Manocha, Young J. Kim:
Hierarchical and Controlled Advancement for Continuous Collision Detectionof Rigid and Articulated Models. IEEE Trans. Vis. Comput. Graph. 20(5): 755-766 (2014) - 2013
- [c4]Yi Li, Min Tang, Sanyuan Zhang, Young J. Kim:
Six-degree-of-freedom haptic rendering using translational and generalized penetration depth computation. World Haptics 2013: 289-294 - 2012
- [j2]Changsoo Je, Min Tang, Youngeun Lee, Minkyoung Lee, Young J. Kim:
PolyDepth: Real-time penetration depth computation using iterative contact-space projection. ACM Trans. Graph. 31(1): 5:1-5:14 (2012) - 2010
- [c3]Min Tang, Young J. Kim, Dinesh Manocha:
Continuous collision detection for non-rigid contact computations using local advancement. ICRA 2010: 4016-4021 - [c2]Min Tang, Young J. Kim, Dinesh Manocha:
CCQ: Efficient Local Planning Using Connection Collision Query. WAFR 2010: 229-247
2000 – 2009
- 2009
- [j1]Min Tang, Minkyoung Lee, Young J. Kim:
Interactive Hausdorff distance computation for general polygonal models. ACM Trans. Graph. 28(3): 74 (2009) - [c1]Min Tang, Young J. Kim, Dinesh Manocha:
C2A: Controlled conservative advancement for continuous collision detection of polygonal models. ICRA 2009: 849-854
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-11-14 00:49 CET 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:
