1 citations · 1 across the 8 of their papers we have counts for
Showing 2012 · cs.DSShow all
2 papers · 2 filters
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…