Hyeon-Suk Na

Chan-Su Shin

Theor. Comput. Sci., 2015

Stealthy behavior simulations based on cognitive data.

[BibT_eX]

[DOI]

Taeyeong Choi

Proceedings of the 2015 International Conference on Machine Learning and Cybernetics, 2015

2011

The Aligned k-Center Problem.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2011

Farthest-polygon Voronoi diagrams.

[BibT_eX]

[DOI]

Comput. Geom., 2011

Sensor redundancy check without geometric information.

[BibT_eX]

[DOI]

Proceedings of the Research in Applied Computation Symposium, 2011

2010

Querying Approximate Shortest Paths in Anisotropic Regions.

[BibT_eX]

[DOI]

SIAM J. Comput., 2010

Finding the maximum bounded intersection of k out of n halfplanes.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

Guarding a Polygon from Two Nearly-Opposite Directions.

[BibT_eX]

[DOI]

Chan-Su Shin

Int. J. Comput. Geom. Appl., 2010

Covering a simple polygon by monotone directions.

[BibT_eX]

[DOI]

Comput. Geom., 2010

2009

Constructing Optimal Highways.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2009

Computing k-Centers On a Line

[BibT_eX]

[DOI]

CoRR, 2009

Escaping offline searchers and isoperimetric theorems.

[BibT_eX]

[DOI]

Comput. Geom., 2009

On the minimum total length of interval systems expressing all intervals, and range-restricted queries.

[BibT_eX]

[DOI]

Comput. Geom., 2009

2008

Approximate Shortest Paths in Anisotropic Regions.

[BibT_eX]

[DOI]

SIAM J. Comput., 2008

2007

Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra.

[BibT_eX]

[DOI]

SIAM J. Comput., 2007

Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

2006

A note on maximally repeated sub-patterns of a point set.

[BibT_eX]

[DOI]

Discret. Math., 2006

Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets.

[BibT_eX]

[DOI]

Comput. Geom., 2006

2005

Geometric permutations of disjoint unit spheres.

[BibT_eX]

[DOI]

Otfried Cheong

Xavier Goaoc

Comput. Geom., 2005

Generalizing the Kraft-McMillan Inequality to Restricted Languages.

[BibT_eX]

[DOI]

Proceedings of the 2005 Data Compression Conference (DCC 2005), 2005

2004

The number of lines tangent to arbitrary convex polyhedra in 3D.

[BibT_eX]

[DOI]

Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

Approximation Algorithms for Inscribing or Circumscribing an Axially Symmetric Polygon to a Convex Polygon.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2003

The Expected Number of 3D Visibility Events Is Linear.

[BibT_eX]

[DOI]

SIAM J. Comput., 2003

On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes.

[BibT_eX]

[DOI]

Comput. Geom., 2003

Disjoint Unit Spheres admit at Most Two Line Transversals.

[BibT_eX]

[DOI]

Otfried Cheong

Xavier Goaoc

Proceedings of the Algorithms, 2003

2002

Voronoi diagrams on the spher.

[BibT_eX]

[DOI]

Chung-Nim Lee

Otfried Cheong

Comput. Geom., 2002

The probabilistic complexity of the Voronoi diagram of points on a polyhedron.

[BibT_eX]

[DOI]

Proceedings of the 18th Annual Symposium on Computational Geometry, 2002

On the number of lines tangent to four convex polyhedra.

[BibT_eX]

[DOI]

Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2001

Optimal Prefix-Free Codes That End in a Specified Pattern and Similar Problems: The Uniform Probability Case.

[BibT_eX]

[DOI]