The January 1994 Symposium was jointly sponsored by the ACM Special Interest Group for Automata and Computability Theory and the SIAM Activity Group on Discrete Mathematics. Among the topics in 79 (unrefereed) papers: comparing point sets under projection; on-line search in a simple polygon; low- degree tests; maximal empty ellipsoids; roots of a polynomial and its derivatives; dynamic algebraic algorithms; fast comparison of evolutionary trees; an efficient algorithm for dynamic text editing; and tight bounds for dynamic storage allocation. No index. Annotation copyright by Book News, Inc., Portland, ORtruth assignment. ... We replace each of the two straight-line edges of P, - by aquot; concave chains, aquot; bent inward, and also make a small aquot;dentaquot; at the tip of the circular arc s, -;-, as shown in Figure 2. ... a#39;This condition says that, in the final construction when the black and white points have been translated to their correct z-plane, theanbsp;...

Title | : | Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms |

Author | : | |

Publisher | : | SIAM - 1994-01-01 |

Continue