2188 search results - page 50 / 438 » Instance-Optimal Geometric Algorithms |
EMMCVPR
2003
Springer
14 years 1 months ago
2003
Springer
This paper presents a novel method for surface recovery from discrete 3D point data sets. In order to produce improved reconstruction results, the algorithm presented in this paper...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We consider the problem of constructing bounded-degree planar geometric spanners of Euclidean and unit-disk graphs. It is well known that the Delaunay subgraph is a planar geometri...
PAM
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Internet coordinate systems appear promising as a method for estimating network distance without direct measurement, allowing scalable configuration of emerging applicat...
ICDCS
2008
IEEE
14 years 3 months ago
2008
IEEE
In this paper, we study the problem of minimum connected dominating set in geometric k-disk graphs. This research is motivated by the problem of virtual backbone construction in w...
CCS
2001
ACM
14 years 1 months ago
2001
ACM
We propose a novel and robust hashing paradigm that uses iterative geometric techniques and relies on observations that main geometric features within an image would approximately ...