Sciweavers

240 search results - page 32 / 48
» Locating an obnoxious plane
Sort
View
CCCG
2010
14 years 11 months ago
Evading equilateral triangles without a map
Consider an arrangement of equilateral non-overlapping translated triangles in the plane and two points S and T so that the segment ST is parallel to a side of each of the triangl...
Braxton Carrigan
CCCG
2010
14 years 11 months ago
Direction assignment in wireless networks
In this paper we consider a wireless network, where each transceiver is equipped with a directional antenna, and study two direction assignment problems, determined by the type of...
Boaz Ben-Moshe, Paz Carmi, Lilach Chaitman, Matthe...
SODA
2004
ACM
127views Algorithms» more  SODA 2004»
14 years 11 months ago
An optimal randomized algorithm for maximum Tukey depth
We present the first optimal algorithm to compute the maximum Tukey depth (also known as location or halfspace depth) for a non-degenerate point set in the plane. The algorithm is...
Timothy M. Chan
BMVC
1998
14 years 11 months ago
3D Trajectories from a Single Viewpoint using Shadows
We consider the problem of obtaining the 3D trajectory of a ball from a sequence of images taken with a camera which is possibly rotating and zooming (but not translating). Techni...
Ian D. Reid, A. North
JGTOOLS
2007
67views more  JGTOOLS 2007»
14 years 10 months ago
Unified Distance Formulas for Halfspace Fog
Abstract. In many real-time rendering applications, it is necessary to model a fog volume that is bounded by a single plane but is otherwise infinite in extent. This paper presents...
Eric Lengyel