default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTiow Seng Tan
2020 – today
- 2020
[i2]Zhenghai Chen, Tiow Seng Tan, Hong-Yang Ong:
On Designing GPU Algorithms with Applications to Mesh Refinement. CoRR abs/2007.00324 (2020)
2010 – 2019
- 2019
- [c30]Zhenghai Chen, Tiow Seng Tan:
Computing Three-Dimensional Constrained Delaunay Refinement Using the GPU. PACT 2019: 409-420 - [i1]Zhenghai Chen, Tiow Seng Tan:
Computing Three-dimensional Constrained Delaunay Refinement Using the GPU. CoRR abs/1903.03406 (2019) - 2017
- [j17]Mingcen Gao, Thanh-Tung Cao, Tiow Seng Tan:
Flip to Regular Triangulation and Convex Hull. IEEE Trans. Vis. Comput. Graph. 23(2): 1056-1069 (2017) - [c29]Zhenghai Chen, Meng Qi, Tiow Seng Tan:
Computing delaunay refinement using the GPU. I3D 2017: 11:1-11:9 - 2016
- [r1]Tiow Seng Tan:
Optimal Triangulation. Encyclopedia of Algorithms 2016: 1474-1477 - 2015
- [j16]Thanh-Tung Cao, Herbert Edelsbrunner, Tiow Seng Tan:
Triangulations from topologically correct digital Voronoi diagrams. Comput. Geom. 48(7): 507-519 (2015) - 2014
- [c28]Thanh-Tung Cao, Ashwin Nanjappa, Mingcen Gao, Tiow Seng Tan:
A GPU accelerated algorithm for 3D Delaunay triangulation. I3D 2014: 47-54 - 2013
- [j15]Mingcen Gao, Thanh-Tung Cao, Ashwin Nanjappa, Tiow Seng Tan, Zhiyong Huang:
gHull: A GPU algorithm for 3D convex hull. ACM Trans. Math. Softw. 40(1): 3:1-3:19 (2013) - [j14]Meng Qi, Thanh-Tung Cao, Tiow Seng Tan:
Computing 2D Constrained Delaunay Triangulation Using the GPU. IEEE Trans. Vis. Comput. Graph. 19(5): 736-748 (2013) - [c27]Mingcen Gao, Thanh-Tung Cao, Tiow Seng Tan, Zhiyong Huang:
Flip-flop: convex hull construction via star-shaped polyhedron in 3D. I3D 2013: 45-54 - 2012
- [c26]Meng Qi, Thanh-Tung Cao, Tiow Seng Tan:
Computing 2D constrained Delaunay triangulation using the GPU. I3D 2012: 39-46 - 2011
- [j13]Lu Wang, Tiow Seng Tan, Chi-Wan Lim, Xiangxu Meng, Cheng Du, Zhen-fang Ji:
Efficient implementation of point set reconstruction by multi-layer peeling algorithm. Comput. Graph. 35(2): 208-217 (2011) - [c25]Mingcen Gao, Thanh-Tung Cao, Tiow Seng Tan, Zhiyong Huang:
gHull: a three-dimensional convex hull algorithm for graphics hardware. SI3D 2011: 204 - 2010
- [c24]Thanh-Tung Cao, Ke Tang, Anis Mohamed, Tiow Seng Tan:
Parallel Banding Algorithm to compute exact distance transform with the GPU. SI3D 2010: 83-90
2000 – 2009
- 2009
- [j12]Adrian Nistor, Wei-Ngan Chin, Tiow Seng Tan, Nicolae Tapus
:
Optimizing the parallel computation of linear recurrences using compact matrix representations. J. Parallel Distributed Comput. 69(4): 373-381 (2009) - 2008
- [j11]Subramanian Ramanathan, Ashraf A. Kassim, Tiow Seng Tan:
Impact of vertex clustering on registration-based 3D dynamic mesh coding. Image Vis. Comput. 26(7): 1012-1026 (2008) - [c23]Guodong Rong, Tiow Seng Tan, Thanh-Tung Cao, Stephanus:
Computing two-dimensional Delaunay triangulation using graphics hardware. SI3D 2008: 89-97 - 2007
- [c22]Yang Li, Tiow Seng Tan, Ihar Volkau, Wieslaw L. Nowinski:
Model-Guided Segmentation of 3D Neuroradiological Image Using Statistical Surface Wavelet Model. CVPR 2007 - [c21]Guodong Rong, Tiow Seng Tan:
Variants of Jump Flooding Algorithm for Computing Discrete Voronoi Diagrams. ISVD 2007: 176-181 - 2006
- [j10]Chi-Wan Lim, Tiow Seng Tan:
Surface reconstruction by layer peeling. Vis. Comput. 22(9-11): 593-603 (2006) - [c20]Guodong Rong, Tiow Seng Tan:
Jump flooding in GPU with applications to Voronoi diagram and distance transform. SI3D 2006: 109-116 - [c19]Guodong Rong, Tiow Seng Tan:
Utilizing jump flooding in image-based soft shadows. VRST 2006: 173-180 - 2005
- [c18]Chu-Ming Ng, Cam-Thach Nguyen, Dinh-Nguyen Tran, Tiow Seng Tan, Shin-We Yeow:
Analyzing pre-fetching in large-scale visual simulation. Computer Graphics International 2005: 100-107 - [c17]Tuen-Young Ng, Conghua Wen, Tiow Seng Tan, Xinyu Zhang, Young J. Kim:
Generating an ω-tile set for texture synthesis. Computer Graphics International 2005: 177-184 - [c16]Keen-Han Wong, Xin Ouyang, Chi-Wan Lim, Tiow Seng Tan, Jürg Nievergelt:
Rendering anti-aliased line segments. Computer Graphics International 2005: 198-205 - [c15]Yongguan Xiao, Tiow Seng Tan, Seng Chuan Tay:
Utilizing edge to extract roads in high-resolution satellite imagery. ICIP (1) 2005: 637-640 - 2004
- [c14]Yongguan Xiao, Soo Kuan Lim, Tiow Seng Tan, Seng Chuan Tay:
Feature extraction using very high resolution satellite imagery. IGARSS 2004: 2004-2007 - [c13]Tobias Martin, Tiow Seng Tan:
Anti-aliasing and Continuity with Trapezoidal Shadow Maps. Rendering Techniques 2004: 153-160 - 2003
- [c12]Yonghong Zhao, Hong-Yang Ong, Tiow Seng Tan, Yongguan Xiao:
Interactive control of component-based morphing. Symposium on Computer Animation 2003: 339-348 - 2001
- [c11]Xuetao Li, Tong Wing Woon, Tiow Seng Tan, Zhiyong Huang:
Decomposing polygon meshes for interactive applications. SI3D 2001: 35-42
1990 – 1999
- 1999
- [c10]Fei-Ah Law, Tiow Seng Tan:
Preprocessing occlusion for real-time selective refinement. SI3D 1999: 47-53 - [c9]Tiow Seng Tan, Ket Fah Chong, Kok-Lim Low:
Computing bounding volume hierarchies using model simplification. SI3D 1999: 63-69 - [c8]Tong Wing Woon, Xuetao Li, Tiow Seng Tan:
Shape extraction for a polygon mesh. SIGGRAPH Abstracts and Applications 1999: 276 - 1998
- [j9]Kiem Ching Ong, Hung Chuan Teh, Tiow Seng Tan:
Resolving occlusion in image sequence made easy. Vis. Comput. 14(4): 153-165 (1998) - [c7]Tiow Seng Tan, Ket Fah Chong, Kok-Lim Low:
Collision detection framework using model simplification. SIGGRAPH Abstracts and Applications 1998: 246 - 1997
- [c6]Kok-Lim Low, Tiow Seng Tan:
Model Simplification Using Vertex-Clustering. SI3D 1997: 75-82, 188 - 1996
- [j8]Tiow Seng Tan:
An Optimal Bound for High-Quality Conforming Triangulations. Discret. Comput. Geom. 15(2): 169-193 (1996) - 1994
- [c5]Tiow Seng Tan:
An Optimal Bound for Conforming Quality Triangulations (Extended Abstract). SCG 1994: 240-249 - 1993
- [b1]Tiow Seng Tan:
Optimal Two-Dimensional Triangulations. University of Illinois Urbana-Champaign, USA, 1993 - [j7]Marshall W. Bern, Herbert Edelsbrunner, David Eppstein, Scott A. Mitchell, Tiow Seng Tan:
Edge Insertion for Optimal Triangulations. Discret. Comput. Geom. 10: 47-65 (1993) - [j6]Herbert Edelsbrunner, Tiow Seng Tan:
An Upper Bound for Conforming Delaunary Triangulations. Discret. Comput. Geom. 10: 193-213 (1993) - [j5]Herbert Edelsbrunner, Tiow Seng Tan:
A Quadratic Time Algorithm for the Minimax Length Triangulation. SIAM J. Comput. 22(3): 527-551 (1993) - 1992
- [j4]Herbert Edelsbrunner, Tiow Seng Tan, Roman Waupotitsch:
An O(n2 log n) Time Algorithm for the Minmax Angle Triangulation. SIAM J. Sci. Comput. 13(4): 994-1008 (1992) - [c4]Herbert Edelsbrunner, Tiow Seng Tan:
An Upper Bound for Conforming Delaunay Triangulations. SCG 1992: 53-62 - [c3]Marshall W. Bern, Herbert Edelsbrunner, David Eppstein, Scott A. Mitchell, Tiow Seng Tan:
Edge Insertion for Optional Triangulations. LATIN 1992: 46-60 - 1991
- [c2]Herbert Edelsbrunner, Tiow Seng Tan:
A Quadratic Time Algorithm for The MinMax Length Triangulation (Extended Abstract). FOCS 1991: 414-423 - 1990
- [c1]Herbert Edelsbrunner, Tiow Seng Tan, Roman Waupotitsch:
An O(n2log n) Time Algorithm for the MinMax Angle Triangulation. SCG 1990: 44-52
1980 – 1989
- 1989
- [j3]Kok-Phuang Tan, Tiow Seng Tan:
Switchbox routing using score function. Integr. 8(1): 17-39 (1989) - 1988
- [j2]Gee-Swee Poo, Tiow Seng Tan:
Performance comparison of PC LAN file servers - an experimental study. Comput. Commun. 11(2): 71-79 (1988) - 1987
- [j1]Gee-Swee Poo, Tiow Seng Tan:
Performance characteristics of a broadband PC LAN: an experimental study. Comput. Commun. 10(5): 243-249 (1987)
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.
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.
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.
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 2025-01-21 00:25 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:
