Publication:3448774

DOI10.1007/978-3-662-47672-7_6zbMath1440.68312arXiv1412.0962OpenAlexW2944511207MaRDI QIDQ3448774

Boris Aronov, Matthew J. Katz

Publication date: 27 October 2015

Published in: ACM Transactions on Algorithms, Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1412.0962

zbMATH Keywords

range searchingwireless networksSINR modelalgebraic methodsfast polynomial multiplicationbatched point locationfast polynomial multipoint evaluationSINR diagram

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05) Communication theory (94A05)

Related Items (7)

Batched Point Location in SINR Diagrams via Algebraic Tools ⋮ Eccentricity queries and beyond using hub labels ⋮ The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication ⋮ Unnamed Item ⋮ Token traversal in ad hoc wireless networks via implicit carrier sensing ⋮ Resolving SINR Queries in a Dynamic Setting ⋮ Computing Shapley values in the plane

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An optimal algorithm for constructing the weighted Voronoi diagram in the plane
• Wireless scheduling with power control
• Batched Point Location in SINR Diagrams via Algebraic Tools
• On Computing the Centroid of the Vertices of an Arrangement and Related Problems
• Wireless Communication Is in APX
• The capacity of wireless networks
• Computing the Distance between Piecewise-Linear Bivariate Functions
• SINR Diagrams
• The topology of wireless communication
• Approximating Minimization Diagrams and Generalized Proximity Search

This page was built for publication: Batched Point Location in SINR Diagrams via Algebraic Tools