Sciweavers

138 search results - page 15 / 28
» K-Guarding Polygons on the Plane
Sort
View
114
Voted
IJCGA
2000
85views more  IJCGA 2000»
15 years 1 months ago
Obnoxious Facility Location: Complete Service with Minimal Harm
We present e cient algorithms for several instances of the following facility location problem. Facilities and demand sites are represented as points in the plane. Place k obnoxio...
Boaz Ben-Moshe, Matthew J. Katz, Michael Segal
TROB
2002
88views more  TROB 2002»
15 years 1 months ago
Gripper point contacts for part alignment
-- The initial resting pose of many industrial parts differs from the orientation desired for assembly. We show that it is possible to align parts during grasping using a standard ...
Mike Tao Zhang, Ken Goldberg
JCO
2010
169views more  JCO 2010»
15 years 9 days ago
An almost four-approximation algorithm for maximum weight triangulation
We consider the following planar maximum weight triangulation (MAT) problem: given a set of n points in the plane, find a triangulation such that the total length of edges in tria...
Shiyan Hu
FOCS
1997
IEEE
15 years 6 months ago
The Computational Complexity of Knot and Link Problems
We consider the problem of deciding whether a polygonal knot in 3dimensional Euclidean space is unknotted, capable of being continuously deformed without self-intersection so that...
Joel Hass, J. C. Lagarias, Nicholas Pippenger
101
Voted
CCCG
2006
15 years 3 months ago
Optimal Polygon Placement
Given a simple polygon P with m vertices and a set S of n points in the plane, we consider the problem of finding a rigid motion placement of P that contains the maximum number of...
Prosenjit Bose, Jason Morrison