Sciweavers

7351 search results - page 60 / 1471
» Segmenting Point Sets
Sort
View
COMGEO
2004
ACM
13 years 9 months ago
A lower bound on the number of triangulations of planar point sets
We show that the number of straight-edge triangulations exhibited by any set of n points in general position in the plane is bounded from below by (2.33n). 2004 Elsevier B.V. All ...
Oswin Aichholzer, Ferran Hurtado, Marc Noy
ECRTS
2010
IEEE
13 years 11 months ago
Preemption Points Placement for Sporadic Task Sets
Abstract--Limited preemption scheduling has been introduced as a viable alternative to non-preemptive and fullypreemptive scheduling when reduced blocking times need to coexist wit...
Marko Bertogna, Giorgio C. Buttazzo, Mauro Marinon...
IPCO
2007
114views Optimization» more  IPCO 2007»
13 years 11 months ago
Distinct Triangle Areas in a Planar Point Set
Erd˝os, Purdy, and Straus conjectured that the number of distinct (nonzero) areas of the triangles determined by n noncollinear points in the plane is at least n−1 2 , which is...
Adrian Dumitrescu, Csaba D. Tóth
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
14 years 10 months ago
Searching dynamic point sets in spaces with bounded doubling dimension
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
Richard Cole, Lee-Ad Gottlieb
ICCV
2003
IEEE
14 years 3 months ago
Combinatorial Constraints on Multiple Projections of a Set of Points
Multiple projections of a scene cannot be arbitrary, the allowed configurations being given by matching constraints. This paper presents new matching constraints on multiple proj...
Tomás Werner