Sang Won Bae

According to our database, Sang Won Bae authored at least 100 papers between 2004 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2025

Offline Policy Evaluation of Multi-Turn LLM Health Coaching with Real Users.

Melik Ozolcer, Sang Won Bae

CoRR, October, 2025

SePA: A Search-enhanced Predictive Agent for Personalized Health Coaching.

Melik Ozolcer, Sang Won Bae

CoRR, September, 2025

Better Late than Never: the Complexity of Arrangements of Polyhedra.

Boris Aronov, Sang Won Bae, Sergio Cabello, Otfried Cheong, David Eppstein, Christian Knauer, Raimund Seidel

CoRR, June, 2025

Predicting Volleyball Season Performance Using Pre-Season Wearable Data and Machine Learning.

Melik Ozolcer, Tongze Zhang, Sang Won Bae

CoRR, March, 2025

On k -enclosing slab problems.

Taehoon Ahn, Sang Won Bae

Theor. Comput. Sci., 2025

Largest unit rectangles inscribed in a convex polygon.

Jaehoon Chung, Sang Won Bae, Chan-Su Shin, Sang Duk Yoon, Hee-Kap Ahn

Comput. Geom., 2025

Higher-Order Color Voronoi Diagrams and the Colorful Clarkson-Shor Framework.

Sang Won Bae, Nicolau Oliver, Evanthia Papadopoulou

Proceedings of the 41st International Symposium on Computational Geometry, 2025

2024

Covering Points in the Plane by Two Rectangular Annuli.

Sang Won Bae

J. Comput. Sci. Eng., 2024

Editorial.

Sang Won Bae, Yoshio Okamato

Comput. Geom., 2024

Maximum-width rainbow-bisecting empty annulus.

Sang Won Bae, Sandip Banerjee, Arpita Baral, Priya Ranjan Sinha Mahapatra, Sang Duk Yoon

Comput. Geom., 2024

Minimum-Width Double-Slabs and Widest Empty Slabs in High Dimensions.

Taehoon Ahn, Chaeyoon Chung, Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Sang Duk Yoon

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

Constrained Two-Line Center Problems.

Taehoon Ahn, Sang Won Bae

Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

2023

An optimal algorithm for the minimum-width cubic shell problem.

Sang Won Bae

Oper. Res. Lett., September, 2023

On Counting Monotone Polygons and Holes in a Point Set.

Sang Won Bae

J. Comput. Sci. Eng., September, 2023

Parallel Line Centers with Guaranteed Separation.

Chaeyoon Chung, Taehoon Ahn, Sang Won Bae, Hee-Kap Ahn

Proceedings of the 35th Canadian Conference on Computational Geometry, 2023

2022

Counting Non-Convex 5-Holes in a Planar Point Set.

Young-Hun Sung, Sang Won Bae

Symmetry, 2022

On the Minimum-Area Parallelogram Annulus Problem.

Sang Won Bae

Symmetry, 2022

Faster counting empty convex polygons in a planar point set.

Sang Won Bae

Inf. Process. Lett., 2022

Inscribing or Circumscribing a Histogon to a Convex Polygon.

Jaehoon Chung, Sang Won Bae, Chan-Su Shin, Sang Duk Yoon, Hee-Kap Ahn

Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

Approximating Convex Polygons by Histogons.

Jaehoon Chung, Sang Won Bae, Chan-Su Shin, Sang Duk Yoon, Hee-Kap Ahn

Proceedings of the 34th Canadian Conference on Computational Geometry, 2022

2021

Minimum-Width Parallelogram Annulus with Given Angles.

Sang Won Bae

J. Comput. Sci. Eng., 2021

Counting Convex and Non-Convex 4-Holes in a Point Set.

Young-Hun Sung, Sang Won Bae

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021

On the minimum-area rectangular and square annulus problem.

Sang Won Bae

Comput. Geom., 2021

Rearranging a Sequence of Points onto a Line.

Taehoon Ahn, Jongmin Choi, Chaeyoon Chung, Hee-Kap Ahn, Sang Won Bae, Sang Duk Yoon

Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

2020

Minimum-Width Cuboidal Shells with Outliers.

Sang Won Bae

J. Comput. Sci. Eng., 2020

Empty Squares in Arbitrary Orientation Among Points.

Sang Won Bae, Sang Duk Yoon

