default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSang Duk Yoon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Sang Won Bae, Sandip Banerjee
, Arpita Baral, Priya Ranjan Sinha Mahapatra, Sang Duk Yoon:
Maximum-width rainbow-bisecting empty annulus. Comput. Geom. 120: 102088 (2024)- [j7]Hee-Kap Ahn, Seung Joon Lee, Sang Duk Yoon:
Stacking Monotone Polytopes. Symmetry 16(9): 1246 (2024) - [c11]Taehoon Ahn, Chaeyoon Chung, Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Sang Duk Yoon:
Minimum-Width Double-Slabs and Widest Empty Slabs in High Dimensions. LATIN (1) 2024: 303-317 - 2023
- [j6]Sang Won Bae, Sang Duk Yoon:
Empty Squares in Arbitrary Orientation Among Points. Algorithmica 85(1): 29-74 (2023) - [c10]Mook Kwon Jung, Sang Duk Yoon, Hee-Kap Ahn, Takeshi Tokuyama:
Universal convex covering problems under affine dihedral group actions. CCCG 2023: 299-305 - [i3]Sang Won Bae, Sandip Banerjee, Arpita Baral, Priya Ranjan Sinha Mahapatra, Sang Duk Yoon:
Maximum-Width Rainbow-Bisecting Empty Annulus. CoRR abs/2305.09248 (2023) - 2022
- [j5]Taehoon Ahn, Jongmin Choi, Chaeyoon Chung, Hee-Kap Ahn, Sang Won Bae, Sang Duk Yoon:
Rearranging a sequence of points onto a line. Comput. Geom. 107: 101887 (2022) - [c9]Jaehoon Chung, Sang Won Bae, Chan-Su Shin, Sang Duk Yoon, Hee-Kap Ahn:
Approximating Convex Polygons by Histogons. CCCG 2022: 75-82 - [c8]Jaehoon Chung, Sang Won Bae, Chan-Su Shin, Sang Duk Yoon, Hee-Kap Ahn:
Inscribing or Circumscribing a Histogon to a Convex Polygon. FSTTCS 2022: 13:1-13:16 - [i2]Mook Kwon Jung, Sang Duk Yoon, Hee-Kap Ahn, Takeshi Tokuyama:
Universal convex covering problems under translation and discrete rotations. CoRR abs/2211.14807 (2022) - 2021
- [j4]Mincheol Kim, Sang Duk Yoon, Hee-Kap Ahn:
Shortest rectilinear path queries to rectangles in a rectangular domain. Comput. Geom. 99: 101796 (2021) - [c7]Taehoon Ahn, Jongmin Choi, Chaeyoon Chung, Hee-Kap Ahn, Sang Won Bae, Sang Duk Yoon:
Rearranging a Sequence of Points onto a Line. CCCG 2021: 36-46 - 2020
- [c6]Sang Won Bae, Sang Duk Yoon:
Empty Squares in Arbitrary Orientation Among Points. SoCG 2020: 13:1-13:17 - [c5]Mincheol Kim, Sang Duk Yoon, Hee-Kap Ahn:
Shortest Rectilinear Path Queries to Rectangles in a Rectangular Domain. LATIN 2020: 271-282
2010 – 2019
- 2019
- [j3]Hee-Kap Ahn, Taehoon Ahn, Sang Won Bae, Jong Min Choi, Mincheol Kim, Eunjin Oh, Chan-Su Shin, Sang Duk Yoon:
Minimum-width annulus with outliers: Circular, square, and rectangular cases. Inf. Process. Lett. 145: 16-23 (2019) - [i1]Sang Won Bae, Sang Duk Yoon:
Empty Squares in Arbitrary Orientation Among Points. CoRR abs/1911.12988 (2019) - 2018
- [j2]Sang Duk Yoon, Min-Gyu Kim, Wanbin Son, Hee-Kap Ahn:
Geometric matching algorithms for two realistic terrains. Theor. Comput. Sci. 715: 60-70 (2018) - [c4]Sang Won Bae, Sergio Cabello, Otfried Cheong, Yoonsung Choi, Fabian Stehn, Sang Duk Yoon:
The Reverse Kakeya Problem. SoCG 2018: 6:1-6:13 - [c3]Hee-Kap Ahn, Taehoon Ahn, Sang Won Bae, Jong Min Choi, Mincheol Kim, Eunjin Oh, Chan-Su Shin, Sang Duk Yoon:
Minimum-Width Annulus with Outliers: Circular, Square, and Rectangular Cases. WALCOM 2018: 44-55 - 2017
- [j1]Sang Duk Yoon, Hee-Kap Ahn, Jessica Sherette:
Realistic roofs without local minimum edges over a rectilinear polygon. Theor. Comput. Sci. 675: 15-26 (2017) - 2015
- [c2]Sang Duk Yoon, Min-Gyu Kim, Wanbin Son, Hee-Kap Ahn:
Geometric Matching Algorithms for Two Realistic Terrains. ISAAC 2015: 285-295 - 2013
- [c1]Jessica Sherette, Sang Duk Yoon:
Realistic Roofs over a Rectilinear Polygon Revisited. COCOON 2013: 233-244
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-10-25 20:13 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:
