Implementing the Topological Model Succinctly

11/21/2019
by   José Fuentes-Sepúlveda, et al.
0

We show that the topological model, a semantically rich standard to represent GIS data, can be encoded succinctly while efficiently answering a number of topology-related queries. We build on recent succinct planar graph representations so as to encode a model with m edges within 4m+o(m) bits and answer various queries relating nodes, edges, and faces in o(loglog m) time, or any time in ω(log m) for a few complex ones.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/31/2019

Simple k-Planar Graphs are Simple (k+1)-Quasiplanar

A simple topological graph is k-quasiplanar (k≥ 2) if it contains no k p...
research
01/27/2001

Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings

Let G be an embedded planar undirected graph that has n vertices, m edge...
research
12/02/2022

Disjoint faces in simple drawings of the complete graph and topological Heilbronn problems

Given a complete simple topological graph G, a k-face generated by G is ...
research
02/16/2020

Topological Mapping for Manhattan-like Repetitive Environments

We showcase a topological mapping framework for a challenging indoor war...
research
07/27/2020

Internal Quasiperiod Queries

Internal pattern matching requires one to answer queries about factors o...
research
01/25/2023

Succinct Planar Encoding with Minor Operations

Let G be an unlabeled planar and simple n-vertex graph. We present a suc...
research
08/19/2020

Learning Connectivity of Neural Networks from a Topological Perspective

Seeking effective neural networks is a critical and practical field in d...

Please sign up or login with your details

Forgot password? Click here to reset