Evaluating client application status for V-World Open API service

Jang, Han-sol; Kim, Dong-kyu; Kim, Jungmin; Jang, In-sung

doi:10.1007/s41324-016-0038-6

Cited by 3 publications

(4 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this study, the SFP-Tree/SFP-Growth algorithms were proposed. These algorithms enabled spatial frequent pattern mining from social data and presented the vision for various research areas [19]. At first, the spatial transaction database is the best application target.…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Fast mining of spatial frequent wordset from social database

Lee¹,

Nam²,

Ryu³

2017

Spat. Inf. Res.

View full text Add to dashboard Cite

In this paper, we propose an algorithm that extracts spatial frequent patterns to explain the relative characteristics of a specific location from the available social data. This paper proposes a spatial social data model which includes spatial social data, spatial support, spatial frequent patterns, spatial partition, and spatial clustering; these concepts are used for describing the exploration algorithm of spatial frequent patterns. With these defined concepts as the foundation, an SFP-tree structure that maintains not only the frequent words but also the frequent cells was proposed, and an SFP-growth algorithm that explores the frequent patterns on the basis of this SFP-tree was proposed.

show abstract

Section: Discussionmentioning

confidence: 99%

“…Third, if gid entry exists in both the child node which corresponds to the word and gidCountTable, increase the support count of gid entry in gidCountTable by 1 (15). Lastly, when the (w, gid) entry and the relevant node in FT 1-word-cell are connected with a pointer (18)(19), the insertion algorithm is finished.…”

Section: Construction Of Sfp-treementioning

confidence: 99%

Fast mining of spatial frequent wordset from social database

Lee¹,

Nam²,

Ryu³

2017

Spat. Inf. Res.

View full text Add to dashboard Cite

show abstract

“…However, such a dynamic mashup has caused performance issues in the front end owing to the large amounts of real-time sensor data integration and time series rendering. (12) In this work, we try to compare and analyze the performance characteristics of various map platforms in the dynamic mashup that integrates large amounts of real-time sensor data. In the performance comparison using various map platforms, we compare the geospatial data loading time, the mashup time, and the time of user interaction such as zoom or pan.…”

Section: Introductionmentioning

confidence: 99%

Dynamic Mashup Performance Comparison Using Open Application Programming Interface of Geoweb Map Platforms Available in Korea

Kim¹,

Jang²

2019

Sensors and Materials

Self Cite

View full text Add to dashboard Cite

Recently, users have been more interested in the development of a dynamic mashup application that integrates and renders large amounts of real-time sensor data and geospatial data. However, such a dynamic mashup application has caused performance issues in large amounts of real-time sensor data integration and time series rendering. In this study, we compare and analyze the dynamic mashup performance characteristics of various types of map platform. For accurate performance comparison, we define performance comparison metrics of data loading time, mashup time, and user interaction time. We also implement a mashup prototype system composed of a Geoweb client, a sensor data server, and several map platforms in order to efficiently perform various experiments. The experimental results show the mashup performance characteristics of Google Maps, OpenStreetMap (OSM), VWorld, olleh Map, Daum Map, and Naver Map. Finally, we present which map platforms have good and stable performance in the dynamic mashup of large amounts of sensor data.

show abstract

“…Since the service was released in Korea, a number of follow-up studies have been conducted with a focus on "light-weight" or "simplification" for easier and more accurate 3D data services. (10,11) For example, Kim et al (i) developed a method of minimizing building-related data and standardizing the 3D building data format to ensure data service efficiency and interoperability, (12) and (ii) conducted an evidencebased study to improve the V-World service quality by analyzing the update status and errors of 3D models and attribute data by verifying them using a publicly available cadastral registry. (13) Similar studies conducted in the construction sector have sought to improve the screen visualization efficiency of building information modeling (BIM) data.…”

Section: Introductionmentioning

confidence: 99%

Algorithm for Removing Duplicate Vertices from 3D Spatial Objects to Improve Service Efficiency

Kang¹,

Lee²,

Jihhyeok³

2019

Sensors and Materials

View full text Add to dashboard Cite

The demand for highly detailed 3D spatial data is continuously increasing with the development of information technology. However, these 3D spatial data have a large capacity, which is a major cause of service degradation. To solve this problem, an algorithm for reducing the 3D data size by removing duplicate vertices, which contain information that is not used for 3D building object visualization, was proposed. Furthermore, prototype software was developed to verify this algorithm. The results of duplicate point elimination were similar to or slightly better than the features of professional 3D graphics software. The proposed technology is expected to be useful because it reduces the data capacity while maintaining the quality of 3D spatial information data.

show abstract

Evaluating client application status for V-World Open API service

Cited by 3 publications

References 3 publications

Fast mining of spatial frequent wordset from social database

Fast mining of spatial frequent wordset from social database

Dynamic Mashup Performance Comparison Using Open Application Programming Interface of Geoweb Map Platforms Available in Korea

Algorithm for Removing Duplicate Vertices from 3D Spatial Objects to Improve Service Efficiency

Contact Info

Product

Resources

About