Proceedings of the 36th International Symposium on Computational Geometry, 2020

2019

<i>L</i>₁ shortest path queries in simple polygons.

Sang Won Bae, Haitao Wang

Theor. Comput. Sci., 2019

Computing a minimum-width cubic and hypercubic shell.

Sang Won Bae

Oper. Res. Lett., 2019

L₁ Geodesic Farthest Neighbors in a Simple Polygon and Related Problems.

Sang Won Bae

Discret. Comput. Geom., 2019

Closest-pair queries in fat rectangles.

Sang Won Bae, Michiel H. M. Smid

Comput. Geom., 2019

Computing a minimum-width square or rectangular annulus with outliers.

Sang Won Bae

Comput. Geom., 2019

The minimum convex container of two convex polytopes under translations.

Hee-Kap Ahn, Judit Abardia, Sang Won Bae, Otfried Cheong, Susanna Dann, Dongwoo Park, Chan-Su Shin

Comput. Geom., 2019

Maximum-Width Empty Square and Rectangular Annulus.

Sang Won Bae, Arpita Baral, Priya Ranjan Sinha Mahapatra

Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

Minimum-Width Double-Strip and Parallelogram Annulus.

Sang Won Bae

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

2018

On finding a longest common palindromic subsequence.

Sang Won Bae, Inbok Lee

Theor. Comput. Sci., 2018

Covering points with convex sets of minimum size.

Sang Won Bae, Hwan-Gue Cho, William S. Evans, Noushin Saeedi, Chan-Su Shin

Theor. Comput. Sci., 2018

Computing a minimum-width square annulus in arbitrary orientation.

Sang Won Bae

Theor. Comput. Sci., 2018

L₁ Shortest Path Queries in Simple Polygons.

Sang Won Bae, Haitao Wang

CoRR, 2018

Minimum-Width Annulus with Outliers: Circular, Square, and Rectangular Cases.

Hee-Kap Ahn, Taehoon Ahn, Sang Won Bae, Jong Min Choi, Mincheol Kim, Eunjin Oh, Chan-Su Shin, Sang Duk Yoon

Proceedings of the WALCOM: Algorithms and Computation - 12th International Conference, 2018

The Reverse Kakeya Problem.

Sang Won Bae, Sergio Cabello, Otfried Cheong, Yoonsung Choi, Fabian Stehn, Sang Duk Yoon

Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017

Computing the L₁ Geodesic Diameter and Center of a Polygonal Domain.

Sang Won Bae, Matias Korman, Joseph S. B. Mitchell, Yoshio Okamoto, Valentin Polishchuk, Haitao Wang

Discret. Comput. Geom., 2017

Shortcuts for the Circle.

Sang Won Bae, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Christos Levcopoulos

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Faster Algorithms for Growing Prioritized Disks and Rectangles.

Hee-Kap Ahn, Sang Won Bae, Jong Min Choi, Matias Korman, Wolfgang Mulzer, Eunjin Oh, Ji-won Park, André van Renssen, Antoine Vigneron

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Gap-Planar Graphs.

Sang Won Bae, Jean-François Baffier, Jinhee Chun, Peter Eades, Kord Eickmeyer, Luca Grilli, Seok-Hee Hong, Matias Korman, Fabrizio Montecchiani, Ignaz Rutter, Csaba D. Tóth

Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

2016

Efficient Flattening Algorithm for Hierarchical and Dynamic Structure Discrete Event Models.

Jang Won Bae, Sang Won Bae, Il-Chul Moon, Tag Gon Kim

ACM Trans. Model. Comput. Simul., 2016

An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments.

Sang Won Bae

Comput. Geom., 2016

Computing a Minimum-Width Square Annulus in Arbitrary Orientation - [Extended Abstract].

Sang Won Bae

Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

Computing the L1 Geodesic Diameter and Center of a Polygonal Domain.

Sang Won Bae, Matias Korman, Joseph S. B. Mitchell, Yoshio Okamoto, Valentin Polishchuk, Haitao Wang

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Computing a Geodesic Two-Center of Points in a Simple Polygon.

Eunjin Oh, Sang Won Bae, Hee-Kap Ahn

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons.

Sang Won Bae, Chan-Su Shin, Antoine Vigneron

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

L_1 Geodesic Farthest Neighbors in a Simple Polygon and Related Problems.

Sang Won Bae

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

