We propose a new algorithm for the detection of all intersections between a set of balls and a general query object. The proposed algorithm does not impose any restrictive condition on the set of balls and utilises power diagrams to minimize the amount of intersection tests. The price for this is power diagram computation in a preprocessing step. © 2011 Springer-Verlag.
CITATION STYLE
Zemek, M., & Kolingerová, I. (2011). Power diagrams and intersection detection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6784 LNCS, pp. 163–173). https://doi.org/10.1007/978-3-642-21931-3_14
Mendeley helps you to discover research relevant for your work.