150 results on '"CHAN-SU SHIN"'
Search Results
2. Approximating Convex Polygons by Histogons.
3. Reachability of turn sequences.
4. Representing Graphs and Hypergraphs by Touching Polygons in 3D.
5. Minimum-Width Annulus with Outliers: Circular, Square, and Rectangular Cases.
6. Minimum-width annulus with outliers: Circular, square, and rectangular cases.
7. Tight bounds for beacon-based coverage in simple rectilinear polygons.
8. Area bounds of rectilinear polygons realized by angle sequences.
9. The minimum convex container of two convex polytopes under translations.
10. Minimum rectilinear polygons for given angle sequences.
11. Covering points with convex sets of minimum size.
12. Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons.
13. Covering Points with Convex Sets of Minimum Size.
14. The Lower Bound of the Distance between the Start point and End point of Axis-reachable 2-dimensional Rectilinear Chain
15. Minimum Rectilinear Polygons for Given Angle Sequences.
16. Local Event Boundary Detection with Unreliable Sensors: Analysis of the Majority Vote Scheme.
17. One-to-One Disjoint Cover of Non-bipartite k-ary n-cube with Faulty Edges
18. Local event boundary detection with unreliable sensors: Analysis of the majority vote scheme.
19. Range-Aggregate Queries for Geometric Extent Problems.
20. Area Bounds of Rectilinear Polygons Realized by Angle Sequences.
21. Generating Realistic Roofs over a Rectilinear Polygon.
22. Covering and Piercing Disks with Two Centers.
23. The Onion Diagram: A Voronoi-Like Tessellation of a Planar Line Space and Its Applications - (Extended Abstract).
24. Covering a Simple Polygon by Monotone Directions.
25. Constructing Optimal Highways.
26. Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem.
27. Moving Vertices to Make Drawings Plane.
28. Adaptive Zooming in Point Set Labeling.
29. Maximizing the overlap of two planar convex sets under rigid motions.
30. Farthest-Point Queries with Geometric and Combinatorial Constraints.
31. Guarding Art Galleries by Guarding Witnesses.
32. Approximation Algorithms for Inscribing or Circumscribing an Axially Symmetric Polygon to a Convex Polygon.
33. A note on minimum-sum coverage by aligned disks.
34. Covering and piercing disks with two centers.
35. Realistic roofs over a rectilinear polygon.
36. Facility Location and the Geometric Minimum-Diameter Spanning Tree.
37. Minimum Rectilinear Polygons for Given Angle Sequences.
38. Minimum Convex Container of Two Convex Polytopes under Translations.
39. Labeling Points with Weights.
40. Computing Farthest Neighbors on a Convex Polytope.
41. The Onion Diagram: a Voronoi-like Tessellation of a Planar Line Space and its Applications.
42. Efficient Algorithms for Two-Center Problems for a Convex Polygon.
43. The Aligned k-Center Problem.
44. Guarding a Polygon from Two Nearly-Opposite Directions.
45. Covering a simple polygon by monotone directions.
46. Untangling a Planar Graph.
47. Constructing Optimal Highways.
48. On the minimum total length of interval systems expressing all intervals, and range-restricted queries.
49. Escaping offline searchers and isoperimetric theorems.
50. Two-Center Problems for a Convex Polygon (Extended Abstract).
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.