138 search results - page 1 / 28 » K-Guarding Polygons on the Plane |
MICS
2010
13 years 3 months ago
2010
The Newton polygon of the implicit equation of a rational plane curve is explicitly determined by the multiplicities of any of its parametrizations. We give an intersection-theoret...
CCCG
2008
13 years 6 months ago
2008
We propose a new model of realistic input: k-guardable objects. An object is k-guardable if its boundary can be seen by k guards in the interior of the object. In this abstract, w...
LATIN
2010
Springer
13 years 12 months ago
2010
Springer
Given a set S of segments in the plane, a polygon P is an intersecting polygon of S if every segment in S intersects the interior or the boundary of P. The problem MPIP of computi...
TCS
2010
13 years 3 months ago
2010
We give an O(n2 m + nm2 + m2 log m) time and O(n2 + m2 ) space algorithm for finding the shortest traveling salesman tour through the vertices of two simple polygonal obstacles i...
IROS
2008
IEEE
13 years 11 months ago
2008
IEEE
— A very fast but nevertheless accurate approach for surface extraction from noisy 3D point clouds is presented. It consists of two parts, namely a plane fitting and a polygonal...