Sang Won Bae

Affiliations:
  • Kyonggi University, Suwon, Republic of Korea


According to our database1, Sang Won Bae authored at least 83 papers between 2005 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

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

On the Minimum-Area Parallelogram Annulus Problem.
Symmetry, 2022

Faster counting empty convex polygons in a planar point set.
Inf. Process. Lett., 2022

2021
Minimum-Width Parallelogram Annulus with Given Angles.
J. Comput. Sci. Eng., 2021

Counting Convex and Non-Convex 4-Holes in a Point Set.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021

Maximum-width empty square and rectangular annulus.
Comput. Geom., 2021

On the minimum-area rectangular and square annulus problem.
Comput. Geom., 2021

Rearranging a Sequence of Points onto a Line.
Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

2020
Minimum-width double-strip and parallelogram annulus.
Theor. Comput. Sci., 2020

Minimum-Width Cuboidal Shells with Outliers.
J. Comput. Sci. Eng., 2020

Empty Squares in Arbitrary Orientation Among Points.
Proceedings of the 36th International Symposium on Computational Geometry, 2020

2019
<i>L</i><sub>1</sub> shortest path queries in simple polygons.
Theor. Comput. Sci., 2019

Computing a minimum-width cubic and hypercubic shell.
Oper. Res. Lett., 2019

Minimum-width annulus with outliers: Circular, square, and rectangular cases.
Inf. Process. Lett., 2019

L<sub>1</sub> Geodesic Farthest Neighbors in a Simple Polygon and Related Problems.
Discret. Comput. Geom., 2019

Computing a geodesic two-center of points in a simple polygon.
Comput. Geom., 2019

Tight bounds for beacon-based coverage in simple rectilinear polygons.
Comput. Geom., 2019

Closest-pair queries in fat rectangles.
Comput. Geom., 2019

Area bounds of rectilinear polygons realized by angle sequences.
Comput. Geom., 2019

Computing the geodesic centers of a polygonal domain.
Comput. Geom., 2019

Shortcuts for the circle.
Comput. Geom., 2019

Computing a minimum-width square or rectangular annulus with outliers.
Comput. Geom., 2019

Faster algorithms for growing prioritized disks and rectangles.
Comput. Geom., 2019

The minimum convex container of two convex polytopes under translations.
Comput. Geom., 2019

2018
On finding a longest common palindromic subsequence.
Theor. Comput. Sci., 2018

Covering points with convex sets of minimum size.
Theor. Comput. Sci., 2018

Gap-planar graphs.
Theor. Comput. Sci., 2018

Computing a minimum-width square annulus in arbitrary orientation.
Theor. Comput. Sci., 2018

L<sub>1</sub> Shortest Path Queries in Simple Polygons.
CoRR, 2018

The Reverse Kakeya Problem.
Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017
Computing the L<sub>1</sub> Geodesic Diameter and Center of a Polygonal Domain.
Discret. Comput. Geom., 2017

2016
Efficient Flattening Algorithm for Hierarchical and Dynamic Structure Discrete Event Models.
ACM Trans. Model. Comput. Simul., 2016

Bundling three convex polygons to minimize area or perimeter.
Comput. Geom., 2016

An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments.
Comput. Geom., 2016

Computing a Minimum-Width Square Annulus in Arbitrary Orientation - [Extended Abstract].
Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

Computing the L1 Geodesic Diameter and Center of a Polygonal Domain.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

L_1 Geodesic Farthest Neighbors in a Simple Polygon and Related Problems.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

Approximating Convex Shapes With Respect to Symmetric Difference Under Homotheties.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

Computing a Minimum-Width Square or Rectangular Annulus with Outliers - [Extended Abstract].
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015
Group nearest-neighbor queries in the <sub>L</sub><sub>1</sub> plane.
Theor. Comput. Sci., 2015

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

Computing the L1 geodesic diameter and center of a simple polygon in linear time.
Comput. Geom., 2015

Reprint of: Theta-3 is connected.
Comput. Geom., 2015

