Some problems in distributed computational geometry

DOI10.1016/j.tcs.2011.06.035zbMath1222.68400OpenAlexW2099168395MaRDI QIDQ719317

Sergio Rajsbaum, Jorge Urrutia

Publication date: 10 October 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.06.035

zbMATH Keywords

convex hulldistributed computinggeometric network

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed systems (68M14)

Related Items (2)

Communication costs in a geometric communication network ⋮ Some problems in distributed computational geometry

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some problems in distributed computational geometry
• Location-based localized alternate, disjoint and multi-path routing algorithms for wireless networks.
• Local solutions for global problems in wireless networks
• Approximate MST for UDG Locally
• Design and Analysis of Distributed Algorithms
• Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges
• Direct dominance of points
• Decentralized extrema-finding in circular configurations of processors
• Discrete mobile centers
• Encyclopedia of Algorithms
• Routing with guaranteed delivery in ad hoc wireless networks

This page was built for publication: Some problems in distributed computational geometry