Search results
Jump to navigation
Jump to search
- The RTM Quick Start will give you a first overview of RailTopoModel® including its business case oriented approach, its benefits and a simple real world4 KB (188 words) - 17:29, 10 June 2024
- Core elements (category External Link)RailTopoModel® Quick Start RailTopoModel® Modelling Concepts RailTopoModel® External References Section Connexity graph Core elements Levels of detail Subection3 KB (318 words) - 17:01, 10 June 2024
- Dev:How to edit and contribute to the Wiki (category External Link)avoid duplication. The principles of editing a wiki are explained here (external link). Please, stick to our common templates to allow for a standardized documentation10 bytes (1,405 words) - 18:14, 15 April 2024
- wiki page for referring to a certain railML® element documentation page. The link is shown in angle brackets: <...>. It looks like an XML element. Please,10 bytes (564 words) - 15:29, 15 April 2024
- Dev:Wiki Documentation Guidelines (category External Link)according to RFC 2119 (external link) (see wikipedia (external link) to learn more about RFCs, and CEN/CENELEC Rules of Procedure (external link)). Must (also:10 bytes (1,349 words) - 15:28, 15 April 2024
- defined within the Geography Markup Language GML. The model integrates a link between the linear positioning system and the intrinsic positioning system5 KB (585 words) - 16:58, 10 June 2024
- back. Any number of external reference systems can be linked to an element and an external reference system may of course be linked with several elements3 KB (462 words) - 16:58, 10 June 2024
- RailTopoModel® approach considers several different levels of detail that are linked with each other via aggregation. Read Levels of detail if you want to learn3 KB (296 words) - 16:51, 10 June 2024
- coordinates), this referencing system is strictly logical and not human-usable. The link to Geographical/Geometrical or the more widely used Mileage system is part10 KB (1,502 words) - 16:57, 10 June 2024
- grouped to make a simpler, more manageable network. Of course, information linked to lower level must also be transmitted to the higher levels. By aggregating8 KB (1,181 words) - 16:59, 10 June 2024
- concept of connexity just for two adjacent vertices, i. e. two vertices linked by an edge. More simply, we use the edges two define a relation of connexity1 KB (201 words) - 17:00, 10 June 2024
- aggregation/disaggregation procedures: Depending on how the created level will be linked to the existing level, the procedure might produce a higher or a lower description13 KB (1,403 words) - 16:58, 10 June 2024