Solving the \(k\)-influence region problem with the GPU

DOI10.1016/j.ins.2013.12.002zbMath1339.68264OpenAlexW2045467181MaRDI QIDQ2629989

J. Antoni Sellarès, Marta Fort

Publication date: 8 July 2016

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2013.12.002

zbMATH Keywords

visualizationcompetitive facility locationgraphics processing unit (GPU)decision-making support systeminfluence region

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10) Discrete location and assignment (90B80) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)

Related Items (2)

A mixed integer programming formulation and solution for traffic analysis zone delineation considering zone amount decision ⋮ On efficient \( k\)-optimal-location-selection query processing in metric spaces

Uses Software

• CUDA
• OpenCL

Cites Work

• Unnamed Item
• An optimal algorithm for constructing the weighted Voronoi diagram in the plane
• Facility location problems in the plane based on reverse nearest neighbor queries
• Finding a guard that sees most and a shop that sells most
• Using Voronoi diagrams to solve a hybrid facility location problem with attentive facilities
• Competitive Location Models: A Framework and Bibliography
• MAXIMIZING A VORONOI REGION: THE CONVEX CASE
• Static competitive facility location: an overview of optimisation approaches.

This page was built for publication: Solving the \(k\)-influence region problem with the GPU