Visibility-Oriented Algorithms for Digital Terrain Models   (Computer and Information Science)
{'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}
The "visibility region" of a viewpoint on a surface is wll-             defined.  It contains all of the points that can be joined to the               viewpoint by means of a line-segment that does not pass through                 the surface.  In principle, the visibility region of every point                on the surface can be computed.  In practice, however, its                      computation must be approximated.  In this research, the                        visibility regions of the n vertices of a Delaunay-triangulated                 terrain model are studied.  A major goal of this research is to                 improve the average performance of known hidden-line and hidden-                surface algorithms.  This is accomplished by using several types                of heuristics based on the unique characteristics of the problem.               Algorithms will be developed to apply the resulting visibility                  maps to the location of observation points:  to line-of-sight                   (television, fm, radar) communications and surveillance problems;               to orientation and navigation; to data compression; and to the                  extraction of significant terrain features such as ridges and                   valleys.  It is argued that the global nature of visibility model               provides a useful alternative to partial derivatives for defining               topographic entities.  This research is expected to contribute to               several areas including computational geometry, geographic                      information systems, and to computer communications.
{'FirstName': 'George', 'LastName': 'Nagy', 'PI_MID_INIT': None, 'PI_SUFX_NAME': None, 'PI_FULL_NAME': 'George Nagy', 'EmailAddress': 'nagy@ecse.rpi.edu', 'NSF_ID': '000177631', 'StartDate': '07/01/1987', 'EndDate': None, 'RoleCode': 'Principal Investigator'}
{'Name': 'Rensselaer Polytechnic Institute', 'CityName': 'TROY', 'ZipCode': '121803590', 'PhoneNumber': '5182766000', 'StreetAddress': '110 8TH ST', 'StreetAddress2': None, 'CountryName': 'United States', 'StateName': 'New York', 'StateCode': 'NY', 'CONGRESSDISTRICT': '20', 'CONGRESS_DISTRICT_ORG': 'NY20', 'ORG_UEI_NUM': 'U5WBFKEBLMX3', 'ORG_LGL_BUS_NAME': 'RENSSELAER POLYTECHNIC INSTITUTE', 'ORG_PRNT_UEI_NUM': None}
{'Name': None, 'CityName': None, 'StateCode': None, 'ZipCode': None, 'StreetAddress': None, 'CountryCode': None, 'CountryName': None, 'StateName': None, 'CountryFlag': None, 'CONGRESSDISTRICT': None, 'CONGRESS_DISTRICT_PERF': '""'}
[{'Code': '6840', 'Text': 'ROBOTICS'}, {'Code': '9145', 'Text': 'SPECIAL PROGRAMS-RESERVE'}]
{'url': 'https://www.nsf.gov/awardsearch/download?DownloadFileName=1987&All=true', 'xml': '8704718.xml'}