Abstract
Due to the recent popularization of the Geographic Information System (GIS), spatial network environments that can display the changes of spatial axes on mobile phones are receiving great attention. In spatial network environments, since a query object that seeks location information selects several candidate target objects based on the search conditions, we often use a k-nearest neighbor (kNN) search, which seeks several target objects near the query object. However, since a kNN search needs to find the kNN by calculating the distance from the query to all the objects, the computational complexity might become too large, depending on the number of objects. To reduce this computation time in a kNN search, many researchers have proposed a search method that divides regions using a Voronoi diagram. In this method, we reduce the computational complexity by generating Voronoi regions for each object based on the positional relationships between two objects. In addition, a search method was proposed to reduce the processing time by generating Voronoi diagrams using a contact zone. However, since conventional methods generate Voronoi diagrams for objects in order, the computational complexity might become too large, depending on the number of objects. In this paper, we propose a generation method of the Voronoi diagram to the reduce processing time by parallelizing the generation of Voronoi regions using a contact zone. In our evaluation, we confirmed that the processing time under the proposed method was reduced about 15.9% more than conventional methods that are not parallelized.
| Original language | English |
|---|---|
| Title of host publication | MoMM 2018 - 16th International Conference on Advances in Mobile Computing and Multimedia |
| Editors | Ivan Luiz Salvadori, Ismail Khalil, Matthias Steinbauer, Pari Delir Haghighi, Kotsis Gabriele Anderst |
| Publisher | Association for Computing Machinery |
| Pages | 53-60 |
| Number of pages | 8 |
| ISBN (Electronic) | 9781450364522 |
| DOIs | |
| Publication status | Published - Nov 19 2018 |
| Event | 16th International Conference on Advances in Mobile Computing and Multimedia, MoMM 2018 - Yogyakarta, Indonesia Duration: Nov 19 2018 → Nov 21 2018 |
Other
| Other | 16th International Conference on Advances in Mobile Computing and Multimedia, MoMM 2018 |
|---|---|
| Country | Indonesia |
| City | Yogyakarta |
| Period | 11/19/18 → 11/21/18 |
Fingerprint
Keywords
- Contact zone
- Processing time
- Voronoi diagram
ASJC Scopus subject areas
- Human-Computer Interaction
- Computer Networks and Communications
- Computer Vision and Pattern Recognition
- Software
Cite this
A method to reduce processing time by parallelizing generation of Voronoi diagrams. / Okahana, Yuuhi; Gotoh, Yusuke.
MoMM 2018 - 16th International Conference on Advances in Mobile Computing and Multimedia. ed. / Ivan Luiz Salvadori; Ismail Khalil; Matthias Steinbauer; Pari Delir Haghighi; Kotsis Gabriele Anderst. Association for Computing Machinery, 2018. p. 53-60.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - A method to reduce processing time by parallelizing generation of Voronoi diagrams
AU - Okahana, Yuuhi
AU - Gotoh, Yusuke
PY - 2018/11/19
Y1 - 2018/11/19
N2 - Due to the recent popularization of the Geographic Information System (GIS), spatial network environments that can display the changes of spatial axes on mobile phones are receiving great attention. In spatial network environments, since a query object that seeks location information selects several candidate target objects based on the search conditions, we often use a k-nearest neighbor (kNN) search, which seeks several target objects near the query object. However, since a kNN search needs to find the kNN by calculating the distance from the query to all the objects, the computational complexity might become too large, depending on the number of objects. To reduce this computation time in a kNN search, many researchers have proposed a search method that divides regions using a Voronoi diagram. In this method, we reduce the computational complexity by generating Voronoi regions for each object based on the positional relationships between two objects. In addition, a search method was proposed to reduce the processing time by generating Voronoi diagrams using a contact zone. However, since conventional methods generate Voronoi diagrams for objects in order, the computational complexity might become too large, depending on the number of objects. In this paper, we propose a generation method of the Voronoi diagram to the reduce processing time by parallelizing the generation of Voronoi regions using a contact zone. In our evaluation, we confirmed that the processing time under the proposed method was reduced about 15.9% more than conventional methods that are not parallelized.
AB - Due to the recent popularization of the Geographic Information System (GIS), spatial network environments that can display the changes of spatial axes on mobile phones are receiving great attention. In spatial network environments, since a query object that seeks location information selects several candidate target objects based on the search conditions, we often use a k-nearest neighbor (kNN) search, which seeks several target objects near the query object. However, since a kNN search needs to find the kNN by calculating the distance from the query to all the objects, the computational complexity might become too large, depending on the number of objects. To reduce this computation time in a kNN search, many researchers have proposed a search method that divides regions using a Voronoi diagram. In this method, we reduce the computational complexity by generating Voronoi regions for each object based on the positional relationships between two objects. In addition, a search method was proposed to reduce the processing time by generating Voronoi diagrams using a contact zone. However, since conventional methods generate Voronoi diagrams for objects in order, the computational complexity might become too large, depending on the number of objects. In this paper, we propose a generation method of the Voronoi diagram to the reduce processing time by parallelizing the generation of Voronoi regions using a contact zone. In our evaluation, we confirmed that the processing time under the proposed method was reduced about 15.9% more than conventional methods that are not parallelized.
KW - Contact zone
KW - Processing time
KW - Voronoi diagram
UR - http://www.scopus.com/inward/record.url?scp=85060931329&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85060931329&partnerID=8YFLogxK
U2 - 10.1145/3282353.3282358
DO - 10.1145/3282353.3282358
M3 - Conference contribution
AN - SCOPUS:85060931329
SP - 53
EP - 60
BT - MoMM 2018 - 16th International Conference on Advances in Mobile Computing and Multimedia
A2 - Salvadori, Ivan Luiz
A2 - Khalil, Ismail
A2 - Steinbauer, Matthias
A2 - Haghighi, Pari Delir
A2 - Anderst, Kotsis Gabriele
PB - Association for Computing Machinery
ER -