Generating an Indoor space routing graph using semantic-geometric method
Authors
Abstract:
The development of indoor Location-Based Services faces various challenges that one of which is the method of generating indoor routing graph. Due to the weaknesses of purely geometric methods for generating indoor routing graphs, a semantic-geometric method is proposed to cover the existing gaps in combining the semantic and geometric methods in this study. The proposed method uses the CityGML data model, which is actually a semantic modeling of building space. The output of the method is also presented with several test scenarios, and their results. Using semantic information and semantic graphs is in fact a good strategy for purely geometric methods, and according to the results, the proposed semantic-geometric method for producing indoor routing graphs seems to be efficient.
similar resources
designing and implementing a 3D indoor navigation web application
During the recent years, the need arises for indoor navigation systems for guidance of a client in natural hazards and fire, due to the fact that human settlements have been complicating. This research paper aims to design and implement a visual indoor navigation web application. The designed system processes CityGML data model automatically and then, extracts semantic, topologic and geometric...
full textSEIMCHA: a new semantic image CAPTCHA using geometric transformations
As protection of web applications are getting more and more important every day, CAPTCHAs are facing booming attention both by users and designers. Nowadays, it is well accepted that using visual concepts enhance security and usability of CAPTCHAs. There exist few major different ideas for designing image CAPTCHAs. Some methods apply a set of modifications such as rotations to the original imag...
full textIndoor Semantic Modelling for Routing: The Two-Level Routing Approach for Indoor Navigation
full text
Generating Geometric Graphs Using Automorphisms
We outline an algorithm for generating nets, a “net” being a geometric graph embedded in a space on which some group acts transitively. We prove that any connected net in such a space can be generated by this process, which can also be regarded as a covering of the net by copies of a connected “transversal” subnet. This paper outlines some of the underlying theory supporting a crystal predictio...
full textGenerating Sentences from Semantic Vector Space Representations
The first work of this kind in a monolingual setting successfully generates two and threeword phrases with predetermined syntactic structures by decoupling the task into three phases: synthesis, decomposition, and search [4]. During the synthesis phase, a vector is constructed from some input text. This vector is decomposed into multiple output vectors that are then matched to words in the voca...
full textA 2D geometric constraint solver using a graph reduction method
Keywords: Geometric constraints Modeling by constraints Graph-constructive solver Decomposition–recombination (DR) planning Graph algorithms Under-constrained problems a b s t r a c t Modeling by constraints enables users to describe shapes by specifying relationships between geometric elements. These relationships are called constraints. A constraint solver derives then automatically the desig...
full textMy Resources
Journal title
volume 8 issue None
pages 69- 80
publication date 2021-03
By following a journal you will be notified via email when a new issue of this journal is published.
No Keywords
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023