Author pages are created from data sourced from our academic publisher partnerships and public sources.
Share This Author
Optimal Packing and Covering in the Plane are NP-Complete
VIVA: A visual language for image processing
- S. Tanimoto
- Computer ScienceJ. Vis. Lang. Comput.
- 1 June 1990
Oct-trees and their use in representing three-dimensional objects
Should your 8-year-old learn coding?
The arguments for and against learning coding at a young age are collected, and the initiatives that have been developed to achieve this are reviewed (including new languages, school curricula, and teaching resources).
Some Matching Problems for Bipartite Graphs
An efficient algorithm for finding all perfect matchmgs is presented and it requires O(e) time per matching and a total of O( e) space to calculate the permanent of a matrix.
A perspective on the evolution of live programming
- S. Tanimoto
- Computer Science1st International Workshop on Live Programming…
- 19 May 2013
While liveness concerns the timeliness of execution feedback, considering a broader array of forms of feedback is helpful both in better understanding liveness and in designing ever more powerful development tools.
A hierarchical data structure for picture processing
Progressive Refinement of Raster Images
A notation is introduced that permits concise descriptions of the image refinement processes and one of the methods requires no transmission overhead and only a small amount of local computation.
Computer instruction in handwriting, spelling, and composing for students with specific learning disabilities in grades 4-9
Quad-Trees, Oct-Trees, and K-Trees: A Generalized Approach to Recursive Decomposition of Euclidean Space
- Chris L. Jackins, S. Tanimoto
- Computer Science, MathematicsIEEE Transactions on Pattern Analysis and Machine…
- 1 May 1983
The algorithm provides a method for computing the perimeter of a quad-tree encoded image or the surface area of an oct- tree encoded object in worst case time proportional to the number of nodes in the tree, improves upon the expected-case linear-time method of Samet for the perimeter problem.