Sciweavers

1607 search results - page 2 / 322
» A practical approach for computing the diameter of a point s...
Sort
View
FOCS
1994
IEEE
13 years 9 months ago
Randomized and deterministic algorithms for geometric spanners of small diameter
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
Sunil Arya, David M. Mount, Michiel H. M. Smid
DATE
2004
IEEE
128views Hardware» more  DATE 2004»
13 years 9 months ago
Enhanced Diameter Bounding via Structural
Bounded model checking (BMC) has gained widespread industrial use due to its relative scalability. Its exhaustiveness over all valid input vectors allows it to expose arbitrarily ...
Jason Baumgartner, Andreas Kuehlmann
VC
2008
126views more  VC 2008»
13 years 5 months ago
Efficient reconstruction from non-uniform point sets
Abstract We propose a method for non-uniform reconstruction of 3D scalar data. Typically, radial basis functions, trigonometric polynomials or shift-invariant functions are used in...
Erald Vuçini, Torsten Möller, M. Eduar...
CP
2007
Springer
13 years 9 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
COMPGEOM
1993
ACM
13 years 10 months ago
Approximating Center Points with Iterated Radon Points
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
Kenneth L. Clarkson, David Eppstein, Gary L. Mille...