Shortest Paths and Voronoi Diagrams with Transportation Networks Under General Distances. - Sang Won Bae 001; Kyung-Yong Chwa (ISAAC, 2005)

Voronoi Diagrams for a Transportation Network on the Euclidean Plane. - Sang Won Bae 001; Kyung-Yong Chwa (Int. J. Comput. Geom. Appl., 2006)

Maintaining Extremal Points and Its Applications to Deciding Optimal Orientations. - Sang Won Bae 001; Chunseok Lee; Hee-Kap Ahn; Sunghee Choi; Kyung-Yong Chwa (ISAAC, 2007)

Covering a Point Set by Two Disjoint Rectangles. - Hee-Kap Ahn; Sang Won Bae 001 (ISAAC, 2008)

Aperture-Angle and Hausdorff-Approximation of Convex Figures. - Hee-Kap Ahn; Sang Won Bae 001; Otfried Cheong; Joachim Gudmundsson (Discret. Comput. Geom., 2008)

Optimal Empty Pseudo-Triangles in a Point Set. - Hee-Kap Ahn; Sang Won Bae 001; Iris Reinbacher (CCCG, 2009)

The geodesic farthest-site Voronoi diagram in a polygonal domain with holes. - Sang Won Bae 001; Kyung-Yong Chwa (SCG, 2009)

Square and Rectangle Covering with Outliers. - Hee-Kap Ahn; Sang Won Bae 001; Sang-Sub Kim 001; Matias Korman; Iris Reinbacher; Wanbin Son (FAW, 2009)

All Farthest Neighbors in the Presence of Highways and Obstacles. - Sang Won Bae 001; Matias Korman; Takeshi Tokuyama (WALCOM, 2009)

Casting an Object with a Core. - Hee-Kap Ahn; Sang Won Bae 001; Siu-Wing Cheng; Kyung-Yong Chwa (Algorithmica, 2009)

Computing minimum-area rectilinear convex hull and L-shape. - Sang Won Bae 001; Chunseok Lee; Hee-Kap Ahn; Sunghee Choi; Kyung-Yong Chwa (Comput. Geom., 2009)

Optimal Construction of the City Voronoi Diagram. - Sang Won Bae 001; Jae-Hoon Kim 001; Kyung-Yong Chwa (Int. J. Comput. Geom. Appl., 2009)

Constructing Optimal Highways. - Hee-Kap Ahn; Helmut Alt; Tetsuo Asano; Sang Won Bae 001; Peter Brass; Otfried Cheong; Christian Knauer; Hyeon-Suk Na; Chan-Su Shin; Alexander Wolff 001 (Int. J. Found. Comput. Sci., 2009)

Geometric stable roommates. - Esther M. Arkin; Sang Won Bae 001; Alon Efrat; Kazuya Okamoto; Joseph S. B. Mitchell; Valentin Polishchuk (Inf. Process. Lett., 2009)

The Onion Diagram: A Voronoi-Like Tessellation of a Planar Line Space and Its Applications - (Extended Abstract). - Sang Won Bae 001; Chan-Su Shin (ISAAC (2), 2010)

On exact solutions to the Euclidean bottleneck Steiner tree problem. - Sang Won Bae 001; Chunseok Lee; Sunghee Choi (Inf. Process. Lett., 2010)

Generating Realistic Roofs over a Rectilinear Polygon. - Hee-Kap Ahn; Sang Won Bae 001; Christian Knauer; Mira Lee; Chan-Su Shin; Antoine Vigneron (ISAAC, 2011)

Exact Algorithms for the Bottleneck Steiner Tree Problem. - Sang Won Bae 001; Sunghee Choi; Chunseok Lee; Shin-ichi Tanigawa (Algorithmica, 2011)

Covering points by disjoint boxes with outliers. - Hee-Kap Ahn; Sang Won Bae 001; Erik D. Demaine; Martin L. Demaine; Sang-Sub Kim 001; Matias Korman; Iris Reinbacher; Wanbin Son (Comput. Geom., 2011)

Empty pseudo-triangles in point sets. - Hee-Kap Ahn; Sang Won Bae 001; Marc J. van Kreveld; Iris Reinbacher; Bettina Speckmann (Discret. Appl. Math., 2011)

Covering a Point Set by Two Disjoint Rectangles. - Sang-Sub Kim 001; Sang Won Bae 001; Hee-Kap Ahn (Int. J. Comput. Geom. Appl., 2011)

Rectilinear Covering for Imprecise Input Points - (Extended Abstract). - Hee-Kap Ahn; Sang Won Bae 001; Shin-ichi Tanigawa (ISAAC, 2012)

