Spatial Data:  Representations and Problems
{'Code': '05020000', 'Directorate': {'Abbreviation': 'CSE', 'LongName': 'Direct For Computer & Info Scie & Enginr'}, 'Division': {'Abbreviation': 'IIS', 'LongName': 'Div Of Information & Intelligent Systems'}}
{'SignBlockName': 'Joyce', 'PO_EMAI': None, 'PO_PHON': None}
Successful solutions of problems in robotics, computer                     vision, image processing, and computer graphics are frequently                  intertwined with efficient representations of spatial data.                     Hierarchical representations of spatial data focus the work on                  the area in which the information has the greatest density.  It                 is proposed to find solutions to spatial problems that make use                 of  hierarchical data structures; hierarchical solutions to path                planning and polygon expansion will be attempted.  The concept of               neighbor-finding will be generalized, and the use of the active-                border paradigm in octree construction will be explored.  The                   surface spatial data type will be investigated.  We will examine                the question of whether spatial queries can be processed                        inteligently by the construction of an expert system interface                  that uses the representation of the spatial elements to which the               query refers.  Theoretical investigation of Delaunay                            triangulations will be continued.  We will explore the                          relationship between hierarchical solutions to geometric                        problems, and those used in computational geometry based on the                 plane-sweep method.  The feasibility of parallel solutions will                 be considered when possible.
{'FirstName': 'Hanan', 'LastName': 'Samet', 'PI_MID_INIT': None, 'PI_SUFX_NAME': None, 'PI_FULL_NAME': 'Hanan Samet', 'EmailAddress': 'hjs@umd.edu', 'NSF_ID': '000445634', 'StartDate': '09/01/1988', 'EndDate': None, 'RoleCode': 'Principal Investigator'}
{'Name': 'University of Maryland, College Park', 'CityName': 'COLLEGE PARK', 'ZipCode': '207425100', 'PhoneNumber': '3014056269', 'StreetAddress': '3112 LEE BUILDING', 'StreetAddress2': None, 'CountryName': 'United States', 'StateName': 'Maryland', 'StateCode': 'MD', 'CONGRESSDISTRICT': '04', 'CONGRESS_DISTRICT_ORG': 'MD04', 'ORG_UEI_NUM': 'NPU8ULVAAS23', 'ORG_LGL_BUS_NAME': 'UNIVERSITY OF MARYLAND, COLLEGE PARK', 'ORG_PRNT_UEI_NUM': 'NPU8ULVAAS23'}
{'Name': None, 'CityName': None, 'StateCode': None, 'ZipCode': None, 'StreetAddress': None, 'CountryCode': None, 'CountryName': None, 'StateName': None, 'CountryFlag': None, 'CONGRESSDISTRICT': None, 'CONGRESS_DISTRICT_PERF': '""'}
{'Code': '9145', 'Text': 'SPECIAL PROGRAMS-RESERVE'}
{'url': 'https://www.nsf.gov/awardsearch/download?DownloadFileName=1988&All=true', 'xml': '8802457.xml'}