507 search results - page 1 / 102 » How good is the Chord algorithm |
SODA
2010
ACM
14 years 5 months ago
2010
ACM
The Chord algorithm is a popular, simple method for the succinct approximation of curves, which is widely used, under different names, in a variety of areas, such as, multiobjecti...
TCS
2002
13 years 8 months ago
2002
The chords' problem is a variant of an old problem of computational geometry: given a set of points of n , one can easily build the multiset of the distances between the poi...
IWCIA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Several authors have proposed algorithms for curve partitioning using the arc-chord distance formulation, where a chord whose associated arc spans k pixels is moved along...
COMPGEOM
1995
ACM
14 years 2 days ago
1995
ACM
A convex polytope P can be speci ed in two ways: as the convex hull of the vertex set V of P, or as the intersection of the set H of its facet-inducing halfspaces. The vertex enum...
AAAI
2008
13 years 10 months ago
2008
Heuristic search using algorithms such as A and IDA is the prevalent method for obtaining optimal sequential solutions for classical planning tasks. Theoretical analyses of these ...