137 search results - page 24 / 28 » On polygons excluding point sets |
101
Voted
COMPGEOM
1994
ACM
15 years 3 months ago
1994
ACM
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
104
click to vote
ALGOSENSORS
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We consider the problem of counting the number of indistinguishable targets using a simple binary sensing model. Our setting includes an unknown number of point targets i...
CVPR
2005
IEEE
16 years 1 months ago
2005
IEEE
This paper presents a novel 3D deformable surface that we call an active polyhedron. Rooted in surface evolution theory, an active polyhedron is a polyhedral surface whose vertice...
91
Voted
COMPGEOM
2004
ACM
15 years 5 months ago
2004
ACM
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
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 ...