Tight Bound for Farthest-Color Voronoi Diagrams of Line Segments. - Sang Won Bae 001 (WALCOM, 2012)

Farthest Voronoi Diagrams under Travel Time Metrics - (Extended Abstract). - Sang Won Bae 001; Kyung-Yong Chwa (WALCOM, 2012)

Querying two boundary points for shortest paths in a polygonal domain. - Sang Won Bae 001; Yoshio Okamoto (Comput. Geom., 2012)

On Linear-Sized Farthest-Color Voronoi Diagrams. - Sang Won Bae 001 (IEICE Trans. Inf. Syst., 2012)

The Onion Diagram: a Voronoi-like Tessellation of a Planar Line Space and its Applications. - Sang Won Bae 001; Chan-Su Shin (Int. J. Comput. Geom. Appl., 2012)

3D medial axis point approximation using nearest neighbors and the normal field. - Jaehwan Ma; Sang Won Bae 001; Sunghee Choi (Vis. Comput., 2012)

Group Nearest Neighbor Queries in the L 1 Plane. - Hee-Kap Ahn; Sang Won Bae 001; Wanbin Son (TAMC, 2013)

Best and worst-case coverage problems for arbitrary paths in wireless sensor networks. - Chunseok Lee; Donghoon Shin; Sang Won Bae 001; Sunghee Choi (Ad Hoc Networks, 2013)

Realistic roofs over a rectilinear polygon. - Hee-Kap Ahn; Sang Won Bae 001; Christian Knauer; Mira Lee; Chan-Su Shin; Antoine Vigneron (Comput. Geom., 2013)

Computing the L1 Geodesic Diameter and Center of a Simple Polygon in Linear Time. - Sang Won Bae 001; Matias Korman; Yoshio Okamoto; Haitao Wang 001 (CoRR, 2013)

The Geodesic Diameter of Polygonal Domains. - Sang Won Bae 001; Matias Korman; Yoshio Okamoto (Discret. Comput. Geom., 2013)

Minimum Convex Container of Two Convex Polytopes under Translations. - Hee-Kap Ahn; Sang Won Bae 001; Otfried Cheong; Dongwoo Park; Chan-Su Shin (CCCG, 2014)

Computing the L 1 Geodesic Diameter and Center of a Simple Polygon in Linear Time. - Sang Won Bae 001; Matias Korman; Yoshio Okamoto; Haitao Wang 001 (LATIN, 2014)

A Generalization of the Convex Kakeya Problem. - Hee-Kap Ahn; Sang Won Bae 001; Otfried Cheong; Joachim Gudmundsson; Takeshi Tokuyama; Antoine Vigneron (Algorithmica, 2014)

Theta-3 is connected. - Oswin Aichholzer; Sang Won Bae 001; Luis Barba; Prosenjit Bose; Matias Korman; André van Renssen; Perouz Taslakian; Sander Verdonschot (Comput. Geom., 2014)

Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments. - Sang Won Bae 001 (Comput. Geom., 2014)

Travel Time Distances Induced by Transportation Networks and General Underlying Distances. - Sang Won Bae 001; Kyung-Yong Chwa (J. Inf. Sci. Eng., 2014)

An Almost Optimal Algorithm for Voronoi Diagrams of Non-disjoint Line Segments - (Extended Abstract). - Sang Won Bae 001 (WALCOM, 2015)

Reprint of: Theta-3 is connected. - Oswin Aichholzer; Sang Won Bae 001; Luis Barba; Prosenjit Bose; Matias Korman; André van Renssen; Perouz Taslakian; Sander Verdonschot (Comput. Geom., 2015)

Computing the L1 geodesic diameter and center of a simple polygon in linear time. - Sang Won Bae 001; Matias Korman; Yoshio Okamoto; Haitao Wang 001 (Comput. Geom., 2015)

Improved Bounds for Beacon-Based Coverage and Routing in Simple Rectilinear Polygons. - Sang Won Bae 001; Chan-Su Shin; Antoine Vigneron (CoRR, 2015)

Group nearest-neighbor queries in the L1 plane. - Wanbin Son; Sang Won Bae 001; Hee-Kap Ahn (Theor. Comput. Sci., 2015)

Computing a Minimum-Width Square or Rectangular Annulus with Outliers - [Extended Abstract]. - Sang Won Bae 001 (COCOON, 2016)

Approximating Convex Shapes With Respect to Symmetric Difference Under Homotheties. - Juyoung Yon; Sang Won Bae 001; Siu-Wing Cheng; Otfried Cheong; Bryan T. Wilkinson (SoCG, 2016)

