Computational Geometry: Others

• A. Aggarwal, H. Imai, N. Katoh, and S. Suri: Finding k Points with Minimum Diameter and Related Problems, Journal of Algorithms, Vol. 12, pp. 38-56, 1991. Abstract
• A. Aggarwal, H. Imai, N. Katoh, and S. Suri: Finding k Points with Minimum Diameter and Related Problems, in Proceedings of the 5th ACM Symposium on Computational Geometry, pp. 283-291, Saarbrücken, June 1989. Abstract
• T. Akutsu, Y. Aoki, S. Hasegawa, H. Imai, and T. Tokuyama: The Sum of Smaller Endpoint Degree over Edges of Graphs and Its Applications to Geometric Problems, in Proceedings of the 3rd Canadian Conference on Computational Geometry, pp. 145-148, Vancouver, Aug. 1991.
• T. Akutsu, Y. Aoki, S. Hasegawa, H. Imai, and T. Tokuyama: A Simple Proof of a Tight Bound of the Sum of Smaller Endpoint Degree over Edges of Graphs and Its Applications to Geometric Problems, IPSJ SIG Notes 91-AL-22-2, IPSJ, July 1991.
• Y. Aoki: Estimating the Number of Simplices in Simplex Partition of n Points, in RIMS Kokyuroku, No. 754, pp. 237-246, June 1991, Kyoto University, (in Japanese).
• Y. Aoki, H. Imai, K. Imai, and D. Rappaport: Probing a Set of Hyperplanes by Lines and Related Problems, in Proceedings of the 3rd Workshop on Algorithms and Data Structures (WADS'93), Lecture Notes in Computer Science, Vol. 709, pp. 72-82, 1993.
• T. Asano, T. Asano, L. J. Guibas, J. Hershberger, and H. Imai: Visibility of Disjoint Polygons, Algorithmica, Vol. 1, No. 1, pp. 49-63, 1986. Abstract
• T. Asano, T. Asano, and H. Imai: Partitioning a Polygonal Region into Trapezoids, in RIMS Kokyuroku, No. 534, pp. 26-52, May 1984, Kyoto University. Abstract
• T. Asano, T. Asano, and H. Imai: Partitioning a Polygonal Region into Trapezoids, Journal of the Association for Computing Machinery, Vol. 33, No. 2, pp. 290-312, Apr. 1986. Abstract
• T. Asano, M. Edahiro, H. Imai, M. Iri, and K. Murota: Practical Use of Bucketing Techniques in Computational Geometry, in G. T. Toussaint, ed.,Computational Geometry, pp. 153-195, North-Holland, 1985. Abstract
• T. Asano, M. E. Houle, H. Imai, and Keiko Imai: A Unified Linear-Space Approach to Geometric Minimax Problems, in Proceedings of the Second Canadian Conference in Computational Geometry, pp. 20-23, Ottawa, Aug. 1990. Abstract
• D. Avis, B. K. Bhattacharya, and H. Imai: Computing the Volume of the Union of Spheres, The Visual Computer, Vol. 3, No. 6, pp. 323-328, May 1988. Abstract
• D. Avis and H. Imai: Locating a Robot with Angle Measurements, Journal of Symbolic Computation, Vol. 10, pp. 311-326, 1990. Abstract
• D. Avis, S. Matsunaga, and H. Imai: Computational Geometry and Discrete Geometry, Asakura, Tokyo, 1994, (in Japanese).
• H. Imai and K. Imai: Algorithms in Combinatorial Geometry, Kyoritsu, 1995, (Japanese Translation of the book by H. Edelsbrunner, Springer-Verlag, 1987).
• H. Imai: On Computational Geometry, in 38th Symposium on Geometry, Vol. 2, pp. 160-166, Niigata, 1991, (in Japanese).
• H. Imai: Geometric-Search Data Structures, in Proceedings of the 13th Symposium of the Operations Research Society of Japan on Fundamental Algorithms for Geographic Data Processing, pp. 17-20, Dec. 1984, OR Soc. Japan, (In Japanese). Abstract
• H. Imai: Dynamic Orthogonal Segment Intersection Search and Its Applications, in RIMS Kokyuroku, No. 534, pp. 247-261, Aug. 1984, Kyoto University. Abstract
• H. Imai: On Combinatorial Structures of Line Drawings of Polyhedra, Discrete Applied Mathematics, Vol. 10, pp. 79-92, 1985. Abstract
• H. Imai: Computational Geometry and Geographical Information Processing, Kyoritsu-Shuppan, Tokyo, 1986, (In Japanese). Abstract
• H. Imai: Polygonal Approximations of a Curve --- Computational-Geometric and Graph-Theoretical Approach, in Research Meeting on Applications of Graph Theory to Numerical Computation, July 1986, Statistical Research Institute, (In Japanese). Abstract
• H. Imai: Combinatorial and Geometric Algorithms for Linear and Polygonal Approximations, in Proceedings of the 8th Mathematical Programming Symposium of Japan, pp. 69-78, Nov. 1987, (In Japanese). Abstract
• H. Imai: Minimax Location Problem of a Line Segment, IEICE Technical Report CAS87-206, IEICE, Dec. 1987. Abstract
• H. Imai: Recent Trends in Computational Geometry, Journal of the Institute of Electronics, Information and Communication Engineers, Vol. 71, No. 12, pp. 1307-1314, Dec. 1988, (In Japanese). Abstract
• H. Imai: Learning Geometric Concepts and Computational Geometry, in Seminar on Computational Learning Theory and Neural Nets, Jan. 1990, IEICE. Abstract
• H. Imai: One-Dimensional Geometric Fitting Problem of Two Corresponding Sets of Points, IPSJ SIG Notes 90-AL-18-5, IPSJ, Nov. 1990. Abstract
• H. Imai: One-Dimensional Geometric Fitting Problem of Two Corresponding Sets of Points, IPSJ SIG Notes 90-AL-18-5, IPSJ, Nov. 1990.
• H. Imai: A Geometric Fitting Problem of Two Corresponding Sets of Points on a Line, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E74, No. 4, pp. 665-668, 1991.
• H. Imai: Computational Geometry and Linear Programming, in Proceedings of the 3rd Canadian Conference on Computational Geometry, p. 166, Vancouver, Aug. 1991.
• H. Imai: Geometric Algorithms for Linear Programming, in Proceedings of the 5th Karuizawa Workshop on Circuits and Systems, pp. 173-178, 1992.
• H. Imai: Geometric Algorithms for Linear Programming, IEICE Transactions on Fundamentals, Vol. E76-A, No. 3, pp. 259-264, 1993.
• H. Imai: Computational Geometry and Linear Programming, in Proceedings of the 2nd NEC Research Symposium, pp. 9-28, 1993, SIAM.
• H. Imai: Computational-Geometric Approach to Linear Programming, in S. Fujishige, ed.,Discrete Structures and Algorithms II, pp. 1-46, KindaiKagaku-sha, Tokyo, 1993, (in Japanese).
• H. Imai, ed.: Computational Geometry and Discrete Geometry, RIMS Kokyuroku, Vol. 872, 1994,Kyoto University.
• H. Imai: Computational Geometry and Linear Programming, in RIMS Kokyuroku, Vol. 872, pp. 49-64, 1994, Kyoto University.
• H. Imai: Computational Geometry and Combinatorics, Technical Report, Department of Information Science, University of Tokyo, Mar. 1995. Paper(ps)
• H. Imai and T. Asano: Dynamic Segment Intersection Search with Applications, in Proceedings of the 25th Annual IEEE Symposium on Foundations of Computer Science, pp. 393-402, Singer Island, Florida, Oct. 1984, IEEE. Abstract
• H. Imai and T. Asano: Efficient Algorithms for Geometric Graph Search Problems, SIAM Journal on Computing, Vol. 15, No. 2, pp. 478-494, May 1986. Abstract
• H. Imai and T. Asano: Dynamic Orthogonal Segment Intersection Search, Journal of Algorithms, Vol. 8, No. 1, pp. 1-18, 1987. Abstract
• H. Imai and K. Imai: Triangulations and Convex Polytopes, Technical Report, Department of Information Science, University of Tokyo, Mar. 1995. Paper(ps)
• H. Imai and K. Imai: Some Geometric Fitting Problems of Two Corresponding Sets of Points and Applications to VLSI Layout Design, in 15th IFIP Conference on System Modelling and Optimization, pp. 76-77, Zurich, Sept. 1991.
• K. Imai and H. Imai: On Arrangement of Surfaces in 3-Dimensional Euclidean Space, IPSJ SIG Notes 91-AL-21-8, IPSJ, May 1991.
• K. Imai and H. Imai: On Arrangements of Algebraic Surfaces whose Intersection Curves are of Low Degrees in One Variable, in RIMS Kokyuroku, No. 754, pp. 220-227, June 1991, Kyoto University, (in Japanese).
• H. Imai and K. Imai: Computational Geometry, Kyoritsu, Tokyo, 1994, (in Japanese).
• H. Imai and K. Imai: Algorithms in Combinatorial Geometry, Kyoritsu, Tokyo, 1995, (In Japanese).
• H. Imai and M. Iri: Computational-Geometric Methods for Polygonal Approximations of a Curve, Computer Vision, Graphics, and Image Processing, Vol. 36, pp. 31-41, 1986. Abstract
• H. Imai, S. Iwata, K. Sekine, and K. Yoshida: Combinational and Geometric Approaches to Counting Problems on Linear Matroids, Graphic Arrangements and Partial Orders, IPSJ SIG Notes 96-AL-50-7, IPSJ, 1996. Abstract Paper(ps.gz)
• H. Imai and N. Katoh: Algorithms for Finding k Points with Minimum Variance and Diameter, IPSJ SIG Notes 89-AL-7-1, IPSJ, May 1989. Abstract
• H. Imai, D. T. Lee, and C. D. Yang: 1-Segment Center Problems, ORSA Journal on Computing, Vol. 4, No. 4, pp. 426-434, 1992.
• K. Imai, S. Sumino, and H. Imai: Minimax Geometric Fitting of Two Corresponding Sets of Points, in Proceedings of the 5th ACM Symposium on Computational Geometry, pp. 266-275, Saarbrücken, FRG, June 1989, ACM. Abstract
• M. Inaba, Y. Aoki, and S. Hasegawa: Level Difference of the Reconstructed Arrangement, in Proceedings of the 6th Canadian Conference on Computational Geometry, pp. 12-17, 1994. Abstract Paper(ps)
• K. Kakihara and H. Imai: Notes on the PAC Learning of Geometric Concepts with Additional Information, in Proceedings of the 3rd Workshop on Algorithmic Learning Theory, pp. 252-259, 1992.
• T. Ono: An Eight-Way Perturbation Technique for the Three-Dimensional Convex Hull, in Proceedings of the 6th Canadian Conference on Computational Geometry, pp. 159-164, 1994.
• T. Ono: An Eight-Way Perturbation Technique for the Three-Dimensional Convex Hull, IPSJ SIG Notes 94-AL-39-5, IPSJ, 1994.
• D. Rappaport, H. Imai, and G. T. Toussaint: On Computing Simple Circuits on a Set of Line Segments, in Proceedings of the 2nd ACM Symposium on Computational Geometry, pp. 52-60, Yorktown Heights, New York, June 1986, ACM. Abstract
• D. Rappaport, H. Imai, and G. T. Toussaint: On Computing Simple Polygons on a Set of Line Segments, Discrete and Computational Geometry, Vol. 5, pp. 289-304, 1990. Abstract
• T. Sasaki, H. Imai, T. Asano, and K. Sugihara: Computational Algebra and Computational Geometry, Iwanami Applied Mathematics (Methodology 9), Iwanami, Tokyo, 1993, (in Japanese).
• S. Sumino and H. Imai: Matching Two Sets of Points in L_∞ Distance, IPSJ SIG Notes 90-AL-3, IPSJ, May 1990. Abstract
• S. Sumino, H. Imai, and S. Naito: An Algorithm for Fitting a Perfect Grid to a Set of Points, IEICE Technical Report on Computation COMP88-15, IEICE, May 1988. Abstract
• P. Yamamoto, K. Kato, K. Imai, and H. Imai: Algorithms for Vertical and Orthogonal L₁ Linear Approximation of Points, in Proceedings of the 4th ACM Symposium on Computational Geometry, pp. 352-361, Urbana-Champaign, Illinois, 1988, ACM. Abstract
• K. Yoshida: Prolongability of Embedded Surfaces, in RIMS Kokyuroku, No. 872, pp. 158-164, 1994, Kyoto University, (in Japanese).