Sciweavers

584 search results - page 78 / 117
» On the Number of Halving Planes
Sort
View
COMBINATORICS
1998
89views more  COMBINATORICS 1998»
14 years 9 months ago
Venn Diagrams with Few Vertices
An n-Venn diagram is a collection of n finitely-intersecting simple closed curves in the plane, such that each of the 2n sets X1 ∩X2 ∩· · ·∩Xn, where each Xi is the open...
Bette Bultena, Frank Ruskey
COMGEO
1999
ACM
14 years 9 months ago
Point labeling with sliding labels
This paper discusses algorithms for labeling sets of points in the plane, where labels are not restricted to some finite number of positions. We show that continuously sliding lab...
Marc J. van Kreveld, Tycho Strijk, Alexander Wolff
CORR
2011
Springer
174views Education» more  CORR 2011»
14 years 5 months ago
Hide-and-Seek with Directional Sensing
: We consider a game played between a hider, who hides a static object in one of several possible positions in a bounded planar region, and a searcher who wishes to reach the objec...
Alessandro Borri, Shaunak Dattaprasad Bopardikar, ...
COMPGEOM
2010
ACM
15 years 3 months ago
On degrees in random triangulations of point sets
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...
Micha Sharir, Adam Sheffer, Emo Welzl
ICCV
2007
IEEE
15 years 12 months ago
Learning 3-D Scene Structure from a Single Still Image
We consider the problem of estimating detailed 3-d structure from a single still image of an unstructured environment. Our goal is to create 3-d models which are both quantitative...
Ashutosh Saxena, Min Sun, Andrew Y. Ng