L_1 Geodesic Farthest Neighbors in a Simple Polygon and Related Problems. - Sang Won Bae 001 (ISAAC, 2016)

Computing the L1 Geodesic Diameter and Center of a Polygonal Domain. - Sang Won Bae 001; Matias Korman; Joseph S. B. Mitchell; Yoshio Okamoto; Valentin Polishchuk; Haitao Wang 001 (STACS, 2016)

Computing a Minimum-Width Square Annulus in Arbitrary Orientation - [Extended Abstract]. - Sang Won Bae 001 (WALCOM, 2016)

An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments. - Sang Won Bae 001 (Comput. Geom., 2016)

Bundling three convex polygons to minimize area or perimeter. - Dongwoo Park; Sang Won Bae 001; Helmut Alt; Hee-Kap Ahn (Comput. Geom., 2016)

Efficient Flattening Algorithm for Hierarchical and Dynamic Structure Discrete Event Models. - Jang Won Bae; Sang Won Bae 001; Il-Chul Moon; Tag Gon Kim (ACM Trans. Model. Comput. Simul., 2016)

Computing the L1 Geodesic Diameter and Center of a Polygonal Domain. - Sang Won Bae 001; Matias Korman; Joseph S. B. Mitchell; Yoshio Okamoto; Valentin Polishchuk; Haitao Wang 001 (Discret. Comput. Geom., 2017)

The Reverse Kakeya Problem. - Sang Won Bae 001; Sergio Cabello; Otfried Cheong; Yoonsung Choi; Fabian Stehn; Sang Duk Yoon (SoCG, 2018)

L1 Shortest Path Queries in Simple Polygons. - Sang Won Bae 001; Haitao Wang 001 (CoRR, 2018)

Computing a minimum-width square annulus in arbitrary orientation. - Sang Won Bae 001 (Theor. Comput. Sci., 2018)

Gap-planar graphs. - Sang Won Bae 001; Jean-François Baffier; Jinhee Chun; Peter Eades; Kord Eickmeyer; Luca Grilli 001; Seok-Hee Hong 001; Matias Korman; Fabrizio Montecchiani; Ignaz Rutter; Csaba D. Tóth (Theor. Comput. Sci., 2018)

Covering points with convex sets of minimum size. - Sang Won Bae 001; Hwan-Gue Cho; William S. Evans; Noushin Saeedi; Chan-Su Shin (Theor. Comput. Sci., 2018)

On finding a longest common palindromic subsequence. - Sang Won Bae 001; Inbok Lee (Theor. Comput. Sci., 2018)

The minimum convex container of two convex polytopes under translations. - Hee-Kap Ahn; Judit Abardia; Sang Won Bae 001; Otfried Cheong; Susanna Dann; Dongwoo Park; Chan-Su Shin (Comput. Geom., 2019)

Faster algorithms for growing prioritized disks and rectangles. - Hee-Kap Ahn; Sang Won Bae 001; Jong Min Choi; Matias Korman; Wolfgang Mulzer; Eunjin Oh 001; Ji-won Park; André van Renssen; Antoine Vigneron (Comput. Geom., 2019)

Computing a minimum-width square or rectangular annulus with outliers. - Sang Won Bae 001 (Comput. Geom., 2019)

Shortcuts for the circle. - Sang Won Bae 001; Mark de Berg; Otfried Cheong; Joachim Gudmundsson; Christos Levcopoulos (Comput. Geom., 2019)

Computing the geodesic centers of a polygonal domain. - Sang Won Bae 001; Matias Korman; Yoshio Okamoto (Comput. Geom., 2019)

Area bounds of rectilinear polygons realized by angle sequences. - Sang Won Bae 001; Yoshio Okamoto; Chan-Su Shin (Comput. Geom., 2019)

Closest-pair queries in fat rectangles. - Sang Won Bae 001; Michiel H. M. Smid (Comput. Geom., 2019)

Tight bounds for beacon-based coverage in simple rectilinear polygons. - Sang Won Bae 001; Chan-Su Shin; Antoine Vigneron (Comput. Geom., 2019)

Computing a geodesic two-center of points in a simple polygon. - Eunjin Oh 001; Sang Won Bae 001; Hee-Kap Ahn (Comput. Geom., 2019)

L1 Geodesic Farthest Neighbors in a Simple Polygon and Related Problems. - Sang Won Bae 001 (Discret. Comput. Geom., 2019)

Minimum-width annulus with outliers: Circular, square, and rectangular cases. - Hee-Kap Ahn; Taehoon Ahn 001; Sang Won Bae 001; Jong Min Choi; Mincheol Kim; Eunjin Oh 001; Chan-Su Shin; Sang Duk Yoon (Inf. Process. Lett., 2019)

