activity
20122019
most citedImproved Bounds for Beacon-Based Coverage and Routing in Simple Rectilinear Polygons

3 citations · 3 across the 3 of their papers we have counts for

collaborators
Showing cs.CGShow all

9 papers · 1 filter

cs.CG2019

Empty Squares in Arbitrary Orientation Among Points

Sang Won Bae, Sang Duk Yoon

This paper studies empty squares in arbitrary orientation among a set of points in the plane. We prove that the number of empty squares with four contact pairs is between $…

cs.CG2019

Minimum-Width Double-Strip and Parallelogram Annulus

Sang Won Bae

In this paper, we study the problem of computing a minimum-width double-strip or parallelogram annulus that encloses a given set of points in the plane. A double-strip is a clo…

cs.CG2019

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

Eunjin Oh, Sang Won Bae, Hee-Kap Ahn

Given a simple polygon and a set of points contained in , we consider the geodesic -center problem where we want to find points, called \emph{centers}, in to…

cs.CG2019

Computing a Minimum-Width Cubic and Hypercubic Shell

Sang Won Bae

In this paper, we study the problem of computing a minimum-width axis-aligned cubic shell that encloses a given set of points in a three-dimensional space. A cubic shell is a c…

cs.CG2019

On the Minimum-Area Rectangular and Square Annulus Problem

Sang Won Bae

In this paper, we address the minimum-area rectangular and square annulus problem, which asks a rectangular or square annulus of minimum area, either in a fixed orientation or over…

cs.CG2018

Maximum-Width Empty Square and Rectangular Annulus

Sang Won Bae, Arpita Baral, Priya Ranjan Sinha Mahapatra

An annulus is, informally, a ring-shaped region, often described by two concentric circles. The maximum-width empty annulus problem asks to find an annulus of a certain shape with…