Sciweavers

138 search results - page 18 / 28
» K-Guarding Polygons on the Plane
Sort
View
EJC
2008
13 years 7 months ago
A simple proof for open cups and caps
Let X be a set of points in general position in the plane. General position means that no three points lie on a line and no two points have the same x-coordinate. Y X is a cup, r...
Jakub Cerný
CCCG
2008
13 years 9 months ago
Exact Pareto-Optimal Coordination of Two Translating Polygonal Robots on a Cyclic Roadmap
We consider planning optimal collision-free motions of two polygonal robots under translation. Each robot has a reference point that must lie on a given graph, called a roadmap, w...
Hamid Reza Chitsaz, Steven M. LaValle, Jason M. O'...
IJCGA
2007
55views more  IJCGA 2007»
13 years 7 months ago
Parabola Separation Queries and their Application to Stone Throwing
Given two sets A and B of m non-intersecting line segments in the plane, we show how to compute in O(m log m) time a data structure that uses O(m) space and allows to answer the fo...
Otfried Cheong, Hazel Everett, Hyo-Sil Kim, Sylvai...
CVPR
2001
IEEE
14 years 9 months ago
Light Field Rendering for Large-Scale Scenes
In this paper, we present an efficient method to synthesize large-scale scenes, such as broad city landscapes. To date, model based approaches have mainly been adopted for this pu...
Hiroshi Kawasaki, Katsushi Ikeuchi, Masao Sakauchi
WADS
2009
Springer
243views Algorithms» more  WADS 2009»
14 years 2 months ago
Resolving Loads with Positive Interior Stresses
We consider the pair (pi, fi) as a force with two-dimensional direction vector fi applied at the point pi in the plane. For a given set of forces we ask for a non-crossing geometri...
Günter Rote, André Schulz