2262 search results - page 1 / 453 » Points with large quadrant-depth |
CCCG
2009
13 years 6 months ago
2009
We prove the following generalised empty pentagon theorem: for every integer 2, every sufficiently large set of points in the plane contains collinear points or an empty pentagon...
3DPVT
2006
IEEE
13 years 11 months ago
2006
IEEE
To support real-time computation with large, possibly evolving point clouds and range data, we fit a trimmed uniform tensor-product spline function from one direction. The graph ...
MLDM
2005
Springer
13 years 10 months ago
2005
Springer
In this paper we present a method to cluster large datasets that change over time using incremental learning techniques. The approach is based on the dynamic representation of clus...
COMPGEOM
2010
ACM
13 years 10 months ago
2010
ACM
We characterize the set of all pairs (a, b) such that for every set P of n points in general position in R2 there always exists a point p ∈ P and two opposite quadrants determin...
SIAMDM
2010
13 years 3 months ago
2010
We consider a variation of a problem stated by Erd˝os and Szekeres in 1935 about the existence of a number fES (k) such that any set S of at least fES (k) points in general posit...