{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T19:41:59Z","timestamp":1697917319475},"reference-count":9,"publisher":"Wiley","issue":"6","license":[{"start":{"date-parts":[[2007,9,5]],"date-time":"2007-09-05T00:00:00Z","timestamp":1188950400000},"content-version":"vor","delay-in-days":8282,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Systems &amp; Computers in Japan"],"published-print":{"date-parts":[[1985,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper we describe management system for region data using tree structures. Though the region data are divided into spatial data and alpha\u2010numerical data, we are primarily concerned with the management of spatial data. In the proposed method the cellular data obtained by partitioning them into equally spaced meshes (the cells have regional IDs as values) are managed by using combined two\u2010step binary tree structures. First, the three structures of the first step (primary structures) are constructed with the following procedure. (1) The object plane is recursively partitioned into two equal parts alternating vertically and horizontally, so that the number of kinds of regions contained in a small rectangle is two or less. (2) This partition procedure is represented by using a tree structure with two children (degree 2). Also, a secondary structure serves to distinguish the patterns of two regions in a rectangle given by a leaf of the primary structure and the representation by a simplified binary tree is used. The tree structures have the following characteristics. (1) Since global data on the whole object plane are obtained by the primary structure, range search can be conducted efficiently. (2) By using the simplified binary tree representation for the secondary structures, the total number of nodes is reduced to less than one half of that in an ordinary binary tree representation. (3) Since the operations for searching or overlaying are simplified, they can be executed at high speed.<\/jats:p>","DOI":"10.1002\/scj.4690160601","type":"journal-article","created":{"date-parts":[[2007,7,7]],"date-time":"2007-07-07T10:22:58Z","timestamp":1183803778000},"page":"1-9","source":"Crossref","is-referenced-by-count":0,"title":["An n\u2010dimensional region data management system using combined tree structures"],"prefix":"10.1002","volume":"16","author":[{"given":"Yutaka","family":"Ohsawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masao","family":"Sakauchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2007,9,5]]},"reference":[{"key":"e_1_2_1_2_2","first-page":"896","article-title":"Highly efficient region data management system for conversational region search","volume":"66","author":"Ohsawa","year":"1983","journal-title":"Trans, I.E.C.E., Japan"},{"key":"e_1_2_1_3_2","first-page":"2","article-title":"Geographic Data Processing","volume":"11","author":"Nagy N.","year":"1978","journal-title":"ACM Comput. Surv."},{"issue":"4","key":"e_1_2_1_4_2","first-page":"563","article-title":"Application of computational geometry to VLSI CAD","volume":"24","author":"Suzuki Norihisa","year":"1983","journal-title":"Jour. Proc. Soc, Japan"},{"key":"e_1_2_1_5_2","first-page":"6","volume-title":"Statistical aspects of the polygon overlay problem","author":"Goodchild M.F.","year":"1978"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/361952.361956"},{"issue":"2","key":"e_1_2_1_7_2","article-title":"Operations on images using quad trees","volume":"1","author":"Hunter G.M.","year":"1979","journal-title":"I.E.E.E. Trans."},{"key":"e_1_2_1_8_2","first-page":"249","article-title":"Oct trees and their use in representing three\u2010dimensional objects","volume":"14","author":"Jackins C.L.","year":"1980","journal-title":"CGIP"},{"key":"e_1_2_1_9_2","volume-title":"Simplified binary tree representation of two\u2010valued images","author":"Ohsawa","year":"1983"},{"key":"e_1_2_1_10_2","volume-title":"Algorithm + Data Structure = PASCAL Program","author":"Wirth N.","year":"1976"}],"container-title":["Systems and Computers in Japan"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fscj.4690160601","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/scj.4690160601","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,20]],"date-time":"2023-10-20T18:19:51Z","timestamp":1697825991000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/scj.4690160601"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,1]]},"references-count":9,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1985,1]]}},"alternative-id":["10.1002\/scj.4690160601"],"URL":"https:\/\/doi.org\/10.1002\/scj.4690160601","archive":["Portico"],"relation":{},"ISSN":["0882-1666","1520-684X"],"issn-type":[{"value":"0882-1666","type":"print"},{"value":"1520-684X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,1]]}}}