557 search results - page 31 / 112 » On the set multi-cover problem in geometric settings |
222
click to vote
COMPGEOM
2006
ACM
16 years 20 days ago
2006
ACM
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
155
click to vote
ISAAC
2007
Springer
16 years 25 days ago
2007
Springer
We solve several fundamental geometric problems under a new streaming model recently proposed by Ruhl et al. [2, 12]. In this model, in one pass the input stream can be scanned to ...
168
click to vote
PG
2007
IEEE
16 years 29 days ago
2007
IEEE
A new geometry-based finite difference method for a fast and reliable detection of perceptually salient curvature extrema on surfaces approximated by dense triangle meshes is pro...
215
click to vote
3DIM
1997
IEEE
15 years 11 months ago
1997
IEEE
Geometric fusion of multiple sets of overlapping surface measurements is an important problem for complete 3D object or environment modelling. Fusion based on a discrete implicit ...
177
click to vote
EDBT
2008
ACM
16 years 6 months ago
2008
ACM
We introduce a novel spatial join operator, the ring-constrained join (RCJ). Given two sets P and Q of spatial points, the result of RCJ consists of pairs p, q (where p P, q Q) ...