The following pages link to Chan-Su Shin (Q216327):
Displaying 50 items.
- Realistic roofs over a rectilinear polygon (Q364851) (← links)
- Minimum rectilinear polygons for given angle sequences (Q824339) (← links)
- Maximizing the overlap of two planar convex sets under rigid motions (Q871058) (← links)
- Local event boundary detection with unreliable sensors: analysis of the majority vote scheme (Q897966) (← links)
- Escaping offline searchers and isoperimetric theorems (Q955225) (← links)
- On the minimum total length of interval systems expressing all intervals, and range-restricted queries (Q1000921) (← links)
- Untangling a planar graph (Q1042455) (← links)
- The widest k-dense corridor problems (Q1274672) (← links)
- Computing farthest neighbors on a convex polytope. (Q1401257) (← links)
- Facility location and the geometric minimum-diameter spanning tree. (Q1421033) (← links)
- Optimal embedding of multiple directed Hamiltonian rings into \(d\)-dimensional meshes (Q1579748) (← links)
- Placing two disks in a convex polygon (Q1583047) (← links)
- The minimum convex container of two convex polytopes under translations (Q1622345) (← links)
- Covering points with convex sets of minimum size (Q1705773) (← links)
- Building bridges between convex regions (Q1873160) (← links)
- Labeling points with weights (Q1889601) (← links)
- Covering and piercing disks with two centers (Q1931270) (← links)
- Area-efficient algorithms for straight-line tree drawings (Q1975960) (← links)
- Representing graphs and hypergraphs by touching polygons in 3D (Q2206825) (← links)
- Covering a simple polygon by monotone directions (Q2269836) (← links)
- Tight bounds for beacon-based coverage in simple rectilinear polygons (Q2330037) (← links)
- Area bounds of rectilinear polygons realized by angle sequences (Q2331216) (← links)
- A note on minimum-sum coverage by aligned disks (Q2445326) (← links)
- Maximum overlap and minimum convex hull of two convex polyhedra under translations (Q2483561) (← links)
- Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets (Q2489540) (← links)
- Farthest-point queries with geometric and combinatorial constraints (Q2489542) (← links)
- Algorithms for drawing binary trees in the plane. (Q2583549) (← links)
- (Q2766839) (← links)
- Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons (Q2802931) (← links)
- Covering Points with Convex Sets of Minimum Size (Q2803821) (← links)
- Minimum Rectilinear Polygons for Given Angle Sequences (Q2958091) (← links)
- THE ALIGNED K-CENTER PROBLEM (Q2999091) (← links)
- The Onion Diagram: A Voronoi-Like Tessellation of a Planar Line Space and Its Applications (Q3060776) (← links)
- Covering and Piercing Disks with Two Centers (Q3104599) (← links)
- Generating Realistic Roofs over a Rectilinear Polygon (Q3104600) (← links)
- CONSTRUCTING THE CITY VORONOI DIAGRAM FASTER (Q3527435) (← links)
- GUARDING A POLYGON FROM TWO NEARLY-OPPOSITE DIRECTIONS (Q3575388) (← links)
- Covering a Simple Polygon by Monotone Directions (Q3596760) (← links)
- CONSTRUCTING OPTIMAL HIGHWAYS (Q3620612) (← links)
- (Q4411284) (← links)
- (Q4474126) (← links)
- (Q4551357) (← links)
- THE ONION DIAGRAM: A VORONOI-LIKE TESSELLATION OF A PLANAR LINE SPACE AND ITS APPLICATIONS (Q4650088) (← links)
- Computing and Combinatorics (Q4681184) (← links)
- LABELING A RECTILINEAR MAP WITH SLIDING LABELS (Q4682173) (← links)
- Area Bounds of Rectilinear Polygons Realized by Angle Sequences (Q4909579) (← links)
- Local Event Boundary Detection with Unreliable Sensors: Analysis of the Majority Vote Scheme (Q5251629) (← links)
- Maximizing the overlap of two planar convex sets under rigid motions (Q5370632) (← links)
- Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem (Q5387746) (← links)
- Farthest-Point Queries with Geometric and Combinatorial Constraints (Q5449755) (← links)
