Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Sang Wook Yoo

dblp:58/11014 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
1since 2021 · last 2024
0000-0002-5404-4397ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 1 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1

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.

Computer graphics and multimedia
1 paper
Geometric modeling and processing · 100%
Theoretical computer science
1 paper
Algorithms and data structures · 50% Mathematical optimization · 50%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Geometric modeling and processing › surface processing
geodesic distance computation
0.112012
A Triangulation-Invariant Method for Anisotropic Geodesic Map Computation on Surface Meshes · IEEE Trans. Vis. Comput. Graph. 2012
Geometric modeling and processing › mesh processing
surface mesh processing
0.112012
A Triangulation-Invariant Method for Anisotropic Geodesic Map Computation on Surface Meshes · IEEE Trans. Vis. Comput. Graph. 2012
Mathematical optimization
hamilton-jacobi equations
0.012012
A Triangulation-Invariant Method for Anisotropic Geodesic Map Computation on Surface Meshes · IEEE Trans. Vis. Comput. Graph. 2012
Algorithms and data structures
numerical algorithms
0.012012
A Triangulation-Invariant Method for Anisotropic Geodesic Map Computation on Surface Meshes · IEEE Trans. Vis. Comput. Graph. 2012

Methods — techniques the papers use, named apart from their topics

ordered upwind method · 0.3curvature-based speed function · 0.3
YearPublicationVenuePosition
2024 Interactive-Time Text-Guided Editing of 3D Face
Yeonjeong Lee, Yeong-Hun Song, Sang Wook Yoo, Joon-Kyung Seong
ICPR (3)3
2012 A Triangulation-Invariant Method for Anisotropic Geodesic Map Computation on Surface Meshes
abstract
This paper addresses the problem of computing the geodesic distance map from a given set of source vertices to all other vertices on a surface mesh using an anisotropic distance metric. Formulating this problem as an equivalent control theoretic problem with Hamilton-Jacobi-Bellman partial differential equations, we present a framework for computing an anisotropic geodesic map using a curvature-based speed function. An ordered upwind method (OUM)-based solver for these equations is available for unstructured planar meshes. We adopt this OUM-based solver for surface meshes and present a triangulation-invariant method for the solver. Our basic idea is to explore proximity among the vertices on a surface while locally following the characteristic direction at each vertex. We also propose two speed functions based on classical curvature tensors and show that the resulting anisotropic geodesic maps reflect surface geometry well through several experiments, including isocontour generation, offset curve computation, medial axis extraction, and ridge/valley curve extraction. Our approach facilitates surface analysis and processing by defining speed functions in an application-dependent manner.
Sang Wook Yoo, Joon-Kyung Seong, Minhyuk Sung, Joseph S. Shin, Elaine Cohen
IEEE Trans. Vis. Comput. Graph.1
2009 Toward a Detailed Description of the Thermally Induced Dynamics of the Core Promoter
abstract
Establishing the general and promoter-specific mechanistic features of gene transcription initiation requires improved understanding of the sequence-dependent structural/dynamic features of promoter DNA. Experimental data suggest that a spontaneous dsDNA strand separation at the transcriptional start site is likely to be a requirement for transcription initiation in several promoters. Here, we use Langevin molecular dynamic simulations based on the Peyrard-Bishop-Dauxois nonlinear model of DNA (PBD LMD) to analyze the strand separation (bubble) dynamics of 80-bp-long promoter DNA sequences. We derive three dynamic criteria, bubble probability, bubble lifetime, and average strand separation, to characterize bubble formation at the transcriptional start sites of eight mammalian gene promoters. We observe that the most stable dsDNA openings do not necessarily coincide with the most probable openings and the highest average strand displacement, underscoring the advantages of proper molecular dynamic simulations. The dynamic profiles of the tested mammalian promoters differ significantly in overall profile and bubble probability, but the transcriptional start site is often distinguished by large (longer than 10 bp) and long-lived transient openings in the double helix. In support of these results are our experimental transcription data demonstrating that an artificial bubble-containing DNA template is transcribed bidirectionally by human RNA polymerase alone in the absence of any other transcription factors.
Boian S. Alexandrov, Vladimir Gelev, Sang Wook Yoo, Alan R. Bishop, Kim Ø. Rasmussen, Anny Usheva
PLoS Comput. Biol.3