The following pages link to Sang Won Bae (Q283874):
Displaying 50 items.
- An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments (Q283875) (← links)
- Realistic roofs over a rectilinear polygon (Q364851) (← links)
- The geodesic diameter of polygonal domains (Q368771) (← links)
- Theta-3 is connected (Q396473) (← links)
- Querying two boundary points for shortest paths in a polygonal domain (Q419498) (← links)
- A generalization of the convex Kakeya problem (Q486985) (← links)
- Group nearest-neighbor queries in the \(L_1\) plane (Q500965) (← links)
- Computing the \(L_1\) geodesic diameter and center of a polygonal domain (Q527444) (← links)
- Covering points by disjoint boxes with outliers (Q617548) (← links)
- Exact algorithms for the bottleneck Steiner tree problem (Q652535) (← links)
- Shortcuts for the circle (Q670711) (← links)
- Empty pseudo-triangles in point sets (Q765318) (← links)
- On exact solutions to the Euclidean bottleneck Steiner tree problem (Q765514) (← links)
- Minimum-width double-strip and parallelogram annulus (Q784485) (← links)
- On the minimum-area rectangular and square annulus problem (Q827319) (← links)
- Computing minimum-area rectilinear convex hull and \(L\)-shape (Q833717) (← links)
- Bundling three convex polygons to minimize area or perimeter (Q902419) (← links)
- Geometric stable roommates (Q976079) (← links)
- Casting an object with a core (Q1024213) (← links)
- Computing the geodesic centers of a polygonal domain (Q1622342) (← links)
- The minimum convex container of two convex polytopes under translations (Q1622345) (← links)
- Computing a minimum-width square or rectangular annulus with outliers (Q1624585) (← links)
- On finding a longest common palindromic subsequence (Q1698702) (← links)
- Computing a minimum-width square annulus in arbitrary orientation (Q1705772) (← links)
- Covering points with convex sets of minimum size (Q1705773) (← links)
- Gap-planar graphs (Q1786592) (← links)
- Faster counting empty convex polygons in a planar point set (Q2059898) (← links)
- Rearranging a sequence of points onto a line (Q2144451) (← links)
- Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments (Q2248734) (← links)
- \(L_{1}\) shortest path queries in simple polygons (Q2272388) (← links)
- Computing a minimum-width cubic and hypercubic shell (Q2294346) (← links)
- Faster algorithms for growing prioritized disks and rectangles (Q2330036) (← links)
- Tight bounds for beacon-based coverage in simple rectilinear polygons (Q2330037) (← links)
- Computing a geodesic two-center of points in a simple polygon (Q2331214) (← links)
- Closest-pair queries in fat rectangles (Q2331215) (← links)
- Area bounds of rectilinear polygons realized by angle sequences (Q2331216) (← links)
- \(L_1\) geodesic farthest neighbors in a simple polygon and related problems (Q2334499) (← links)
- Reprint of: Theta-3 is connected (Q2341694) (← links)
- Computing the \(L_1\) geodesic diameter and center of a simple polygon in linear time (Q2349742) (← links)
- The reverse Kakeya problem (Q2664125) (← links)
- Empty squares in arbitrary orientation among points (Q2700381) (← links)
- Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons (Q2802931) (← links)
- Computing a Minimum-Width Square Annulus in Arbitrary Orientation (Q2803818) (← links)
- Computing a Minimum-Width Square or Rectangular Annulus with Outliers (Q2817885) (← links)
- Bundling Three Convex Polygons to Minimize Area or Perimeter (Q2842137) (← links)
- Farthest Voronoi Diagrams under Travel Time Metrics (Q2889898) (← links)
- Tight Bound for Farthest-Color Voronoi Diagrams of Line Segments (Q2889899) (← links)
- The Onion Diagram: A Voronoi-Like Tessellation of a Planar Line Space and Its Applications (Q3060776) (← links)
- COVERING A POINT SET BY TWO DISJOINT RECTANGLES (Q3089094) (← links)
- Generating Realistic Roofs over a Rectilinear Polygon (Q3104600) (← links)