Computing a minimum-width cubic and hypercubic shell. - Sang Won Bae 001 (Oper. Res. Lett., 2019)

L1 shortest path queries in simple polygons. - Sang Won Bae 001; Haitao Wang 001 (Theor. Comput. Sci., 2019)

Minimum-Width Cuboidal Shells with Outliers. - Sang Won Bae 001 (J. Comput. Sci. Eng., 2020)

Minimum-width double-strip and parallelogram annulus. - Sang Won Bae 001 (Theor. Comput. Sci., 2020)

On the minimum-area rectangular and square annulus problem. - Sang Won Bae 001 (Comput. Geom., 2021)

Maximum-width empty square and rectangular annulus. - Sang Won Bae 001; Arpita Baral; Priya Ranjan Sinha Mahapatra (Comput. Geom., 2021)

Counting Convex and Non-Convex 4-Holes in a Point Set. - Young-Hun Sung; Sang Won Bae 001 (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021)

Minimum-Width Parallelogram Annulus with Given Angles. - Sang Won Bae 001 (J. Comput. Sci. Eng., 2021)

Approximating Convex Polygons by Histogons. - Jaehoon Chung; Sang Won Bae 001; Chan-Su Shin; Sang Duk Yoon; Hee-Kap Ahn (CCCG, 2022)

Inscribing or Circumscribing a Histogon to a Convex Polygon. - Jaehoon Chung; Sang Won Bae 001; Chan-Su Shin; Sang Duk Yoon; Hee-Kap Ahn (FSTTCS, 2022)

Rearranging a sequence of points onto a line. - Taehoon Ahn 001; Jongmin Choi; Chaeyoon Chung; Hee-Kap Ahn; Sang Won Bae 001; Sang Duk Yoon (Comput. Geom., 2022)

Faster counting empty convex polygons in a planar point set. - Sang Won Bae 001 (Inf. Process. Lett., 2022)

On the Minimum-Area Parallelogram Annulus Problem. - Sang Won Bae 001 (Symmetry, 2022)

Counting Non-Convex 5-Holes in a Planar Point Set. - Young-Hun Sung; Sang Won Bae 001 (Symmetry, 2022)

Empty Squares in Arbitrary Orientation Among Points. - Sang Won Bae 001; Sang Duk Yoon (Algorithmica, 2023)

On Counting Monotone Polygons and Holes in a Point Set. - Sang Won Bae 001 (J. Comput. Sci. Eng., 2023)

An optimal algorithm for the minimum-width cubic shell problem. - Sang Won Bae 001 (Oper. Res. Lett., 2023)

Constrained Two-Line Center Problems. - Taehoon Ahn 001; Sang Won Bae 001 (ISAAC, 2024)

Maximum-width rainbow-bisecting empty annulus. - Sang Won Bae 001; Sandip Banerjee; Arpita Baral; Priya Ranjan Sinha Mahapatra; Sang Duk Yoon (Comput. Geom., 2024)

Editorial. - Sang Won Bae 001; Yoshio Okamato (Comput. Geom., 2024)

Covering Points in the Plane by Two Rectangular Annuli. - Sang Won Bae 001 (J. Comput. Sci. Eng., 2024)

Higher-Order Color Voronoi Diagrams and the Colorful Clarkson-Shor Framework. - Sang Won Bae 001; Nicolau Oliver; Evanthia Papadopoulou (SoCG, 2025)

Minimum-width double-slabs and widest empty slabs in high dimensions. - Taehoon Ahn 001; Chaeyoon Chung; Hee-Kap Ahn; Sang Won Bae 001; Otfried Cheong; Sang Duk Yoon (Comput. Geom., 2025)

Parallel line centers with guaranteed separation. - Chaeyoon Chung; Taehoon Ahn 001; Sang Won Bae 001; Hee-Kap Ahn (Comput. Geom., 2025)

Largest unit rectangles inscribed in a convex polygon. - Jaehoon Chung; Sang Won Bae 001; Chan-Su Shin; Sang Duk Yoon; Hee-Kap Ahn (Comput. Geom., 2025)

Predicting Volleyball Season Performance Using Pre-Season Wearable Data and Machine Learning. - Melik Ozolcer; Tongze Zhang; Sang Won Bae 001 (CoRR, 2025)

Better Late than Never: the Complexity of Arrangements of Polyhedra. - Boris Aronov; Sang Won Bae 001; Sergio Cabello; Otfried Cheong; David Eppstein; Christian Knauer; Raimund Seidel (CoRR, 2025)