#### Filter Results:

- Full text PDF available (10)

#### Publication Year

2002

2017

- This year (2)
- Last 5 years (9)
- Last 10 years (16)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Jinhee Chun, Matias Korman, Martin Nöllenburg, Takeshi Tokuyama
- Symposium on Computational Geometry
- 2008

Given a fixed origin <i>o</i> in the <i>d</i>-dimensional grid, we give a novel definition of <i>digital rays dig(op)</i> from <i>o</i> to each grid point <i>p</i>. Each digital ray dig(<i>op</i>) approximates the Euclidean line segment <i>op</i> between <i>o</i> and <i>p</i>. The set of all digital rays satisfies a set of axioms analogous to the Euclidean… (More)

- Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama
- Algorithmica
- 2003

Given a function y = f(x) in one variable, we consider the problem of computing the single-peaked (unimodal) curve y =φ(x) minimizing the L2-distance between them. If the input function f is a histogram with O(n) steps or a piecewise linear function with O(n) linear pieces, we design algorithms for computing φ in linear time. We also give an algorithm to… (More)

- Danny Ziyi Chen, Jinhee Chun, Naoki Katoh, Takeshi Tokuyama
- COCOON
- 2004

- Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama
- JCDCG
- 2002

- Jinhee Chun, Natsuda Kaothanthong, Ryosei Kasai, Matias Korman, Martin Nöllenburg, Takeshi Tokuyama
- Computer Vision and Image Understanding
- 2009

Given a function y 1⁄4 f ðxÞ defined on an interval I 1⁄4 1⁄20; 1 , we consider the problem of approximating f by a kpeaked function y 1⁄4 ðxÞ. Here, a function is k-peaked if the function has at most k maximal peaks (each peak may be a flat interval). If the distance between input function f and output is minimized, we call the optimal k-peaked… (More)

- Shinya Anzai, Jinhee Chun, Ryosei Kasai, Matias Korman, Takeshi Tokuyama
- COCOON
- 2010

We consider the optimization problem of finding k nonintersecting rectangles and tableaux in n × n pixel plane where each pixel has a real valued weight. We discuss existence of efficient algorithms if a corner point of each rectangle/tableau is specified.

- Jinhee Chun, Yuji Okada, Takeshi Tokuyama
- ISVD
- 2007

Motivated by the work of Asano et al. [1], we consider the distance trisector problem and zone diagram considering segments in the plane as the input geometric objects. As the most basic case, we first consider the pair of curves (distance trisector curves) trisecting the distance between a point and a line, as shown in Figure 1. This is a natural extension… (More)

- Jinhee Chun, Akiyoshi Shioura, Truong Minh Tien, Takeshi Tokuyama
- IEICE Transactions
- 2012

We give a unified view to greedy geometric routing algorithms in ad hoc networks. For this, we first present a general form of greedy routing algorithm using a class of objective functions which are invariant under congruent transformations of a point set. We show that several known greedy routing algorithms such as Greedy Routing, Compass Routing, and… (More)