Search

Your search keyword '"Chun, Jinhee"' showing total 102 results
Start Over Author "Chun, Jinhee"
102 results on '"Chun, Jinhee"'

1. Gap-planar Graphs

Author

Bae, Sang Won, Baffier, Jean-Francois, Chun, Jinhee, Eades, Peter, Eickmeyer, Kord, Grilli, Luca, Hong, Seok-Hee, Korman, Matias, Montecchiani, Fabrizio, Rutter, Ignaz, and Tóth, Csaba D.

Subjects
Computer Science - Computational Geometry
Abstract

We introduce the family of $k$-gap-planar graphs for $k \geq 0$, i.e., graphs that have a drawing in which each crossing is assigned to one of the two involved edges and each edge is assigned at most $k$ of its crossings. This definition is motivated by applications in edge casing, as a $k$-gap-planar graph can be drawn crossing-free after introducing at most $k$ local gaps per edge. We present results on the maximum density of $k$-gap-planar graphs, their relationship to other classes of beyond-planar graphs, characterization of $k$-gap-planar complete graphs, and the computational complexity of recognizing $k$-gap-planar graphs., Comment: A preliminary version of this paper appeared in the Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD 2017)

Published
2017
Full Text
View/download PDF

3. Model-Agnostic Explanations for Decisions Using Minimal Patterns

Author

Asano, Kohei, Chun, Jinhee, Koike, Atsushi, Tokuyama, Takeshi, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Tetko, Igor V., editor, Kůrková, Věra, editor, Karpov, Pavel, editor, and Theis, Fabian, editor

Published
2019
Full Text
View/download PDF

4. Gap-Planar Graphs

Author

Bae, Sang Won, Baffier, Jean-Francois, Chun, Jinhee, Eades, Peter, Eickmeyer, Kord, Grilli, Luca, Hong, Seok-Hee, Korman, Matias, Montecchiani, Fabrizio, Rutter, Ignaz, Tóth, Csaba D., Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Frati, Fabrizio, editor, and Ma, Kwan-Liu, editor

Published
2018
Full Text
View/download PDF

7. Space-Efficient and Data-Sensitive Polygon Reconstruction Algorithms from Visibility Angle Information

Author

Chun, Jinhee, de Gonzalo, Ricardo Garcia, Tokuyama, Takeshi, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Cai, Leizhen, editor, Cheng, Siu-Wing, editor, and Lam, Tak-Wah, editor

Published
2013
Full Text
View/download PDF

8. Classified-Distance Based Shape Descriptor for Application to Image Retrieval

Author

Chun, Jinhee, Kaothanthong, Natsuda, Tokuyama, Takeshi, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Wilson, Richard, editor, Hancock, Edwin, editor, Bors, Adrian, editor, and Smith, William, editor

Published
2013
Full Text
View/download PDF

9. A Unified View to Greedy Geometric Routing Algorithms in Ad Hoc Networks

Author

Chun, Jinhee, Shioura, Akiyoshi, Tien, Truong Minh, Tokuyama, Takeshi, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Bar-Noy, Amotz, editor, and Halldórsson, Magnús M., editor

Published
2013
Full Text
View/download PDF

10. Base Location Problems for Base-Monotone Regions

Author

Chun, Jinhee, Horiyama, Takashi, Ito, Takehiro, Kaothanthong, Natsuda, Ono, Hirotaka, Otachi, Yota, Tokuyama, Takeshi, Uehara, Ryuhei, Uno, Takeaki, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Ghosh, Subir Kumar, editor, and Tokuyama, Takeshi, editor

Published
2013
Full Text
View/download PDF

12. Effect of Corner Information in Simultaneous Placement of K Rectangles and Tableaux

Author

Anzai, Shinya, Chun, Jinhee, Kasai, Ryosei, Korman, Matias, Tokuyama, Takeshi, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Thai, My T., editor, and Sahni, Sartaj, editor

Published
2010
Full Text
View/download PDF

13. Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes

Author

Chun, Jinhee, Kasai, Ryosei, Korman, Matias, Tokuyama, Takeshi, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Dong, Yingfei, editor, Du, Ding-Zhu, editor, and Ibarra, Oscar, editor

Published
2009
Full Text
View/download PDF

14. Efficient Algorithms for Approximating a Multi-dimensional Voxel Terrain by a Unimodal Terrain

Author

Chen, Danny Z., Chun, Jinhee, Katoh, Naoki, Tokuyama, Takeshi, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Chwa, Kyung-Yong, editor, and Munro, J. Ian J., editor

Published
2004
Full Text
View/download PDF

22. Base Location Problems for Base-Monotone Regions

Author

Chun, Jinhee, primary, Horiyama, Takashi, additional, Ito, Takehiro, additional, Kaothanthong, Natsuda, additional, Ono, Hirotaka, additional, Otachi, Yota, additional, Tokuyama, Takeshi, additional, Uehara, Ryuhei, additional, and Uno, Takeaki, additional

Published
2013
Full Text
View/download PDF

