Stop the war!Остановите войну!
for scientists:
Google
Google Scholar
Semantic Scholar
IA Scholar
CiteSeerX
ORCIDSang Won Bae
Person information
- affiliation: Kyonggi University, Suwon, Republic of Korea
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j57]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)- [j56]Sang Won Bae:
Faster counting empty convex polygons in a planar point set. Inf. Process. Lett. 175: 106221 (2022) - [j55]Young-Hun Sung, Sang Won Bae:
Counting Non-Convex 5-Holes in a Planar Point Set. Symmetry 14(1): 78 (2022) - [j54]Sang Won Bae:
On the Minimum-Area Parallelogram Annulus Problem. Symmetry 14(2): 359 (2022) - 2021
- [j53]Sang Won Bae:
On the minimum-area rectangular and square annulus problem. Comput. Geom. 92: 101697 (2021) - [j52]Sang Won Bae, Arpita Baral, Priya Ranjan Sinha Mahapatra:
Maximum-width empty square and rectangular annulus. Comput. Geom. 96: 101747 (2021) - [j51]Young-Hun Sung, Sang Won Bae:
Counting Convex and Non-Convex 4-Holes in a Point Set. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 104-A(9): 1094-1100 (2021) - [j50]Sang Won Bae:
Minimum-Width Parallelogram Annulus with Given Angles. J. Comput. Sci. Eng. 15(2): 78-83 (2021) - [c47]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
- [j49]Sang Won Bae:
Minimum-Width Cuboidal Shells with Outliers. J. Comput. Sci. Eng. 14(1): 1-8 (2020) - [j48]Sang Won Bae:
Minimum-width double-strip and parallelogram annulus. Theor. Comput. Sci. 833: 133-146 (2020) - [c46]Sang Won Bae, Sang Duk Yoon:
Empty Squares in Arbitrary Orientation Among Points. SoCG 2020: 13:1-13:17
2010 – 2019
- 2019
- [j47]Sang Won Bae:
Computing a minimum-width square or rectangular annulus with outliers. Comput. Geom. 76: 33-45 (2019) - [j46]Sang Won Bae, Matias Korman, Yoshio Okamoto:
Computing the geodesic centers of a polygonal domain. Comput. Geom. 77: 3-9 (2019) - [j45]Hee-Kap Ahn, Judit Abardia, Sang Won Bae, Otfried Cheong, Susanna Dann, Dongwoo Park, Chan-Su Shin:
The minimum convex container of two convex polytopes under translations. Comput. Geom. 77: 40-50 (2019) - [j44]Sang Won Bae, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Christos Levcopoulos:
Shortcuts for the circle. Comput. Geom. 79: 37-54 (2019) - [j43]Hee-Kap Ahn, Sang Won Bae, Jong Min Choi, Matias Korman, Wolfgang Mulzer, Eunjin Oh, Ji-won Park, André van Renssen, Antoine Vigneron:
Faster algorithms for growing prioritized disks and rectangles. Comput. Geom. 80: 23-39 (2019) - [j42]Sang Won Bae, Chan-Su Shin, Antoine Vigneron:
Tight bounds for beacon-based coverage in simple rectilinear polygons. Comput. Geom. 80: 40-52 (2019) - [j41]Eunjin Oh, Sang Won Bae, Hee-Kap Ahn:
Computing a geodesic two-center of points in a simple polygon. Comput. Geom. 82: 45-59 (2019) - [j40]Sang Won Bae, Michiel H. M. Smid:
Closest-pair queries in fat rectangles. Comput. Geom. 83: 1-8 (2019) - [j39]Sang Won Bae, Yoshio Okamoto, Chan-Su Shin:
Area bounds of rectilinear polygons realized by angle sequences. Comput. Geom. 83: 9-29 (2019) - [j38]Sang Won Bae:
L1 Geodesic Farthest Neighbors in a Simple Polygon and Related Problems. Discret. Comput. Geom. 62(4): 743-774 (2019) - [j37]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) - [j36]Sang Won Bae:
Computing a minimum-width cubic and hypercubic shell. Oper. Res. Lett. 47(5): 398-405 (2019) - [j35]Sang Won Bae, Haitao Wang:
L1 shortest path queries in simple polygons. Theor. Comput. Sci. 790: 105-116 (2019) - [c45]Sang Won Bae:
Minimum-Width Double-Strip and Parallelogram Annulus. ISAAC 2019: 25:1-25:14 - [c44]Sang Won Bae, Arpita Baral, Priya Ranjan Sinha Mahapatra:
Maximum-Width Empty Square and Rectangular Annulus. WALCOM 2019: 69-81 - [i22]Sang Won Bae:
On the Minimum-Area Rectangular and Square Annulus Problem. CoRR abs/1904.06832 (2019) - [i21]Sang Won Bae:
Computing a Minimum-Width Cubic and Hypercubic Shell. CoRR abs/1904.06833 (2019) - [i20]Eunjin Oh, Sang Won Bae, Hee-Kap Ahn:
Computing a Geodesic Two-Center of Points in a Simple Polygon. CoRR abs/1910.12177 (2019) - [i19]Sang Won Bae:
Minimum-Width Double-Strip and Parallelogram Annulus. CoRR abs/1911.07504 (2019) - [i18]Sang Won Bae, Sang Duk Yoon:
Empty Squares in Arbitrary Orientation Among Points. CoRR abs/1911.12988 (2019) - 2018
- [j34]Sang Won Bae, Inbok Lee:
On finding a longest common palindromic subsequence. Theor. Comput. Sci. 710: 29-34 (2018) - [j33]Sang Won Bae:
Computing a minimum-width square annulus in arbitrary orientation. Theor. Comput. Sci. 718: 2-13 (2018) - [j32]Sang Won Bae, Hwan-Gue Cho, William S. Evans, Noushin Saeedi, Chan-Su Shin:
Covering points with convex sets of minimum size. Theor. Comput. Sci. 718: 14-23 (2018) - [j31]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:
Gap-planar graphs. Theor. Comput. Sci. 745: 36-52 (2018) - [c43]Sang Won Bae, Sergio Cabello, Otfried Cheong, Yoonsung Choi, Fabian Stehn, Sang Duk Yoon:
The Reverse Kakeya Problem. SoCG 2018: 6:1-6:13 - [c42]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 - [i17]Sang Won Bae, Haitao Wang:
L1 Shortest Path Queries in Simple Polygons. CoRR abs/1809.07481 (2018) - [i16]Sang Won Bae, Michiel H. M. Smid:
Closest-Pair Queries in Fat Rectangles. CoRR abs/1809.10531 (2018) - [i15]Sang Won Bae, Arpita Baral, Priya Ranjan Sinha Mahapatra:
Maximum-Width Empty Square and Rectangular Annulus. CoRR abs/1811.06217 (2018) - 2017
- [j30]Sang Won Bae, Matias Korman, Joseph S. B. Mitchell, Yoshio Okamoto, Valentin Polishchuk, Haitao Wang:
Computing the L1 Geodesic Diameter and Center of a Polygonal Domain. Discret. Comput. Geom. 57(3): 674-701 (2017) - [c41]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:
Gap-Planar Graphs. Graph Drawing 2017: 531-545 - [c40]Hee-Kap Ahn, Sang Won Bae, Jong Min Choi, Matias Korman, Wolfgang Mulzer, Eunjin Oh, Ji-won Park, André van Renssen, Antoine Vigneron:
Faster Algorithms for Growing Prioritized Disks and Rectangles. ISAAC 2017: 3:1-3:13 - [c39]Sang Won Bae, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Christos Levcopoulos:
Shortcuts for the Circle. ISAAC 2017: 9:1-9:13 - [i14]Hee-Kap Ahn, Sang Won Bae, Jong Min Choi, Matias Korman, Wolfgang Mulzer, Eunjin Oh, Ji-won Park, André van Renssen, Antoine Vigneron:
Faster Algorithms for Growing Prioritized Disks and Rectangles. CoRR abs/1704.07580 (2017) - [i13]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:
Gap-planar Graphs. CoRR abs/1708.07653 (2017) - 2016
- [j29]Dongwoo Park, Sang Won Bae, Helmut Alt, Hee-Kap Ahn:
Bundling three convex polygons to minimize area or perimeter. Comput. Geom. 51: 1-14 (2016) - [j28]Sang Won Bae:
An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments. Comput. Geom. 52: 34-43 (2016) - [j27]Jang Won Bae, Sang Won Bae, Il-Chul Moon, Tag Gon Kim:
Efficient Flattening Algorithm for Hierarchical and Dynamic Structure Discrete Event Models. ACM Trans. Model. Comput. Simul. 26(4): 25:1-25:25 (2016) - [c38]Sang Won Bae:
Computing a Minimum-Width Square or Rectangular Annulus with Outliers - [Extended Abstract]. COCOON 2016: 443-454 - [c37]Juyoung Yon, Sang Won Bae, Siu-Wing Cheng, Otfried Cheong, Bryan T. Wilkinson:
Approximating Convex Shapes With Respect to Symmetric Difference Under Homotheties. SoCG 2016: 63:1-63:15 - [c36]Sang Won Bae:
L_1 Geodesic Farthest Neighbors in a Simple Polygon and Related Problems. ISAAC 2016: 14:1-14:12 - [c35]Sang Won Bae, Chan-Su Shin, Antoine Vigneron:
Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons. LATIN 2016: 110-122 - [c34]Eunjin Oh, Sang Won Bae, Hee-Kap Ahn:
Computing a Geodesic Two-Center of Points in a Simple Polygon. LATIN 2016: 646-658 - [c33]Sang Won Bae, Matias Korman, Joseph S. B. Mitchell, Yoshio Okamoto, Valentin Polishchuk, Haitao Wang:
Computing the L1 Geodesic Diameter and Center of a Polygonal Domain. STACS 2016: 14:1-14:14 - [c32]Sang Won Bae:
Computing a Minimum-Width Square Annulus in Arbitrary Orientation - [Extended Abstract]. WALCOM 2016: 131-142 - [i12]Sang Won Bae, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Christos Levcopoulos:
Shortcuts for the Circle. CoRR abs/1612.02412 (2016) - 2015
- [j26]Oswin Aichholzer, Sang Won Bae, Luis Barba, Prosenjit Bose, Matias Korman, André van Renssen, Perouz Taslakian, Sander Verdonschot:
Reprint of: Theta-3 is connected. Comput. Geom. 48(5): 407-414 (2015) - [j25]Sang Won Bae, Matias Korman, Yoshio Okamoto, Haitao Wang:
Computing the L1 geodesic diameter and center of a simple polygon in linear time. Comput. Geom. 48(6): 495-505 (2015) - [j24]Wanbin Son, Sang Won Bae, Hee-Kap Ahn:
Group nearest-neighbor queries in the L1 plane. Theor. Comput. Sci. 592: 39-48 (2015) - [c31]Sang Won Bae:
An Almost Optimal Algorithm for Voronoi Diagrams of Non-disjoint Line Segments - (Extended Abstract). WALCOM 2015: 125-136 - [i11]Sang Won Bae, Chan-Su Shin, Antoine Vigneron:
Improved Bounds for Beacon-Based Coverage and Routing in Simple Rectilinear Polygons. CoRR abs/1505.05106 (2015) - [i10]Sang Won Bae, Matias Korman, Yoshio Okamoto:
Computing the Geodesic Centers of a Polygonal Domain. CoRR abs/1509.07214 (2015) - [i9]Sang Won Bae, Matias Korman, Joseph S. B. Mitchell, Yoshio Okamoto, Valentin Polishchuk, Haitao Wang:
Computing the L1 Geodesic Diameter and Center of a Polygonal Domain. CoRR abs/1512.07160 (2015) - 2014
- [j23]Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson, Takeshi Tokuyama, Antoine Vigneron:
A Generalization of the Convex Kakeya Problem. Algorithmica 70(2): 152-170 (2014) - [j22]Sang Won Bae:
Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments. Comput. Geom. 47(8): 779-788 (2014) - [j21]Oswin Aichholzer, Sang Won Bae, Luis Barba, Prosenjit Bose, Matias Korman, André van Renssen, Perouz Taslakian, Sander Verdonschot:
Theta-3 is connected. Comput. Geom. 47(9): 910-917 (2014) - [j20]Sang Won Bae, Kyung-Yong Chwa:
Travel Time Distances Induced by Transportation Networks and General Underlying Distances. J. Inf. Sci. Eng. 30(5): 1445-1461 (2014) - [c30]Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Dongwoo Park, Chan-Su Shin:
Minimum Convex Container of Two Convex Polytopes under Translations. CCCG 2014 - [c29]Sang Won Bae, Matias Korman, Yoshio Okamoto:
Computing the Geodesic Centers of a Polygonal Domain. CCCG 2014 - [c28]Sang Won Bae, Matias Korman, Yoshio Okamoto, Haitao Wang:
Computing the L 1 Geodesic Diameter and Center of a Simple Polygon in Linear Time. LATIN 2014: 120-131 - [i8]Oswin Aichholzer, Sang Won Bae, Luis Barba, Prosenjit Bose, Matias Korman, André van Renssen, Perouz Taslakian, Sander Verdonschot:
Theta-3 is connected. CoRR abs/1404.7186 (2014) - 2013
- [j19]Chunseok Lee, Donghoon Shin, Sang Won Bae, Sunghee Choi:
Best and worst-case coverage problems for arbitrary paths in wireless sensor networks. Ad Hoc Networks 11(6): 1699-1714 (2013) - [j18]Hee-Kap Ahn, Sang Won Bae, Christian Knauer, Mira Lee, Chan-Su Shin, Antoine Vigneron:
Realistic roofs over a rectilinear polygon. Comput. Geom. 46(9): 1042-1055 (2013) - [j17]Sang Won Bae, Matias Korman, Yoshio Okamoto:
The Geodesic Diameter of Polygonal Domains. Discret. Comput. Geom. 50(2): 306-329 (2013) - [c27]Oswin Aichholzer, Sang Won Bae, Luis Barba, Prosenjit Bose, Matias Korman, André van Renssen, Perouz Taslakian, Sander Verdonschot:
Theta-3 is connected. CCCG 2013 - [c26]Hee-Kap Ahn, Sang Won Bae, Wanbin Son:
Group Nearest Neighbor Queries in the L 1 Plane. TAMC 2013: 52-61 - [c25]Hee-Kap Ahn, Helmut Alt, Sang Won Bae, Dongwoo Park:
Bundling Three Convex Polygons to Minimize Area or Perimeter. WADS 2013: 13-24 - [i7]Sang Won Bae, Matias Korman, Yoshio Okamoto, Haitao Wang:
Computing the L1 Geodesic Diameter and Center of a Simple Polygon in Linear Time. CoRR abs/1312.3711 (2013) - 2012
- [j16]Sang Won Bae, Yoshio Okamoto:
Querying two boundary points for shortest paths in a polygonal domain. Comput. Geom. 45(7): 284-293 (2012) - [j15]Sang Won Bae:
On Linear-Sized Farthest-Color Voronoi Diagrams. IEICE Trans. Inf. Syst. 95-D(3): 731-736 (2012) - [j14]Sang Won Bae, Chan-Su Shin:
The Onion Diagram: a Voronoi-like Tessellation of a Planar Line Space and its Applications. Int. J. Comput. Geom. Appl. 22(1): 3-26 (2012) - [j13]Jaehwan Ma, Sang Won Bae, Sunghee Choi:
3D medial axis point approximation using nearest neighbors and the normal field. Vis. Comput. 28(1): 7-19 (2012) - [c24]Hee-Kap Ahn, Sang Won Bae, Shin-ichi Tanigawa:
Rectilinear Covering for Imprecise Input Points - (Extended Abstract). ISAAC 2012: 309-318 - [c23]Sang Won Bae, Yoshio Okamoto, Chan-Su Shin:
Area Bounds of Rectilinear Polygons Realized by Angle Sequences. ISAAC 2012: 629-638 - [c22]Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson, Takeshi Tokuyama, Antoine Vigneron:
A Generalization of the Convex Kakeya Problem. LATIN 2012: 1-12 - [c21]Sang Won Bae, Kyung-Yong Chwa:
Farthest Voronoi Diagrams under Travel Time Metrics - (Extended Abstract). WALCOM 2012: 28-39 - [c20]Sang Won Bae:
Tight Bound for Farthest-Color Voronoi Diagrams of Line Segments. WALCOM 2012: 40-51 - [i6]Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson, Takeshi Tokuyama, Antoine Vigneron:
A Generalization of the Convex Kakeya Problem. CoRR abs/1209.2171 (2012) - 2011
- [j12]Sang Won Bae, Sunghee Choi, Chunseok Lee, Shin-ichi Tanigawa:
Exact Algorithms for the Bottleneck Steiner Tree Problem. Algorithmica 61(4): 924-948 (2011) - [j11]Hee-Kap Ahn, Sang Won Bae, Erik D. Demaine, Martin L. Demaine, Sang-Sub Kim, Matias Korman, Iris Reinbacher, Wanbin Son:
Covering points by disjoint boxes with outliers. Comput. Geom. 44(3): 178-190 (2011) - [j10]Hee-Kap Ahn, Sang Won Bae, Marc J. van Kreveld, Iris Reinbacher, Bettina Speckmann:
Empty pseudo-triangles in point sets. Discret. Appl. Math. 159(18): 2205-2213 (2011) - [j9]Sang-Sub Kim, Sang Won Bae, Hee-Kap Ahn:
Covering a Point Set by Two Disjoint Rectangles. Int. J. Comput. Geom. Appl. 21(3): 313-330 (2011) - [c19]Hee-Kap Ahn, Sang Won Bae, Christian Knauer, Mira Lee, Chan-Su Shin, Antoine Vigneron:
Generating Realistic Roofs over a Rectilinear Polygon. ISAAC 2011: 60-69 - 2010
- [j8]Sang Won Bae, Chunseok Lee, Sunghee Choi:
On exact solutions to the Euclidean bottleneck Steiner tree problem. Inf. Process. Lett. 110(16): 672-678 (2010) - [c18]Sang Won Bae, Matias Korman, Yoshio Okamoto:
The Geodesic Diameter of Polygonal Domains. ESA (1) 2010: 500-511 - [c17]Sang Won Bae, Chan-Su Shin:
The Onion Diagram: A Voronoi-Like Tessellation of a Planar Line Space and Its Applications - (Extended Abstract). ISAAC (2) 2010: 230-241 - [c16]Chunseok Lee, Donghoon Shin, Sang Won Bae, Sunghee Choi:
Best and worst-case coverage problems for arbitrary paths in wireless sensor networks. MASS 2010: 127-136 - [i5]Sang Won Bae, Matias Korman, Yoshio Okamoto:
The Geodesic Diameter of Polygonal Domains. CoRR abs/1001.0695 (2010)
2000 – 2009
- 2009
- [j7]Hee-Kap Ahn, Sang Won Bae, Siu-Wing Cheng, Kyung-Yong Chwa:
Casting an Object with a Core. Algorithmica 54(1): 72-88 (2009) - [j6]Sang Won Bae, Chunseok Lee, Hee-Kap Ahn, Sunghee Choi, Kyung-Yong Chwa:
Computing minimum-area rectilinear convex hull and L-shape. Comput. Geom. 42(9): 903-912 (2009) - [j5]Sang Won Bae, Jae-Hoon Kim, Kyung-Yong Chwa:
Optimal Construction of the City Voronoi Diagram. Int. J. Comput. Geom. Appl. 19(2): 95-117 (2009) - [j4]Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff:
Constructing Optimal Highways. Int. J. Found. Comput. Sci. 20(1): 3-23 (2009) - [j3]Esther M. Arkin, Sang Won Bae, Alon Efrat, Kazuya Okamoto, Joseph S. B. Mitchell, Valentin Polishchuk:
Geometric stable roommates. Inf. Process. Lett. 109(4): 219-224 (2009) - [c15]Hee-Kap Ahn, Sang Won Bae, Iris Reinbacher:
Optimal Empty Pseudo-Triangles in a Point Set. CCCG 2009: 5-8 - [c14]Sang Won Bae, Kyung-Yong Chwa:
The geodesic farthest-site Voronoi diagram in a polygonal domain with holes. SCG 2009: 198-207 - [c13]Hee-Kap Ahn, Sang Won Bae, Sang-Sub Kim, Matias Korman, Iris Reinbacher, Wanbin Son:
Square and Rectangle Covering with Outliers. FAW 2009: 132-140 - [c12]Sang Won Bae, Sunghee Choi, Chunseok Lee, Shin-ichi Tanigawa:
Exact Algorithms for the Bottleneck Steiner Tree Problem. ISAAC 2009: 24-33 - [c11]Sang Won Bae, Yoshio Okamoto:
Querying Two Boundary Points for Shortest Paths in a Polygonal Domain. ISAAC 2009: 1054-1063 - [c10]Sang Won Bae, Matias Korman, Takeshi Tokuyama:
All Farthest Neighbors in the Presence of Highways and Obstacles. WALCOM 2009: 71-82 - [c9]Sang Won Bae, Chunseok Lee, Sunghee Choi:
On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem. WALCOM 2009: 105-116 - [i4]Hee-Kap Ahn, Sang Won Bae, Erik D. Demaine, Martin L. Demaine, Sang-Sub Kim, Matias Korman, Iris Reinbacher, Wanbin Son:
Covering Points by Disjoint Boxes with Outliers. CoRR abs/0910.1643 (2009) - [i3]Sang Won Bae, Yoshio Okamoto:
Querying Two Boundary Points for Shortest Paths in a Polygonal Domain. CoRR abs/0911.5017 (2009) - 2008
- [j2]Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson:
Aperture-Angle and Hausdorff-Approximation of Convex Figures. Discret. Comput. Geom. 40(3): 414-429 (2008) - [c8]Hee-Kap Ahn, Sang Won Bae:
Covering a Point Set by Two Disjoint Rectangles. ISAAC 2008: 728-739 - 2007
- [c7]Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff:
Constructing Optimal Highways. CATS 2007: 7-14 - [c6]Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson:
Aperture-angle and Hausdorff-approximation of convex figures. SCG 2007: 37-45 - [c5]Sang Won Bae, Chunseok Lee, Hee-Kap Ahn, Sunghee Choi, Kyung-Yong Chwa:
Maintaining Extremal Points and Its Applications to Deciding Optimal Orientations. ISAAC 2007: 788-799 - [i2]Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson:
Aperture-Angle and Hausdorff-Approximation of Convex Figures. CoRR abs/cs/0702090 (2007) - [i1]Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff:
Constructing Optimal Highways. CoRR abs/cs/0703037 (2007) - 2006
- [j1]Sang Won Bae, Kyung-Yong Chwa:
Voronoi Diagrams for a Transportation Network on the Euclidean Plane. Int. J. Comput. Geom. Appl. 16(2-3): 117-144 (2006) - [c4]Sang Won Bae, Jae-Hoon Kim, Kyung-Yong Chwa:
Optimal Construction of the City Voronoi Diagram. ISAAC 2006: 183-192 - 2005
- [c3]Hee-Kap Ahn, Sang Won Bae, Siu-Wing Cheng, Kyung-Yong Chwa:
Casting an Object with a Core. ISAAC 2005: 40-49 - [c2]Sang Won Bae, Kyung-Yong Chwa:
Shortest Paths and Voronoi Diagrams with Transportation Networks Under General Distances. ISAAC 2005: 1007-1018 - 2004
- [c1]Sang Won Bae, Kyung-Yong Chwa:
Voronoi Diagrams with a Transportation Network on the Euclidean Plane. ISAAC 2004: