140 search results - page 14 / 28 » Computing the visibility graph of points within a polygon |
110
click to vote
CAD
2011
Springer
14 years 3 months ago
2011
Springer
The behavior of Catmull-Rom curves heavily depends on the choice of parameter values at the control points. We analyze a class of parameterizations ranging from uniform to chordal...
ICRA
2003
IEEE
15 years 5 months ago
2003
IEEE
Abstract— This paper addresses the problem of capturing an arbitrary convex object P in the plane with three congruent disc-shaped robots. Given two stationary robots in contact ...
IWOCA
2009
Springer
15 years 6 months ago
2009
Springer
A vertex subset D of a graph G is a dominating set if every vertex of G is either in D or is adjacent to a vertex in D. The paired-domination problem on G asks for a minimum-cardi...
FOCS
2002
IEEE
15 years 4 months ago
2002
IEEE
Every compact orientable boundaryless surface M can be cut along simple loops with a common point v0, pairwise disjoint except at v0, so that the resulting surface is a topologica...
106
click to vote
GMP
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract. Semi-algebraic sets occur naturally when dealing with implicit models and boolean operations between them. In this work we present an algorithm to efficiently and in a ce...