An Almost Optimal Algorithm for Voronoi Diagrams of Non-disjoint Line Segments - (Extended Abstract).
Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

2014
Travel Time Distances Induced by Transportation Networks and General Underlying Distances.
J. Inf. Sci. Eng., 2014

Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments.
Comput. Geom., 2014

Theta-3 is connected.
Comput. Geom., 2014

A Generalization of the Convex Kakeya Problem.
Algorithmica, 2014

Computing the L 1 Geodesic Diameter and Center of a Simple Polygon in Linear Time.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Minimum Convex Container of Two Convex Polytopes under Translations.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013
The Geodesic Diameter of Polygonal Domains.
Discret. Comput. Geom., 2013

Computing the L<sub>1</sub> Geodesic Diameter and Center of a Simple Polygon in Linear Time.
CoRR, 2013

Realistic roofs over a rectilinear polygon.
Comput. Geom., 2013

Best and worst-case coverage problems for arbitrary paths in wireless sensor networks.
Ad Hoc Networks, 2013

Group Nearest Neighbor Queries in the <i>L</i> <sub>1</sub> Plane.
Proceedings of the Theory and Applications of Models of Computation, 2013

2012
3D medial axis point approximation using nearest neighbors and the normal field.
Vis. Comput., 2012

The Onion Diagram: a Voronoi-like Tessellation of a Planar Line Space and its Applications.
Int. J. Comput. Geom. Appl., 2012

On Linear-Sized Farthest-Color Voronoi Diagrams.
IEICE Trans. Inf. Syst., 2012

Querying two boundary points for shortest paths in a polygonal domain.
Comput. Geom., 2012

Farthest Voronoi Diagrams under Travel Time Metrics - (Extended Abstract).
Proceedings of the WALCOM: Algorithms and Computation - 6th International Workshop, 2012

Tight Bound for Farthest-Color Voronoi Diagrams of Line Segments.
Proceedings of the WALCOM: Algorithms and Computation - 6th International Workshop, 2012

Rectilinear Covering for Imprecise Input Points - (Extended Abstract).
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

2011
Covering a Point Set by Two Disjoint Rectangles.
Int. J. Comput. Geom. Appl., 2011

Empty pseudo-triangles in point sets.
Discret. Appl. Math., 2011

Covering points by disjoint boxes with outliers.
Comput. Geom., 2011

Exact Algorithms for the Bottleneck Steiner Tree Problem.
Algorithmica, 2011

Generating Realistic Roofs over a Rectilinear Polygon.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

2010
On exact solutions to the Euclidean bottleneck Steiner tree problem.
Inf. Process. Lett., 2010

The Onion Diagram: A Voronoi-Like Tessellation of a Planar Line Space and Its Applications - (Extended Abstract).
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

2009
Geometric stable roommates.
Inf. Process. Lett., 2009

Constructing Optimal Highways.
Int. J. Found. Comput. Sci., 2009

Optimal Construction of the City Voronoi Diagram.
Int. J. Comput. Geom. Appl., 2009

Computing minimum-area rectilinear convex hull and L-shape.
Comput. Geom., 2009

Casting an Object with a Core.
Algorithmica, 2009

All Farthest Neighbors in the Presence of Highways and Obstacles.
Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

Square and Rectangle Covering with Outliers.
Proceedings of the Frontiers in Algorithmics, Third International Workshop, 2009

The geodesic farthest-site Voronoi diagram in a polygonal domain with holes.
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

Optimal Empty Pseudo-Triangles in a Point Set.
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2008
Aperture-Angle and Hausdorff-Approximation of Convex Figures.
Discret. Comput. Geom., 2008

Covering a Point Set by Two Disjoint Rectangles.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007
Maintaining Extremal Points and Its Applications to Deciding Optimal Orientations.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

2006
Voronoi Diagrams for a Transportation Network on the Euclidean Plane.
Int. J. Comput. Geom. Appl., 2006

2005
Shortest Paths and Voronoi Diagrams with Transportation Networks Under General Distances.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005


  Loading...