29. Consistent Digital Curved Rays and Pseudoline Arrangements

Author

Chun, Jinhee, Kikuchi, Kenya, and Tokuyama, Takeshi

Subjects
000 Computer science, knowledge, general works, Computer Science, ComputingMethodologies_COMPUTERGRAPHICS
Abstract

Representing a family of geometric objects in the digital world where each object is represented by a set of pixels is a basic problem in graphics and computational geometry. One important criterion is the consistency, where the intersection pattern of the objects should be consistent with axioms of the Euclidean geometry, e.g., the intersection of two lines should be a single connected component. Previously, the set of linear rays and segments has been considered. In this paper, we extended this theory to families of curved rays going through the origin. We further consider some psudoline arrangements obtained as unions of such families of rays.

Published
2019
Full Text
View/download PDF

31. Consistent Digital Curved Rays and Pseudoline Arrangements

Author

Jinhee Chun and Kenya Kikuchi and Takeshi Tokuyama, Chun, Jinhee, Kikuchi, Kenya, Tokuyama, Takeshi, Jinhee Chun and Kenya Kikuchi and Takeshi Tokuyama, Chun, Jinhee, Kikuchi, Kenya, and Tokuyama, Takeshi

Abstract

Representing a family of geometric objects in the digital world where each object is represented by a set of pixels is a basic problem in graphics and computational geometry. One important criterion is the consistency, where the intersection pattern of the objects should be consistent with axioms of the Euclidean geometry, e.g., the intersection of two lines should be a single connected component. Previously, the set of linear rays and segments has been considered. In this paper, we extended this theory to families of curved rays going through the origin. We further consider some psudoline arrangements obtained as unions of such families of rays.

Published
2019
Full Text
View/download PDF

33. Gap-planar graphs

Author

Bae, Sang Won, primary, Baffier, Jean-Francois, additional, Chun, Jinhee, additional, Eades, Peter, additional, Eickmeyer, Kord, additional, Grilli, Luca, additional, Hong, Seok-Hee, additional, Korman, Matias, additional, Montecchiani, Fabrizio, additional, Rutter, Ignaz, additional, and Tóth, Csaba D., additional

Published
2018
Full Text
View/download PDF

34. Folding Free-Space Diagrams: Computing the Fréchet Distance between 1-Dimensional Curves (Multimedia Contribution)

Author

Buchin, Kevin, Chun, Jinhee, Löffler, Maarten, Markovic, Aleksandar, Meulemans, Wouter, Okamoto, Yoshio, and Shiitada, Taichi

Subjects
000 Computer science, knowledge, general works, Computer Science, Computer Science::Computational Geometry
Abstract

By folding the free-space diagram for efficient preprocessing, we show that the Frechet distance between 1D curves can be computed in O(nk log n) time, assuming one curve has ply k.

Published
2017
Full Text
View/download PDF

41. Folding Free-Space Diagrams: Computing the Fréchet Distance between 1-Dimensional Curves (Multimedia Contribution)

Author

Kevin Buchin and Jinhee Chun and Maarten Löffler and Aleksandar Markovic and Wouter Meulemans and Yoshio Okamoto and Taichi Shiitada, Buchin, Kevin, Chun, Jinhee, Löffler, Maarten, Markovic, Aleksandar, Meulemans, Wouter, Okamoto, Yoshio, Shiitada, Taichi, Kevin Buchin and Jinhee Chun and Maarten Löffler and Aleksandar Markovic and Wouter Meulemans and Yoshio Okamoto and Taichi Shiitada, Buchin, Kevin, Chun, Jinhee, Löffler, Maarten, Markovic, Aleksandar, Meulemans, Wouter, Okamoto, Yoshio, and Shiitada, Taichi

Abstract

By folding the free-space diagram for efficient preprocessing, we show that the Frechet distance between 1D curves can be computed in O(nk log n) time, assuming one curve has ply k.

Published
2017
Full Text
View/download PDF

42. Peak-Reducing Fitting of a Curve under the Lp Metric (Special Issue on Mathematical Aspects of Image Processing and Computer Vision)

Author

Chun, Jinhee, Sadakane, Kunihiko, Tokuyama, Takeshi, and Yuki, Masato

Abstract

Given a function y=f(x) in one variable, we consider the problem of computing a k-peaked curve y=φ(x) minimizing the Lp distance between them. In other words, φ(x) has at most k local peaks and minimizes the area bounded by the curves f(x) and φ(x). This gives extension of the authors' previous work [5] on the unimodal (i.e., single-peaked) approximation for the L2 distance.

Published
2005

49. Consistent digital rays

Author

Chun, Jinhee, Korman, Matias, Nöllenburg, Martin, Tokuyama, Takeshi, Chun, Jinhee, Korman, Matias, Nöllenburg, Martin, and Tokuyama, Takeshi

Abstract

Proceedings of the 24th Symposium on Computational geometry (SoCG’08), info:eu-repo/semantics/published

Published
2008

Catalog

Books, media, physical & digital resources
See catalog results