Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,397,760 papers from all fields of science
Search
Sign In
Create Free Account
Geometric networks
A geometric network is an object commonly used in geographic information systems to model a series of interconnected features. A geometric network is…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Computer science
Geographic information system
Graph (discrete mathematics)
Graph theory
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Euclidean Matchings in Ultra-Dense Networks
Alexander P. Kartun-Giles
,
S. Jayaprakasam
,
Sunwoo Kim
IEEE Communications Letters
2018
Corpus ID: 49186285
In order to investigate the fundamental limits of network densification in and beyond 5G, we study the spatial spectral…
Expand
2014
2014
An interactive approach for deriving geometric network models in 3D indoor environments
Feixiong Luo
,
G. Cao
,
Xiang Li
International Symposium on Algorithms
2014
Corpus ID: 8740845
Humans spend most of their life in indoor spaces. As indoor spaces are becoming increasingly complex, there are compelling needs…
Expand
2012
2012
Geometric spherical networks for Visual Data processing
E. Castillo-Muñiz
,
E. Bayro-Corrochano
IEEE International Joint Conference on Neural…
2012
Corpus ID: 15094548
The main goal of this work is to develop a geometric neural network which can be used as an interface between sensors and robot…
Expand
2012
2012
Spectrum sharing between random geometric networks
Ran Cai
,
Wei Zhang
,
P. Ching
IEEE International Conference on Acoustics…
2012
Corpus ID: 18260287
In this paper a spectrum sharing scheme is proposed to maximize the successful transmission probability of a single-hop cognitive…
Expand
2011
2011
Distributed function computation in networks: A joint delay-energy perspective
Nikhil Karamchandani
,
M. Franceschetti
International Symposium of Modeling and…
2011
Corpus ID: 13021159
This paper considers the following network computation problem: n nodes are placed on a √n×√n grid, each node is connected to…
Expand
2011
2011
Detour Admitting Short Paths
L. Gewali
,
Reshma Koganti
Eighth International Conference on Information…
2011
Corpus ID: 2456395
Finding the shortest path between two vertices in a weighted graph is a well explored problem and several efficient algorithms…
Expand
2010
2010
Degree-dependent and cascading node failures in random geometric networks
Z. Kong
,
E. Yeh
- MILCOM Military Communications Conference
2010
Corpus ID: 27573946
We study the problem of resilience to node failures in large-scale networks modelled by random geometric graphs. Adopting a…
Expand
Review
2005
Review
2005
Evaluating the Potential of Commercial GIS for Accelerator Configuration Management
T. Larrieu
,
Y. Roblin
,
K. White
,
R. Slominski
2005
Corpus ID: 2016781
The Geographic Information System (GIS) is a tool used by industries needing to track information about spatially distributed…
Expand
2001
2001
Hamiltonian cycles in faulty random geometric networks
Jordi Petit i Silvestre
2001
Corpus ID: 14729745
In this paper we analyze the Hamiltonian properties of faulty random networks. This consideration is of interest when…
Expand
2000
2000
Faulty Random Geometric Networks
J. Díaz
,
Jordi Petit
,
M. Serna
Parallel Processing Letters
2000
Corpus ID: 23111967
In this paper we analyze the computational power of random geometric networks in the presence of random (edge or node) faults…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE