B.K. Bhattacharya and G.T. Toussaint, \A counter example to a diameter algorithm for convex polygons," IEEE Trans. Pattern Analysis and Machine Intelligence, Vol. PAMI4, May 1982 pp. 306-309. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On the Role of Kinesthetic Thinking in Computational Geometry - Antoni Sellar Es Self-citation (Toussaint) (Correct)
No context found.
B.K. Bhattacharya and G.T. Toussaint, \A counter example to a diameter algorithm for convex polygons," IEEE Trans. Pattern Analysis and Machine Intelligence, Vol. PAMI4, May 1982 pp. 306-309.
On the Role of Kinesthetic Thinking in Computational Geometry - Antoni Sellar Es Self-citation (Toussaint) (Correct)
No context found.
B.K. Bhattacharya and G.T. Toussaint, "A counter example to a diameter algorithm for convex polygons," IEEE Trans. Pattern Analysis and Machine Intelligence, Vol. PAMI4, May 1982 pp. 306-309.
On the Role of Logical, Visual and Kinesthetic Thinking in.. - Toussaint (1984) Self-citation (Toussaint) (Correct)
No context found.
B.K. Bhattacharya and G.T. Toussaint, "A counter example to a diameter algorithm for convex polygons," IEEE Trans. Pattern Analysis and Machine Intelligence, Vol. PAMI-4, May 1982? pp. 306-309.
On the Role of Kinesthetic Thinking in Computational Geometry - Sellares, Toussaint Self-citation (Toussaint) (Correct)
....of a strong kinesthetic heuristic which is so convincing it would appear not to require a proof. Again, no proof of correctness was published with this algorithm. While the algorithm is very fast indeed and runs in time proportional to n, it is in fact incorrect. A counter example is given in [21] but the readers are invited to discover one on their own before checking [21] The reason for failure is similar to that for algorithm CH3. As is often the case in so called hill climbing procedures such as these, algorithm Dl can get stuck in a local rather than global maximum. The rotating ....
....not to require a proof. Again, no proof of correctness was published with this algorithm. While the algorithm is very fast indeed and runs in time proportional to n, it is in fact incorrect. A counter example is given in [21] but the readers are invited to discover one on their own before checking [21]. The reason for failure is similar to that for algorithm CH3. As is often the case in so called hill climbing procedures such as these, algorithm Dl can get stuck in a local rather than global maximum. The rotating calipers heuristic: This is a dynamic version of the sandwich heuristic. One way ....
[Article contains additional citation context not shown here]
B.K. Bhattacharya and G.T. Toussaint, \A counter example to a diameter algorithm for convex polygons," IEEE Trans. Pattern Analysis and Machine Intelligence, Vol. PAMI4, May 1982 pp. 306-309.
On the Role of Kinesthetic Thinking in Computational Geometry - Sellares, Toussaint Self-citation (Toussaint) (Correct)
....of a strong kinesthetic heuristic which is so convincing it would appear not to require a proof. Again, no proof of correctness was published with this algorithm. While the algorithm is very fast indeed and runs in time proportional to n, it is in fact incorrect. A counter example is given in [21] but the readers are invited to discover one on their own before checking [21] The reason for failure is similar to that for algorithm CH3. As is often the case in so called hill climbing procedures such as these, algorithm Dl can get stuck in a local rather than global maximum. The rotating ....
....not to require a proof. Again, no proof of correctness was published with this algorithm. While the algorithm is very fast indeed and runs in time proportional to n, it is in fact incorrect. A counter example is given in [21] but the readers are invited to discover one on their own before checking [21]. The reason for failure is similar to that for algorithm CH3. As is often the case in so called hill climbing procedures such as these, algorithm Dl can get stuck in a local rather than global maximum. The rotating calipers heuristic: This is a dynamic version of the sandwich heuristic. One way ....
[Article contains additional citation context not shown here]
B.K. Bhattacharya and G.T. Toussaint, "A counter example to a diameter algorithm for convex polygons," IEEE Trans. Pattern Analysis and Machine Intelligence, Vol. PAMI4, May 1982 pp. 306-309.
Characterizations of Convex and Star-Shaped Polygons - Shermer, Toussaint (1988) Self-citation (Toussaint) (Correct)
....views of the object and thus further this understanding [Fa] Kl] SV] Va] Computer scientists on the other hand are interested in designing algorithms for recognizing such objects. Different characterizations yield different algorithms with different complexities for solving such problems [ATB] [BT], To] A simple polygon P is said to be convex if every pair of points x,y in P can be joined by a line segment [x,y] that lies totally in P. This very well known characterization of convex polygons is equivalent to the demand that all three of the segments determined by each triplet of pairwise ....
....vertex. It was incorrectly assumed for some time that a polygon was convex if all its vertices were unimodal in this sense. Furthermore algorithms for computing geometric structures based on this assumption have been published. However, counter examples to the claim [ATB] and to such algorithms [BT] have since appeared. Just as we measured Euclidean distance between pairs of vertices to create f(z) we can instead consider vertex edge or edge vertex pairs and measure the separation as the perpendicular distance between the vertex and the line collinear with the edge in question. In this way ....
Bhattacharya, B.K. and Toussaint, G.T., "A counterexample to a diameter algorithm for convex polygons," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. PAMI4, No. 3, May 1982, pp. 306-309.
On the Role of Logical, Visual and Kinesthetic Thinking in.. - Toussaint Self-citation (Toussaint) (Correct)
....another example of a convincing kinesthetic heuristic which would appear not to require a proof. In fact no proof of correctness was published with this algorithm. While the algorithm is very fast indeed and runs in time proportional to n, it is in fact incorrect. A counter example is given in [21] but the readers should discover one on their own. The reason for failure is similar to that for algorithm CH 3. As is often the case in hill climbing procedures, algorithm D l can get stuck in a local rather than global extremum. The rotating caliper heuristic: This is a dynamic version of the ....
B.K. Bhattacharya and G.T. Toussaint, "A counter example to a diameter algorithm for convex polygons," IEEE Trans. Pattern Analysis and Machine Intelligence, Vol. PAMI-4, May 1982? pp. 306-309.
Computing Geodesic Properties Inside a Simple Polygon - Toussaint (1989) (4 citations) Self-citation (Toussaint) (Correct)
No context found.
Bhattacharya, B. K. and Toussaint, G. T., "A counterexample to a diameter algorithm for convex polygons," IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. PAMI-4, No. 3., May 1982, pp. 306-309.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC