Sciweavers

279 search results - page 41 / 56
» Implicit Convex Polygons
Sort
View
77
Voted
ICPR
2002
IEEE
15 years 8 months ago
Detecting a Gazing Region by Visual Direction and Stereo Cameras
We develop a wearable vision system that consists of a user’s visual direction sensor and stereo cameras. First, we establish a method for calibrating the system so that it can ...
Akihiro Sugimoto, Akihiro Nakayama, Takashi Matsuy...
111
Voted
ICRA
1994
IEEE
111views Robotics» more  ICRA 1994»
15 years 7 months ago
From Spider Robots to Half Disk Robots
We study the problem of computing the set F of accessible and stable placements of a spider robot. The body of this robot is a single point and the legs are line segments attached...
Jean-Daniel Boissonnat, Olivier Devillers, Sylvain...
145
Voted
STOC
1995
ACM
115views Algorithms» more  STOC 1995»
15 years 7 months ago
Geometric lower bounds for parametric matroid optimization
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
David Eppstein
CCCG
2003
15 years 5 months ago
Network Design Subject to Facility Location
We consider the problem of designing a transportation network to allow the residents of the network to avail service provided by a single facility whose location is predetermined....
Laxmi Gewali, Joy Bhadury, Ramaswamy Chandrasekara...
129
Voted
JCO
2010
169views more  JCO 2010»
15 years 2 months 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