1672 search results - page 57 / 335 » Tightness problems in the plane |
151
click to vote
WDAG
2010
Springer
15 years 4 months ago
2010
Springer
Leader election and arbitrary pattern formation are fundammental tasks for a set of autonomous mobile robots. The former consists in distinguishing a unique robot, called the lead...
182
Voted
SODA
2008
ACM
15 years 7 months ago
2008
ACM
New tight bounds are presented on the minimum length of planar straight line graphs connecting n given points in the plane and having convex faces. Specifically, we show that the ...
157
click to vote
COMPGEOM
2007
ACM
15 years 9 months ago
2007
ACM
We prove an optimal generalization of the centerpoint theorem: given a set P of n points in the plane, there exist two points (not necessarily among input points) that hit all con...
144
Voted
COMPGEOM
1991
ACM
15 years 9 months ago
1991
ACM
We provide new combinatorial bounds on the complexity of a face in an arrangement of segments in the plane. In particular, we show that the complexity of a single face in an arran...
160
click to vote
ICIP
2003
IEEE
16 years 7 months ago
2003
IEEE
This paper focuses on the sampling problem in light field rendering (LFR) that is a fundamental approach to image based rendering. Quality of LFR depends on a light ray database g...