Approximating Convex Shapes With Respect to Symmetric Difference Under Homotheties.

Juyoung Yon, Sang Won Bae, Siu-Wing Cheng, Otfried Cheong, Bryan T. Wilkinson

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

Computing a Minimum-Width Square or Rectangular Annulus with Outliers - [Extended Abstract].

Sang Won Bae

Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015

Group nearest-neighbor queries in the _L₁ plane.

Wanbin Son, Sang Won Bae, Hee-Kap Ahn

Theor. Comput. Sci., 2015

Improved Bounds for Beacon-Based Coverage and Routing in Simple Rectilinear Polygons.

Sang Won Bae, Chan-Su Shin, Antoine Vigneron

CoRR, 2015

Computing the L1 geodesic diameter and center of a simple polygon in linear time.

Sang Won Bae, Matias Korman, Yoshio Okamoto, Haitao Wang

Comput. Geom., 2015

Reprint of: Theta-3 is connected.

Oswin Aichholzer, Sang Won Bae, Luis Barba, Prosenjit Bose, Matias Korman, André van Renssen, Perouz Taslakian, Sander Verdonschot

Comput. Geom., 2015

An Almost Optimal Algorithm for Voronoi Diagrams of Non-disjoint Line Segments - (Extended Abstract).

Sang Won Bae

Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

2014

Travel Time Distances Induced by Transportation Networks and General Underlying Distances.

Sang Won Bae, Kyung-Yong Chwa

J. Inf. Sci. Eng., 2014

Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments.

Sang Won Bae

Comput. Geom., 2014

Computing the L 1 Geodesic Diameter and Center of a Simple Polygon in Linear Time.

Sang Won Bae, Matias Korman, Yoshio Okamoto, Haitao Wang

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Computing the Geodesic Centers of a Polygonal Domain.

Sang Won Bae, Matias Korman, Yoshio Okamoto

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Minimum Convex Container of Two Convex Polytopes under Translations.

Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Dongwoo Park, Chan-Su Shin

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013

Computing the L₁ Geodesic Diameter and Center of a Simple Polygon in Linear Time.

Sang Won Bae, Matias Korman, Yoshio Okamoto, Haitao Wang

CoRR, 2013

Realistic roofs over a rectilinear polygon.

Hee-Kap Ahn, Sang Won Bae, Christian Knauer, Mira Lee, Chan-Su Shin, Antoine Vigneron

Comput. Geom., 2013

Bundling Three Convex Polygons to Minimize Area or Perimeter.

Hee-Kap Ahn, Helmut Alt, Sang Won Bae, Dongwoo Park

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Group Nearest Neighbor Queries in the <i>L</i> ₁ Plane.

Hee-Kap Ahn, Sang Won Bae, Wanbin Son

Proceedings of the Theory and Applications of Models of Computation, 2013

Theta-3 is connected.

Oswin Aichholzer, Sang Won Bae, Luis Barba, Prosenjit Bose, Matias Korman, André van Renssen, Perouz Taslakian, Sander Verdonschot

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012

3D medial axis point approximation using nearest neighbors and the normal field.

Jaehwan Ma, Sang Won Bae, Sunghee Choi

Vis. Comput., 2012

The Onion Diagram: a Voronoi-like Tessellation of a Planar Line Space and its Applications.

Sang Won Bae, Chan-Su Shin

Int. J. Comput. Geom. Appl., 2012

On Linear-Sized Farthest-Color Voronoi Diagrams.

Sang Won Bae

IEICE Trans. Inf. Syst., 2012

Farthest Voronoi Diagrams under Travel Time Metrics - (Extended Abstract).

Sang Won Bae, Kyung-Yong Chwa

Proceedings of the WALCOM: Algorithms and Computation - 6th International Workshop, 2012

Tight Bound for Farthest-Color Voronoi Diagrams of Line Segments.

Sang Won Bae

Proceedings of the WALCOM: Algorithms and Computation - 6th International Workshop, 2012

A Generalization of the Convex Kakeya Problem.

Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson, Takeshi Tokuyama, Antoine Vigneron

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Area Bounds of Rectilinear Polygons Realized by Angle Sequences.

Sang Won Bae, Yoshio Okamoto, Chan-Su Shin

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Rectilinear Covering for Imprecise Input Points - (Extended Abstract).

