1 citations · 1 across the 8 of their papers we have counts for
Showing 2012Show all
3 papers · 1 filter
cs.DS2012
A Simple Algorithm for Computing BOCP
Jack Wang
In this article, we devise a concise algorithm for computing BOCP. Our method is simple, easy-to-implement but without loss of efficiency. Given two circular-arc polygons with …
cs.DS2012
Finding Efficient Region in The Plane with Line segments
Jack Wang
Let be a set of disjoint obstacles in , be a moving object. Let and denote the starting point and maximum path length of the mov…
cs.DB2012
A PRQ Search Method for Probabilistic Objects
Jack Wang
This article proposes an PQR search method for probabilistic objects. The main idea of our method is to use a strategy called \textit{pre-approximation} that can reduce the initial…