Kensuke Onishi

Learn More
Voronoi diagram has been a main theme in computational geometry , and the theory of generalized Voronoi diagrams for various applications in robotics, VLSI CAD, etc., has been developed in terms of arrangements, Davenport-Schinzel sequences and lower envelopes. In this paper, we propose a new direction of research towards introducing discrete proximity(More)
G. Leibon and D. Letscher showed that for general and sufficiently dense point set its Delaunay triangulation and Voronoi diagram in Riemannian manifold exist. They also proposed an algorithm to construct them for a given set. In this paper we estimate the necessary number of points for computing the Voronoi diagram in the mani-fold by using sectional(More)
We introduce the Voronoi diagram by the divergence de-termincd by a convex function with additive weights. This class of Voronoi diagrams includes the Euclidean case and further the Voronoi diagram for normal distributions in a statistically meaningful setting. With the additive weights, the Voronoi diagram for circles is also included , These Voronoi(More)
The present paper describes a method for indexing a piece of music using the TwinVQ (Transform-domain Weighted Interleave Vector Quantization) audio compression (MPEG-4 audio standard). First, we present a framework for indexing a piece of music based on the autocorrelation coefficients computed in the encoding step of TwinVQ audio compression. Second, we(More)
For fast ε-similarity search, various index structures have been proposed. Yi et al. proposed a concept multi-modality support and suggested inequalities by which ε-similarity search by L 1 , L 2 and L ∞ norm can be realized. We proposed an extended inequality which allows us to realize ε-similarity search by arbitrary L p norm using an index based on L q(More)