Hee-Kap Ahn, Sang Won Bae, Shin-ichi Tanigawa

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

2011

Covering a Point Set by Two Disjoint Rectangles.

Sang-Sub Kim, Sang Won Bae, Hee-Kap Ahn

Int. J. Comput. Geom. Appl., 2011

Empty pseudo-triangles in point sets.

Hee-Kap Ahn, Sang Won Bae, Marc J. van Kreveld, Iris Reinbacher, Bettina Speckmann

Discret. Appl. Math., 2011

Covering points by disjoint boxes with outliers.

Hee-Kap Ahn, Sang Won Bae, Erik D. Demaine, Martin L. Demaine, Sang-Sub Kim, Matias Korman, Iris Reinbacher, Wanbin Son

Comput. Geom., 2011

Generating Realistic Roofs over a Rectilinear Polygon.

Hee-Kap Ahn, Sang Won Bae, Christian Knauer, Mira Lee, Chan-Su Shin, Antoine Vigneron

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

2010

Best and worst-case coverage problems for arbitrary paths in wireless sensor networks.

Chunseok Lee, Donghoon Shin, Sang Won Bae, Sunghee Choi

Proceedings of the IEEE 7th International Conference on Mobile Adhoc and Sensor Systems, 2010

The Onion Diagram: A Voronoi-Like Tessellation of a Planar Line Space and Its Applications - (Extended Abstract).

Sang Won Bae, Chan-Su Shin

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

The Geodesic Diameter of Polygonal Domains.

Sang Won Bae, Matias Korman, Yoshio Okamoto

Proceedings of the Algorithms, 2010

2009

Geometric stable roommates.

Esther M. Arkin, Sang Won Bae, Alon Efrat, Kazuya Okamoto, Joseph S. B. Mitchell, Valentin Polishchuk

Inf. Process. Lett., 2009

Computing minimum-area rectilinear convex hull and L-shape.

Sang Won Bae, Chunseok Lee, Hee-Kap Ahn, Sunghee Choi, Kyung-Yong Chwa

Comput. Geom., 2009

On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem.

Sang Won Bae, Chunseok Lee, Sunghee Choi

Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

All Farthest Neighbors in the Presence of Highways and Obstacles.

Sang Won Bae, Matias Korman, Takeshi Tokuyama

Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

Querying Two Boundary Points for Shortest Paths in a Polygonal Domain.

Sang Won Bae, Yoshio Okamoto

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Exact Algorithms for the Bottleneck Steiner Tree Problem.

Sang Won Bae, Sunghee Choi, Chunseok Lee, Shin-ichi Tanigawa

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Square and Rectangle Covering with Outliers.

Hee-Kap Ahn, Sang Won Bae, Sang-Sub Kim, Matias Korman, Iris Reinbacher, Wanbin Son

Proceedings of the Frontiers in Algorithmics, Third International Workshop, 2009

The geodesic farthest-site Voronoi diagram in a polygonal domain with holes.

Sang Won Bae, Kyung-Yong Chwa

Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

Optimal Empty Pseudo-Triangles in a Point Set.

Hee-Kap Ahn, Sang Won Bae, Iris Reinbacher

Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2008

Covering a Point Set by Two Disjoint Rectangles.

Hee-Kap Ahn, Sang Won Bae

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007

Maintaining Extremal Points and Its Applications to Deciding Optimal Orientations.

Sang Won Bae, Chunseok Lee, Hee-Kap Ahn, Sunghee Choi, Kyung-Yong Chwa

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Aperture-angle and Hausdorff-approximation of convex figures.

Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson

Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

Constructing Optimal Highways.

Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff

Proceedings of the Theory of Computing 2007. Proceedings of the Thirteenth Computing: The Australasian Theory Symposium (CATS2007). January 30, 2007

2006

Optimal Construction of the City Voronoi Diagram.

Sang Won Bae, Jae-Hoon Kim, Kyung-Yong Chwa

Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

2005

Shortest Paths and Voronoi Diagrams with Transportation Networks Under General Distances.

Sang Won Bae, Kyung-Yong Chwa

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Casting an Object with a Core.

Hee-Kap Ahn, Sang Won Bae, Siu-Wing Cheng, Kyung-Yong Chwa

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2004

Voronoi Diagrams with a Transportation Network on the Euclidean Plane.

Sang Won Bae, Kyung-Yong Chwa

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004